On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets

DOI10.1137/17M1128290zbMath1397.90296arXiv1704.07231WikidataQ129701460 ScholiaQ129701460MaRDI QIDQ4571879

Tom-Lukas Kriel, Markus Schweighofer

Publication date: 3 July 2018

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.07231

zbMATH Keywords

semidefinite programminglinear matrix inequalitypolynomial optimizationsum of squaresspectrahedronLasserre relaxationmoment relaxationbasic closed semialgebraic setsemidefinitely representable set

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Convex functions and convex programs in convex geometry (52A41) Semialgebraic sets and related spaces (14P10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Real algebra (13J30)

Related Items (4)

Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph ⋮ On the exactness of Lasserre relaxations and pure states over real closed fields ⋮ Shape, scale, and minimality of matrix ranges ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semidefinite representation of convex sets
• On the complexity of Putinar's Positivstellensatz
• On semidefinite representations of non-closed sets
• The \(K\)-moment problem for compact semi-algebraic sets
• Convex sets with semidefinite representation
• Matrix sum-of-squares relaxations for robust semi-definite programs
• Global Optimization with Polynomials and the Problem of Moments
• WHAT IS...a Spectrahedron?
• Exposed Faces of Semidefinitely Representable Sets
• On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
• Positive Polynomials and Projections of Spectrahedra
• A Note on Convexity in Euclidean n-Space
• Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
• Optimization—Theory and Practice
• Linear Matrix Inequalities in System and Control Theory
• Semidefinite Representation for Convex Hulls of Real Algebraic Curves
• Spectrahedral Shadows
• A new proof for the existence of degree bounds for Putinar’s Positivstellensatz
• OPTIMAL SMOOTHING FOR CONVEX POLYTOPES

This page was built for publication: On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets