10 papers
Polynomial-Based Solutions to Targeting Problems for Onboard Applications
Adam Evans, Alberto Fossa, Roberto Armellin +2
This paper solves the targeting problem focusing on accuracy, computational efficiency, and reliability. The trajectory optimization problem is first recast as a polynomial optimiz…
Extreme points and faces in the moment problem
Didier Henrion, Martin KružÃk, Stephan Weis
The polyconvex envelope, used in the calculus of variations and elasticity theory, was expressed by Dacorogna pointwise as a linear program on finitely atomic measures on the space…
Composition and tensor train structure in polynomial optimization
Llorenç Balada Gaggioli, Didier Henrion, Milan Korda
We study polynomial optimization problems whose objective has a composition or tensor train structure. These polynomials can be evaluated as a sequence of maps, giving rise to inte…
Mollified Christoffel-Darboux Kernels and Density Recovery on Varieties
Leandro Bentancur, Didier Henrion, Mauricio Velasco
We introduce mollified Christoffel-Darboux (CD) kernels on varieties, a systematic regularization of the classical CD kernel associated with a probability measure on a compact doma…
Solving Stengle's Example in Rational Arithmetic: Exact Values of the Moment-SOS Relaxations
Didier Henrion
We revisit Stengle's classical univariate polynomial optimization example whose constraint description is degenerate at the minimizers. We pro…
Density, Determinacy, Duality and a Regularized Moment-SOS Hierarchy
Didier Henrion
The standard moment-sum-of-squares (SOS) hierarchy is a powerful method for solving global polynomial optimization problems. However, its convergence relies on Putinar's Positivste…