Computing the nearest Euclidean distance matrix with low embedding dimensions
DOI10.1007/S10107-013-0726-0zbMATH Open1304.49051OpenAlexW2007304358MaRDI QIDQ463737FDOQ463737
Authors: Houduo Qi, Xiaoming Yuan 
Publication date: 17 October 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/361847/1/EDM_Embedding_Final.pdf
Recommendations
- A semismooth Newton method for the nearest Euclidean distance matrix problem
- Euclidean distance matrices and applications
- Structure method for solving the nearest Euclidean distance matrix problem
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
low-rank approximationEuclidean distance matrixLagrangian dualitymajorization methodsemismooth Newton-CG method
Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Newton-type methods (49M15)
Cites Work
- Explicit sensor network localization using semidefinite representations and facial reductions
- An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
- Title not available (Why is that?)
- Properties of Euclidean and non-Euclidean distance matrices
- Connections between the real positive semidefinite and distance matrix completion problems
- A successive projection method
- Solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
- Approximation by matrices positive semidefinite on a subspace
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Recent advances on the discretizable molecular distance geometry problem
- Euclidean distance matrices and applications
Cited In (31)
- A semismooth Newton method for the nearest Euclidean distance matrix problem
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Structure method for solving the nearest Euclidean distance matrix problem
- An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling
- Bypassing the embedding
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications
- Distance shrinkage and Euclidean embedding via regularized kernel estimation
- Noisy Euclidean distance matrix completion with a single missing node
- A convex matrix optimization for the additive constant problem in multidimensional scaling with application to locally linear embedding
- On optimality conditions for nonlinear conic programming
- An inexact smoothing Newton method for Euclidean distance matrix optimization under ordinal constraints
- Quartic first-order methods for low-rank minimization
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
- The analytic solutions of a class of constrained matrix minimization and maximization problems with applications
- Regularized multidimensional scaling with radial basis functions
- Matrix optimization based Euclidean embedding with outliers
- An efficient augmented Lagrangian method for support vector machine
- A facial reduction approach for the single source localization problem
- Title not available (Why is that?)
- Discriminant analysis of regularized multidimensional scaling
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
- Model-based distance embedding with applications to chromosomal conformation biology
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
- Regularity properties of non-negative sparsity sets
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- A Euclidean distance matrix model for protein molecular conformation
- Euclidean distance matrices and applications
- Ordinal distance metric learning with MDS for image ranking
- Robust Euclidean embedding via EDM optimization
Uses Software
This page was built for publication: Computing the nearest Euclidean distance matrix with low embedding dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463737)
