Coordinate Shadows of Semidefinite and Euclidean Distance Matrices

DOI10.1137/140968318zbMath1320.90054arXiv1405.2037OpenAlexW624923763MaRDI QIDQ5258947

Henry Wolkowicz, Gábor Pataki, Dmitriy Drusvyatskiy

Publication date: 24 June 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.2037

zbMATH Keywords

semidefinite programmingmatrix completionprojectionEuclidean distance matricesSlater conditionclosednessfacial reduction

Mathematics Subject Classification ID

Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) General convexity (52A99)

Related Items (17)

On Flattenability of Graphs ⋮ Decomposition Methods for Sparse Matrix Nearness Problems ⋮ Facial Reduction and Partial Polyhedrality ⋮ Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier ⋮ A facial reduction approach for the single source localization problem ⋮ Prestress Stability of Triangulated Convex Polytopes and Universal Second-Order Rigidity ⋮ Characterizing the universal rigidity of generic tensegrities ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ Robust principal component analysis using facial reduction ⋮ Amenable cones: error bounds without constraint qualifications ⋮ Level-set methods for convex optimization ⋮ Low-rank matrix completion using nuclear norm minimization and facial reduction ⋮ Singularity Degree of the Positive Semidefinite Matrix Completion Problem ⋮ Noisy Euclidean distance matrix completion with a single missing node ⋮ Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs ⋮ Facially Dual Complete (Nice) Cones and Lexicographic Tangents

Uses Software

• frlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
• Facial reduction algorithms for conic optimization problems
• Polyhedral and semidefinite programming methods in combinatorial optimization
• Majorization for the eigenvalues of Euclidean distance matrices
• Positive definite completions of partial Hermitian matrices
• Semidefinite representation of convex sets
• Multispherical Euclidean distance matrices
• Regularizing the abstract convex program
• A connection between positive semidefinite and Euclidean distance matrix completion problems
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
• Circum-Euclidean distance matrices and faces
• Block matrices and multispherical structure of distance matrices
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry
• The cone of distance matrices
• Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
• Bad Semidefinite Programs: They All Look the Same
• Euclidean distance matrices: new characterization and boundary properties
• Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
• Error Bounds for Linear Matrix Inequalities
• Closedness criteria for the image of a closed set by a inear operator
• The Euclidian Distance Matrix Completion Problem
• Lifts of Convex Sets and Cone Factorizations
• On the Closedness of the Linear Image of a Closed Convex Cone
• Convex Analysis
• Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals

This page was built for publication: Coordinate Shadows of Semidefinite and Euclidean Distance Matrices