A simplified treatment of Ramana's exact dual for semidefinite programming
From MaRDI portal
Publication:2688906
DOI10.1007/s11590-022-01898-2OpenAlexW4307349031MaRDI QIDQ2688906
Gábor Pataki, Bruno F. Lourenço
Publication date: 6 March 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.13596
Optimality conditions and duality in mathematical programming (90C46) Inequalities and extremum problems involving convexity in convex geometry (52A40) Duality theory (optimization) (49N15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- Regularizing the abstract convex program
- An exact duality theory for semidefinite programming and its complexity implications
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Lectures on Modern Convex Optimization
- Bad Semidefinite Programs: They All Look the Same
- Strong Duality for Semidefinite Programming
- SOS Is Not Obviously Automatizable, Even Approximately
- Semidefinite Programming
- An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
- Graphs and Geometry
- Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs
- A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS
- Convex Analysis
