Universal duality in conic convex optimization

DOI10.1007/s10107-005-0690-4zbMath1167.90023OpenAlexW2155425983MaRDI QIDQ868444

Simon P. Schurr, Dianne P. O'Leary, André L. Tits

Publication date: 5 March 2007

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1903/6431

zbMATH Keywords

duality gapconstraint qualificationconic convex programming

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs, Bad Semidefinite Programs: They All Look the Same

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complementarity and nondegeneracy in semidefinite programming
• Riemannian geometry of Grassmann manifolds with a view on algorithmic computation
• Cones, matrices and mathematical programming
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Semidefinite optimization
• Clark's Theorem on linear programs holds for convex programs
• The Geometry of Algorithms with Orthogonality Constraints
• Conic convex programming and self-dual embedding
• Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
• Convex Analysis
• On the generic properties of convex optimization problems in conic form