A relaxed-certificate facial reduction algorithm based on subspace intersection

DOI10.1016/j.orl.2016.08.004zbMath1408.90172OpenAlexW2519774166MaRDI QIDQ1709938

Henrik A. Friberg

Publication date: 15 January 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.08.004

zbMATH Keywords

conic optimizationsecond-order conessubspace intersectionfacial reduction

Mathematics Subject Classification ID

Semidefinite programming (90C22) Linear programming (90C05)

Related Items (5)

Facial Reduction and Partial Polyhedrality ⋮ A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms ⋮ Amenable cones: error bounds without constraint qualifications ⋮ Formulas for calculating the dimensions of the sums and the intersections of a family of linear subspaces with applications ⋮ Solving SDP completely with an interior point oracle

Cites Work

• Unnamed Item
• Facial reduction algorithms for conic optimization problems
• Second-order cone programming
• Matrix Analysis
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Preprocessing and Regularization for Degenerate Semidefinite Programs
• Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: A relaxed-certificate facial reduction algorithm based on subspace intersection