Certifying convergence of Lasserre's hierarchy via flat truncation
From MaRDI portal
Publication:2434992
Abstract: This paper studies how to certify the convergence of Lasserre's hierarchy of semidefinite programming relaxations for solving multivariate polynomial optimization. We propose flat truncation as a general certificate for this purpose. Assume the set of global minimizers is nonempty and finite. Our main results are: i) Putinar type Lasserre's hierarchy has finite convergence if and only if flat truncation holds, under some general assumptions, and this is also true for the Schmudgen type one; ii) under the archimedean condition, flat truncation is asymptotically satisfied for Putinar type Lasserre's hierarchy, and similar is true for the Schmudgen type one; iii) for the hierarchy of Jacobian SDP relaxations, flat truncation is always satisfied. The case of unconstrained polynomial optimization is also discussed.
Recommendations
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction
- A bounded degree SOS hierarchy for polynomial optimization
- Convergence of Lasserre's hierarchy: the general case
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
Cites work
- scientific article; zbMATH DE number 47995 (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 1984325 (Why is no real title available?)
- A semidefinite approach for truncated \(K\)-moment problems
- Algebraic degree of polynomial optimization
- An exact Jacobian SDP relaxation for polynomial optimization
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Minimizing polynomials via sum of squares over the gradient ideal
- On the complexity of Putinar's Positivstellensatz
- Optimization of Polynomials on Compact Semialgebraic Sets
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Semidefinite representations for finite varieties
- Sums of squares of regular functions on real algebraic varieties
- Sums of squares, moment matrices and optimization over polynomials
- The K-moment problem for compact semi-algebraic sets
- Truncated \(K\)-moment problems in several variables
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(69)- A semidefinite method for tensor complementarity problems
- The saddle point problem of polynomials
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- Separability of Hermitian tensors and PSD decompositions
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- On solving a class of fractional semi-infinite polynomial programming problems
- The maximum tensor complementarity eigenvalues
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- Stochastic polynomial optimization
- Higher-degree tensor eigenvalue complementarity problems
- Tensor complementarity problems. II: Solution methods
- Dehomogenization for completely positive tensors
- Distributionally robust optimization with moment ambiguity sets
- An SDP relaxation method for Perron pairs of a nonnegative tensor
- Convergence of Lasserre's hierarchy: the general case
- A note on convex relaxations for the inverse eigenvalue problem
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- Tensor eigenvalue complementarity problems
- Rational Generalized Nash Equilibrium Problems
- Local saddle points for unconstrained polynomial optimization
- A global optimization method for multiple response optimization problems
- Minimizing trigonometric matrix polynomials over semi-algebraic sets
- A utopia point method-based robust vector polynomial optimization scheme
- Hausdorff distance between convex semialgebraic sets
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Saddle points of rational functions
- Real eigenvalues of nonsymmetric tensors
- Tensor maximal correlation problems
- Homogenization for polynomial optimization with unbounded sets
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Test of copositive tensors
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
- The moment-SOS hierarchy: applications and related topics
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- Algebraic optimization of sequential decision problems
- Gposolver: a Matlab/C++ toolbox for global polynomial optimization
- Tensor \(Z\)-eigenvalue complementarity problems
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
- Linear optimization with cones of moments and nonnegative polynomials
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Monotonically positive matrices
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- Partially positive matrices
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- Certifying the global optimality of quartic minimization over the sphere
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Hermitian completely positive matrices
- Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction
- Well-posedness in unconstrained polynomial optimization problems
- Generic properties for semialgebraic programs
- Robust approximation of chance constrained optimization with polynomial perturbation
- The multivariate eigenvalues of symmetric tensors
- A Lagrange multiplier expression method for bilevel polynomial optimization
- Positive maps and separable matrices
- A semidefinite relaxation method for second-order cone polynomial complementarity problems
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
- A new approximation hierarchy for polynomial conic optimization
- Bilevel polynomial programs and semidefinite relaxation methods
- Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints
- Quadratic tensor eigenvalue complementarity problems
- Convex generalized Nash equilibrium problems and polynomial optimization
- Completely positive tensors in the complex field
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection
- Semidefinite relaxations for semi-infinite polynomial programming
- (Global) optimization: historical notes and recent developments
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
This page was built for publication: Certifying convergence of Lasserre's hierarchy via flat truncation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434992)
