An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares

DOI10.1287/moor.1120.0584zbMath1309.13031arXiv1207.1691OpenAlexW3102900599MaRDI 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

zbMATH Keywords

semidefinite programminglinear matrix inequalityduality theoryLMIinfeasibilityFarkas' lemmaSDPspectrahedronquadratic modulereal radical

Mathematics Subject Classification ID

Semidefinite programming (90C22) Linear inequalities of matrices (15A39) Positive matrices and their generalizations; cones of matrices (15B48) Semialgebraic sets and related spaces (14P10) Matrix pencils (15A22) Real algebra (13J30)

Related Items (25)

The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra ⋮ Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets ⋮ Some Recent Developments in Spectrahedral Computation ⋮ New examples of extremal positive linear maps ⋮ Simultaneous Diagonalization via Congruence of Hermitian Matrices: Some Equivalent Conditions and a Numerical Solution ⋮ A practical approach to SOS relaxations for detecting quantum entanglement ⋮ Irreducible infeasible subsystems of semidefinite systems ⋮ A real nullstellensatz for free modules ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ A simplified treatment of Ramana's exact dual for semidefinite programming ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ Weak infeasibility in second order cone programming ⋮ Conic programming: infeasibility certificates and projective geometry ⋮ Noncommutative polynomials nonnegative on a variety intersect a convex set ⋮ A Matrix Positivstellensatz with Lifting Polynomials ⋮ Bad projections of the PSD cone ⋮ Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction ⋮ Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming ⋮ Exact Algorithms for Linear Matrix Inequalities ⋮ Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs ⋮ Solving SDP completely with an interior point oracle ⋮ Exact Duality in Semidefinite Programming Based on Elementary Reformulations ⋮ A Semidefinite Hierarchy for Containment of Spectrahedra

This page was built for publication: An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares