Abstract
We consider the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): {\mathbb{R}}^n\to {\mathbb{R}}$, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems. A notion of Karush--Kuhn--Tucker polynomials is introduced in a global optimality condition. Some illustrative examples are provided.
Keywords
MathematicsSequence (biology)PolynomialLinear matrix inequalityCombinatoricsConvex optimizationRegular polygonSet (abstract data type)Discrete mathematicsApplied mathematicsPure mathematicsMathematical optimizationMathematical analysis
Affiliated Institutions
Related Publications
GloptiPoly
GloptiPoly is a Matlab/SeDuMi add-on to build and solve convex linear matrix inequality relaxations of the (generally nonconvex) global optimization problem of minimizing a mult...
A globally convergent primal-dual interior point method for constrained optimization
Abstract This paper proposes a primal-dual interior point method for solving general nonlinearly constrained optimization problems. The method is based on solving the Barrier Ka...
The Power of Convex Relaxation: Near-Optimal Matrix Completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a ...
Interior-Point Polynomial Algorithms in Convex Programming
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynom...
Commentary—Interior-Point Methods: Algorithms and Formulations
The paper by Lustig, Marsten, and Shanno (LMS) gives an excellent presentation of the current state of the art for interior-point methods (as represented by their OB1 code) as i...
Publication Info
- Year
- 2001
- Type
- article
- Volume
- 11
- Issue
- 3
- Pages
- 796-817
- Citations
- 2531
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2531
OpenAlex
Cite This
Jean B. Lasserre
(2001).
Global Optimization with Polynomials and the Problem of Moments.
SIAM Journal on Optimization
, 11
(3)
, 796-817.
https://doi.org/10.1137/s1052623400366802
Identifiers
- DOI
- 10.1137/s1052623400366802