Optimality conditions and finite convergence of Lasserre's hierarchy
From MaRDI portal
Publication:403636
Abstract: Lasserre's hierarchy is a sequence of semidefinite relaxations for solving polynomial optimization problems globally. This paper studies the relationship between optimality conditions in nonlinear programming theory and finite convergence of Lasserre's hierarchy. Our main results are: i) Lasserre's hierarchy has finite convergence when the constraint qualification, strict complementarity and second order sufficiency conditions hold at every global minimizer, under the standard archimedean assumption; the proof uses a result of Marshall on boundary hessian conditions. ii) these optimality conditions are all satisfied at every local minimizer if a finite set of polynomials, which are in the coefficients of input polynomials, do not vanish at the input data (i.e., they hold in a Zariski open set). This implies that Lasserre's hierarchy has finite convergence generically.
Recommendations
- On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Convergence of Lasserre's hierarchy: the general case
- Polynomial optimization with real varieties
Cites work
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- Algebraic degree of polynomial optimization
- An exact Jacobian SDP relaxation for polynomial optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Discriminants and nonnegative polynomials
- Distinguished representations of non-negative polynomials
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- GloptiPoly 3: moments, optimization and semidefinite programming
- Non-existence of degree bounds for weighted sums of squares representations
- Polynomial optimization with real varieties
- Positive polynomials and sums of squares
- Positivity and sums of squares: a guide to recent results
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- Representations of non-negative polynomials having finitely many zeros
- Semidefinite representations for finite varieties
- Sums of squares of regular functions on real algebraic varieties
- Sums of squares, moment matrices and optimization over polynomials
Cited in
(only showing first 100 items - show all)- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- A new approximation hierarchy for polynomial conic optimization
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
- Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
- Convergence of Lasserre's hierarchy: the general case
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
- Partially positive matrices
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Stability and genericity for semi-algebraic compact programs
- On solving a class of fractional semi-infinite polynomial programming problems
- The saddle point problem of polynomials
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- On the complexity of testing attainment of the optimal value in nonlinear optimization
- On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems
- Tensor \(Z\)-eigenvalue complementarity problems
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- A hierarchy of spectral relaxations for polynomial optimization
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- Monotonically positive matrices
- A new algorithm for concave quadratic programming
- A survey on conic relaxations of optimal power flow problem
- Distributionally robust optimization with moment ambiguity sets
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Best nonnegative rank-one approximations of tensors
- LP formulations for polynomial optimization problems
- A bounded degree SOS hierarchy for polynomial optimization
- Qualification Conditions in Semialgebraic Programming
- Exact algorithms for linear matrix inequalities
- Computing the distance between the linear matrix pencil and the completely positive cone
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- Polynomial optimization with real varieties
- On polynomial optimization over non-compact semi-algebraic sets
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Computing lower rank approximations of matrix polynomials
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Well-posedness in unconstrained polynomial optimization problems
- Strong duality in lasserre's hierarchy for polynomial optimization
- On the complexity of Putinar-Vasilescu's Positivstellensatz
- Symmetric tensor nuclear norms
- A sublevel moment-SOS hierarchy for polynomial optimization
- Linear optimization with cones of moments and nonnegative polynomials
- A multilevel analysis of the Lasserre hierarchy
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems
- Tensor eigenvalue complementarity problems
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- A unified framework for the identification of a general class of multivariable nonlinear block‐structured systems
- Interiors of completely positive cones
- Semidefinite relaxations for semi-infinite polynomial programming
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Completely positive tensor recovery with minimal nuclear value
- Set-membership errors-in-variables identification of MIMO linear systems
- Stochastic polynomial optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Real eigenvalues of nonsymmetric tensors
- Generic properties for semialgebraic programs
- Tensor maximal correlation problems
- Bilevel polynomial programs and semidefinite relaxation methods
- Hermitian completely positive matrices
- Positive maps and separable matrices
- The moment-SOS hierarchy and the Christoffel-Darboux kernel
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
- Real radicals and finite convergence of polynomial optimization problems
- The \(\mathcal A\)-truncated \(K\)-moment problem
- A Lagrange multiplier expression method for bilevel polynomial optimization
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- Towards global solutions for nonconvex two-stage stochastic programs: a polynomial lower approximation approach
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- Global minimization of polynomial integral functionals
- Certifying the global optimality of quartic minimization over the sphere
- Sum-of-squares certificates for copositivity via test states
- Invariants of SDP exactness in quadratic programming
- Homogenization for polynomial optimization with unbounded sets
- The CP-matrix approximation problem
- Separability of Hermitian tensors and PSD decompositions
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- (Global) optimization: historical notes and recent developments
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- Completely positive tensors in the complex field
- Second Order Conditions to Decompose Smooth Functions as Sums of Squares
- A note on convex relaxations for the inverse eigenvalue problem
- Generalized truncated moment problems with unbounded sets
- Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
- A mixed PI/VI design method for nonlinear \(H_\infty\) control
- Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
- scientific article; zbMATH DE number 7313221 (Why is no real title available?)
- One-shot set-membership identification of generalized Hammerstein-Wiener systems
- On continuous selections of polynomial functions
- Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints
- The moment-SOS hierarchy: applications and related topics
This page was built for publication: Optimality conditions and finite convergence of Lasserre's hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403636)
