An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1329054
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- Structure method for solving the nearest Euclidean distance matrix problem
- Realizing Euclidean distance matrices by sphere intersection
- scientific article; zbMATH DE number 4115838
Cited in
(39)- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- Dykstra's algorithm for constrained least-squares rectangular matrix problems
- The embedding problem for predistance matrices
- An algorithm for the computation of the Hutchinson distance
- A genetic algorithm for circulant Euclidean distance matrices
- An optimization problem on subsets of the symmetric positive-semidefinite matrices
- A molecular structure matching problem
- Selective alternating projections to find the nearest SDD\(^{+}\) matrix
- Structured low rank approximation
- Discriminant analysis of regularized multidimensional scaling
- Model-based distance embedding with applications to chromosomal conformation biology
- Robust Euclidean embedding via EDM optimization
- Complementarity problems with respect to Loewnerian cones
- Euclidean distances and least squares problems for a given set of vectors
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
- Structure method for solving the nearest Euclidean distance matrix problem
- The cone of distance matrices
- Dykstras algorithm with bregman projections: A convergence proof
- Computing the nearest diagonally dominant matrix
- Euclidean distance matrices and applications
- Douglas-Rachford feasibility methods for matrix completion problems
- Molecular distance geometry methods: from continuous to discrete
- An algorithm for realizing Euclidean distance matrices
- Decomposition methods for sparse matrix nearness problems
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- Solving a generalized distance geometry problem for protein structure determination
- scientific article; zbMATH DE number 1329054 (Why is no real title available?)
- Rank reduction of correlation matrices by majorization
- A constrained matrix least-squares problem in structural dynamics model updating
- Conditional quadratic semidefinite programming: examples and methods
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
- An acceleration scheme for Dykstra's algorithm
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications
- Least-squares approximations in geometric buildup for solving distance geometry problems
- The discretizable molecular distance geometry problem
- Regularized multidimensional scaling with radial basis functions
This page was built for publication: An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3352373)
