Pages that link to "Item:Q2967605"
From MaRDI portal
The following pages link to Bad Semidefinite Programs: They All Look the Same (Q2967605):
Displayed 17 items.
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)
- Bad projections of the PSD cone (Q2044155) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- A complementarity partition theorem for multifold conic systems (Q2434990) (← links)
- A simplified treatment of Ramana's exact dual for semidefinite programming (Q2688906) (← links)
- A note on strict complementarity for the doubly non-negative cone (Q4634159) (← links)
- Solving SDP completely with an interior point oracle (Q4999336) (← links)
- (Q5030927) (← links)
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization (Q5233101) (← links)
- Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs (Q5243181) (← links)
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947) (← links)
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations (Q5501234) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms (Q6041108) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)