Pages that link to "Item:Q5258947"
From MaRDI portal
The following pages link to Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947):
Displaying 17 items.
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
- Level-set methods for convex optimization (Q1739042) (← links)
- Low-rank matrix completion using nuclear norm minimization and facial reduction (Q1756746) (← links)
- Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
- Robust principal component analysis using facial reduction (Q2218887) (← links)
- Amenable cones: error bounds without constraint qualifications (Q2227528) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- Characterizing the universal rigidity of generic tensegrities (Q2689816) (← links)
- Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
- On Flattenability of Graphs (Q3452282) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- Facial Reduction and Partial Polyhedrality (Q4586172) (← links)
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
- Prestress Stability of Triangulated Convex Polytopes and Universal Second-Order Rigidity (Q4599766) (← links)
- Facially Dual Complete (Nice) Cones and Lexicographic Tangents (Q5234283) (← links)
- Singularity Degree of the Positive Semidefinite Matrix Completion Problem (Q5737737) (← links)
- A facial reduction approach for the single source localization problem (Q6064050) (← links)
