A Matrix Positivstellensatz with Lifting Polynomials
From MaRDI portal
Publication:5210520
DOI10.1137/18M1203183zbMath1504.14097arXiv1801.04947OpenAlexW3103237592WikidataQ126343347 ScholiaQ126343347MaRDI QIDQ5210520
Publication date: 21 January 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.04947
Semidefinite programming (90C22) Semialgebraic sets and related spaces (14P10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Real algebra (13J30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variant quantifier elimination
- The convex Positivstellensatz in a free algebra
- Convex hulls of curves of genus one
- Semidefinite representation of convex sets
- Positive polynomials and semidefinite programming
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Solving moment problems by dimensional extension
- On the complexity of some basic problems in computational convexity. I. Containment problems
- First and second order analysis of nonlinear semidefinite programs
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Real algebraic geometry for matrices over commutative rings
- Positive polynomials in control.
- The matricial relaxation of a linear matrix inequality
- Convex sets with semidefinite representation
- Matrix sum-of-squares relaxations for robust semi-definite programs
- The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
- Global Optimization with Polynomials and the Problem of Moments
- On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
- Exact Algorithms for Linear Matrix Inequalities
- Containment Problems for Polytopes and Spectrahedra
- Polynomial Matrix Inequality and Semidefinite Representation
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Chapter 7: Spectrahedral Approximations of Convex Hulls of Algebraic Sets
- Exposed Faces of Semidefinitely Representable Sets
- Pure states, positive matrix polynomials and sums of hermitian squares
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
- Positive Polynomials and Projections of Spectrahedra
- Linear matrix inequality representation of sets
- Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
- Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
- Non-commutative Real Algebraic Geometry - Some Basic Concepts and First Ideas
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- On the complexity of four polyhedral set containment problems
- Determinant Maximization with Linear Matrix Inequality Constraints
- Spectrahedral Shadows
- Semidefinite Optimization and Convex Algebraic Geometry
- Lifts of Convex Sets and Cone Factorizations
- An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
- A Semidefinite Hierarchy for Containment of Spectrahedra
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Optimization of Polynomials on Compact Semialgebraic Sets
- Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization
- Algorithms in real algebraic geometry
- Handbook of semidefinite programming. Theory, algorithms, and applications
