Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
From MaRDI portal
Publication:4588863
DOI10.1137/15M103710XzbMath1373.90096arXiv1410.6852OpenAlexW2279366020MaRDI QIDQ4588863
Yuen-Lam Voronin, Henry Wolkowicz, Nathan Krislock, Dmitriy Drusvyatskiy
Publication date: 3 November 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.6852
convex optimizationsemidefinite programmingEuclidean distance matricesFrank-Wolfe algorithmfacial reductionsensor network localization
Related Items
A least-squares approach for discretizable distance geometry problems with inexact distances, Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications, Robust principal component analysis using facial reduction, Robust Euclidean embedding via EDM optimization, Level-set methods for convex optimization, Low-rank matrix completion using nuclear norm minimization and facial reduction, Noisy Euclidean distance matrix completion with a single missing node, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Localization from incomplete noisy distance measurements
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Majorization for the eigenvalues of Euclidean distance matrices
- Sum of squares method for sensor network localization
- Theory of semidefinite programming for sensor network localization
- Equality relating Euclidean distance cone to positive semidefinite cone
- Multispherical Euclidean distance matrices
- Cuts, matrix completions and graph rigidity
- Level-set methods for convex optimization
- Circum-Euclidean distance matrices and faces
- Graph rigidity via Euclidean distance matrices
- Iterative universal rigidity
- The rotation of eigenvectors by a perturbation. II
- 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
- Variational Properties of Value Functions
- Randomized Sketches of Convex Programs With Sharp Guarantees
- Algorithm 920
- A remark on global positioning from local distances
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- Sparse Optimization with Least-Squares Constraints
- Euclidean distance matrices: new characterization and boundary properties
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Characterizing generic global rigidity
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
- Euclidean Distance Geometry and Applications
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Some new bounds on perturbation of subspaces
- The Rotation of Eigenvectors by a Perturbation. III
