An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
From MaRDI portal
Publication:3352373
DOI10.1137/0611042zbMath0728.65034MaRDI QIDQ3352373
No author found.
Publication date: 1990
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0611042
Euclidean distance matrices; normal cones; least squares problems; multidimensional scaling; alternating projection algorithm; matrix cones; smallest perturbation
65F20: Numerical solutions to overdetermined systems, pseudoinverses
65F35: Numerical computation of matrix norms, conditioning, scaling
15A12: Conditioning of matrices
Related Items
Rank reduction of correlation matrices by majorization, 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 ?, An acceleration scheme for Dykstra's algorithm, Structure method for solving the nearest Euclidean distance matrix problem, Hyperbolic smoothing and penalty techniques applied to molecular structure determination, Solving a generalized distance geometry problem for protein structure determination, A constrained matrix least-squares problem in structural dynamics model updating, Conditional quadratic semidefinite programming: examples and methods, Least-squares approximations in geometric buildup for solving distance geometry problems, The discretizable molecular distance geometry problem, Regularized multidimensional scaling with radial basis functions, 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 optimization problem on subsets of the symmetric positive-semidefinite matrices, A molecular structure matching problem, 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, 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, Unnamed Item, The cone of distance matrices, Dykstras algorithm with bregman projections: A convergence proof, Euclidean Distance Matrices and Applications, DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS, Molecular distance geometry methods: from continuous to discrete, Decomposition Methods for Sparse Matrix Nearness Problems
