An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
From MaRDI portal
Publication:5169680
DOI10.1287/moor.1120.0584zbMath1309.13031arXiv1207.1691MaRDI QIDQ5169680
Markus Schweighofer, Igor Klep
Publication date: 11 July 2014
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.1691
semidefinite programming; linear matrix inequality; duality theory; LMI; infeasibility; Farkas' lemma; SDP; spectrahedron; quadratic module; real radical
90C22: Semidefinite programming
15A39: Linear inequalities of matrices
15B48: Positive matrices and their generalizations; cones of matrices
14P10: Semialgebraic sets and related spaces
15A22: Matrix pencils
13J30: Real algebra
Related Items
Some Recent Developments in Spectrahedral Computation, Solving SDP completely with an interior point oracle, Simultaneous Diagonalization via Congruence of Hermitian Matrices: Some Equivalent Conditions and a Numerical Solution, Constraint Satisfaction Problems over Numeric Domains, A Matrix Positivstellensatz with Lifting Polynomials, Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs, A Semidefinite Hierarchy for Containment of Spectrahedra, Exact Duality in Semidefinite Programming Based on Elementary Reformulations, A practical approach to SOS relaxations for detecting quantum entanglement, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets, A real nullstellensatz for free modules, Weak infeasibility in second order cone programming, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, Conic programming: infeasibility certificates and projective geometry, Bad projections of the PSD cone, Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction, New examples of extremal positive linear maps, Irreducible infeasible subsystems of semidefinite systems, Noncommutative polynomials nonnegative on a variety intersect a convex set, The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra, A simplified treatment of Ramana's exact dual for semidefinite programming, Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming, Exact Algorithms for Linear Matrix Inequalities, Bad Semidefinite Programs: They All Look the Same
