A relaxed-certificate facial reduction algorithm based on subspace intersection
From MaRDI portal
Recommendations
- Facial reduction algorithms for conic optimization problems
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- Facial reduction and partial polyhedrality
- A facial reduction algorithm for finding sparse SOS representations
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
Cites work
- Facial reduction algorithms for conic optimization problems
- Handbook of semidefinite programming. Theory, algorithms, and applications
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Matrix Analysis
- Preprocessing and regularization for degenerate semidefinite programs
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Second-order cone programming
- Strong duality in conic linear programming: facial reduction and extended duals
Cited in
(6)- 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
- Facial reduction algorithms for conic optimization problems
- Facial reduction and partial polyhedrality
- Solving SDP completely with an interior point oracle
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
This page was built for publication: A relaxed-certificate facial reduction algorithm based on subspace intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709938)
