A semismooth Newton method for the nearest Euclidean distance matrix problem
DOI10.1137/110849523zbMATH Open1266.49052OpenAlexW1990908167MaRDI QIDQ5300546FDOQ5300546
Authors: Houduo Qi 
Publication date: 27 June 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/347784/1/084952RRRR.pdf
Recommendations
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Robust Euclidean embedding via EDM optimization
- Structure method for solving the nearest Euclidean distance matrix problem
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Newton-type methods (49M15)
Cited In (24)
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Decomposition methods for sparse matrix nearness problems
- An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications
- Noisy Euclidean distance matrix completion with a single missing node
- Geometric Characterization of Maximum Diversification Return Portfolio via Rao’s Quadratic Entropy
- Complementarity problems with respect to Loewnerian cones
- A convex matrix optimization for the additive constant problem in multidimensional scaling with application to locally linear embedding
- Variational analysis of norm cones in finite dimensional Euclidean spaces
- Regularized multidimensional scaling with radial basis functions
- An efficient augmented Lagrangian method for support vector machine
- A facial reduction approach for the single source localization problem
- Discriminant analysis of regularized multidimensional scaling
- A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
- Model-based distance embedding with applications to chromosomal conformation biology
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- Conditional quadratic semidefinite programming: examples and methods
- The vector-valued functions associated with circular cones
- A Euclidean distance matrix model for protein molecular conformation
- Ordinal distance metric learning with MDS for image ranking
- A semismooth Newton method for support vector classification and regression
- Robust Euclidean embedding via EDM optimization
This page was built for publication: A semismooth Newton method for the nearest Euclidean distance matrix problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300546)
