An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
From MaRDI portal
Publication:3352373
DOI10.1137/0611042zbMath0728.65034OpenAlexW2000389722MaRDI 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 matricesnormal conesleast squares problemsmultidimensional scalingalternating projection algorithmmatrix conessmallest perturbation
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Related Items (32)
Structured low rank approximation ⋮ Unnamed Item ⋮ Decomposition Methods for Sparse Matrix Nearness Problems ⋮ The cone of distance matrices ⋮ An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data ⋮ A molecular structure matching problem ⋮ DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS ⋮ Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation ⋮ Model-based distance embedding with applications to chromosomal conformation biology ⋮ Dykstra's algorithm for constrained least-squares rectangular matrix problems ⋮ Hyperbolic smoothing and penalty techniques applied to molecular structure determination ⋮ Solving a generalized distance geometry problem for protein structure determination ⋮ Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications ⋮ Least-squares approximations in geometric buildup for solving distance geometry problems ⋮ Rank reduction of correlation matrices by majorization ⋮ Dykstras algorithm with bregman projections: A convergence proof ⋮ Robust Euclidean embedding via EDM optimization ⋮ The embedding problem for predistance matrices ⋮ A constrained matrix least-squares problem in structural dynamics model updating ⋮ Conditional quadratic semidefinite programming: examples and methods ⋮ Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ? ⋮ The discretizable molecular distance geometry problem ⋮ An acceleration scheme for Dykstra's algorithm ⋮ Euclidean Distance Matrices and Applications ⋮ Regularized multidimensional scaling with radial basis functions ⋮ Molecular distance geometry methods: from continuous to discrete ⋮ Discriminant analysis of regularized multidimensional scaling ⋮ A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation ⋮ Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach ⋮ Complementarity problems with respect to Loewnerian cones ⋮ An optimization problem on subsets of the symmetric positive-semidefinite matrices ⋮ Structure method for solving the nearest Euclidean distance matrix problem
This page was built for publication: An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
