Cited in
(10)- Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction
- Facially dual complete (nice) cones and lexicographic tangents
- Amenable cones: error bounds without constraint qualifications
- Numerical algebraic geometry and semidefinite programming
- SPECTRA
- ADMM_QAP
- frlib
- Characterizing bad semidefinite programs: normal forms and short proofs
- A strengthened Barvinok-Pataki bound on SDP rank
- Solving SDP completely with an interior point oracle
This page was built for software: Sieve-SDP