On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
From MaRDI portal
Publication:3105776
DOI10.1137/100814147zbMath1230.90199OpenAlexW2001334051MaRDI QIDQ3105776
Etienne de Klerk, Monique Laurent
Publication date: 9 January 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100814147
semidefinite programmingPositivstellensatzsum of squares of polynomialsconvex polynomial optimization
Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, A bounded degree SOS hierarchy for polynomial optimization, Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness, On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets, Homogenization for polynomial optimization with unbounded sets, Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems, Exact SDP relaxations for classes of nonlinear semidefinite programming problems, A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization, Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials, On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems, Convex generalized Nash equilibrium problems and polynomial optimization, On polynomial optimization over non-compact semi-algebraic sets, A multilevel analysis of the Lasserre hierarchy, Exact conic programming relaxations for a class of convex polynomial cone programs, DC decomposition of nonconvex polynomials with algebraic techniques, Robust SOS-convex polynomial optimization problems: exact SDP relaxations, Matrix convex hulls of free semialgebraic sets, A Matrix Positivstellensatz with Lifting Polynomials, Stochastic polynomial optimization, Positive Maps and Separable Matrices, Tight relaxations for polynomial optimization and Lagrange multiplier expressions
