A semismooth Newton method for the nearest Euclidean distance matrix problem
From MaRDI portal
(Redirected from Publication:5300546)
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
Cited in
(26)- 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
- Complementarity problems with respect to Loewnerian cones
- Geometric Characterization of Maximum Diversification Return Portfolio via Rao’s Quadratic Entropy
- A convex matrix optimization for the additive constant problem in multidimensional scaling with application to locally linear embedding
- A Euclidean distance matrix model for convex clustering
- Variational analysis of norm cones in finite dimensional Euclidean spaces
- Regularized multidimensional scaling with radial basis functions
- Well-posedness and efficient algorithms for inverse optimal transport with Bregman regularization
- An efficient augmented Lagrangian method for support vector machine
- Discriminant analysis of regularized multidimensional scaling
- A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
- A facial reduction approach for the single source localization problem
- 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
- Conditional quadratic semidefinite programming: examples and methods
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- 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)
