Optimality conditions and finite convergence of Lasserre's hierarchy
From MaRDI portal
Publication:403636
DOI10.1007/s10107-013-0680-xzbMath1300.65041arXiv1206.0319OpenAlexW1964603869MaRDI QIDQ403636
Publication date: 29 August 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.0319
optimality conditionsfinite convergencepolynomial optimizationsum of squaressemidefinite programLasserre's hierarchy
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)
Related Items (98)
Convergence of Lasserre's hierarchy: the general case ⋮ Separability of Hermitian tensors and PSD decompositions ⋮ Homogeneous polynomials and spurious local minima on the unit sphere ⋮ Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets ⋮ Stability and genericity for semi-algebraic compact programs ⋮ Computing the distance between the linear matrix pencil and the completely positive cone ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ On the complexity of Putinar-Vasilescu's Positivstellensatz ⋮ Set-membership errors-in-variables identification of MIMO linear systems ⋮ Positivity certificates and polynomial optimization on non-compact semialgebraic sets ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices ⋮ Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph ⋮ The saddle point problem of polynomials ⋮ Tensor eigenvalue complementarity problems ⋮ A bounded degree SOS hierarchy for polynomial optimization ⋮ Qualification Conditions in Semialgebraic Programming ⋮ Solving rank-constrained semidefinite programs in exact arithmetic ⋮ Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints ⋮ Bilevel Polynomial Programs and Semidefinite Relaxation Methods ⋮ Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools ⋮ Homogenization for polynomial optimization with unbounded sets ⋮ Algebraic optimization of sequential decision problems ⋮ One-shot set-membership identification of generalized Hammerstein-Wiener systems ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ A hierarchy of spectral relaxations for polynomial optimization ⋮ Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ Partially positive matrices ⋮ Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems ⋮ A unified framework for the identification of a general class of multivariable nonlinear block‐structured systems ⋮ Optimality conditions for homogeneous polynomial optimization on the unit sphere ⋮ Dehomogenization for completely positive tensors ⋮ Interiors of completely positive cones ⋮ (Global) optimization: historical notes and recent developments ⋮ A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization ⋮ A utopia point method-based robust vector polynomial optimization scheme ⋮ On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials ⋮ Generalized truncated moment problems with unbounded sets ⋮ Hermitian completely positive matrices ⋮ An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization ⋮ Completely positive tensors in the complex field ⋮ Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials ⋮ Invariants of SDP exactness in quadratic programming ⋮ On continuous selections of polynomial functions ⋮ Second Order Conditions to Decompose Smooth Functions as Sums of Squares ⋮ Generic Properties for Semialgebraic Programs ⋮ Real Radicals and Finite Convergence of Polynomial Optimization Problems ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ An effective version of Schmüdgen's Positivstellensatz for the hypercube ⋮ On the complexity of testing attainment of the optimal value in nonlinear optimization ⋮ Symmetric Tensor Nuclear Norms ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis ⋮ On polynomial optimization over non-compact semi-algebraic sets ⋮ The \(\mathcal A\)-truncated \(K\)-moment problem ⋮ A note on convex relaxations for the inverse eigenvalue problem ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ A multilevel analysis of the Lasserre hierarchy ⋮ Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension ⋮ Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables ⋮ LP Formulations for Polynomial Optimization Problems ⋮ New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming ⋮ Real eigenvalues of nonsymmetric tensors ⋮ Tensor maximal correlation problems ⋮ Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers ⋮ Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony? ⋮ Robust SOS-convex polynomial optimization problems: exact SDP relaxations ⋮ Well-Posedness in Unconstrained Polynomial Optimization Problems ⋮ A new algorithm for concave quadratic programming ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems ⋮ A survey on conic relaxations of optimal power flow problem ⋮ The CP-Matrix Approximation Problem ⋮ The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials ⋮ Tensor \(Z\)-eigenvalue complementarity problems ⋮ Computing lower rank approximations of matrix polynomials ⋮ Best Nonnegative Rank-One Approximations of Tensors ⋮ Strong duality in lasserre's hierarchy for polynomial optimization ⋮ Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes ⋮ Stochastic polynomial optimization ⋮ A mixed PI/VI design method for nonlinear H∞ Control ⋮ Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities ⋮ Positive Maps and Separable Matrices ⋮ The moment-SOS hierarchy and the Christoffel-Darboux kernel ⋮ Monotonically positive matrices ⋮ Linear optimization with cones of moments and nonnegative polynomials ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ Saddle points of rational functions ⋮ A semidefinite relaxation algorithm for checking completely positive separable matrices ⋮ In SDP Relaxations, Inaccurate Solvers Do Robust Optimization ⋮ A sublevel moment-SOS hierarchy for polynomial optimization ⋮ Exact Algorithms for Linear Matrix Inequalities ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ Tight relaxations for polynomial optimization and Lagrange multiplier expressions ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Distributionally robust optimization with moment ambiguity sets ⋮ Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discriminants and nonnegative polynomials
- Semidefinite representations for finite varieties
- An exact Jacobian SDP relaxation for polynomial optimization
- Representations of non-negative polynomials having finitely many zeros
- Distinguished representations of non-negative polynomials
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Non-existence of degree bounds for weighted sums of squares representations
- Global Optimization with Polynomials and the Problem of Moments
- Polynomial Optimization with Real Varieties
- GloptiPoly 3: moments, optimization and semidefinite programming
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Sums of squares of regular functions on real algebraic varieties
- Algebraic Degree of Polynomial Optimization
- GloptiPoly
This page was built for publication: Optimality conditions and finite convergence of Lasserre's hierarchy
