Exact Duality in Semidefinite Programming Based on Elementary Reformulations
From MaRDI portal
Publication:5501234
DOI10.1137/140972354zbMath1317.90320arXiv1406.7274OpenAlexW2111625598MaRDI QIDQ5501234
Publication date: 3 August 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.7274
semidefinite programmingdualitystrong dualityspectrahedraelementary reformulationsinfeasibility certificates
Optimality conditions and duality in mathematical programming (90C46) Inequalities and extremum problems involving convexity in convex geometry (52A40) Duality theory (optimization) (49N15)
Related Items
A strengthened Barvinok-Pataki bound on SDP rank, Irreducible infeasible subsystems of semidefinite systems, How Do Exponential Size Solutions Arise in Semidefinite Programming?, Bad Semidefinite Programs: They All Look the Same, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, Unnamed Item, Weak infeasibility in second order cone programming, Singularity Degree of the Positive Semidefinite Matrix Completion Problem, Bad projections of the PSD cone, Facially Dual Complete (Nice) Cones and Lexicographic Tangents, Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs, Solving SDP completely with an interior point oracle
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- On Farkas lemma and dimensional rigidity of bar frameworks
- New stopping criteria for detecting infeasibility in conic optimization
- Regularizing the abstract convex program
- An exact duality theory for semidefinite programming and its complexity implications
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- On the connection of facially exposed and nice cones
- Invariance and efficiency of convex representations
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Lectures on Modern Convex Optimization
- WHAT IS...a Spectrahedron?
- Semidefinite Characterization of Sum-of-Squares Cones in Algebras
- Bad Semidefinite Programs: They All Look the Same
- Exposed Faces of Semidefinitely Representable Sets
- Semidefinite optimization
- Strong Duality for Semidefinite Programming
- Semidefinite Optimization and Convex Algebraic Geometry
- Facially Exposed Cones Are Not Always Nice
- An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
- Generic Spectrahedral Shadows
- Foundations of Optimization
- A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS
- Convex Analysis
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
- Handbook of semidefinite programming. Theory, algorithms, and applications
