Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming

DOI10.1016/j.laa.2005.03.021zbMath1081.15011OpenAlexW2075893026WikidataQ114851471 ScholiaQ114851471MaRDI QIDQ2566758

Henry Wolkowicz, Suliman Al-Homidan

Publication date: 28 September 2005

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2005.03.021

zbMATH Keywords

semidefinite programminglarge sparse problemsEuclidean distance matrixcompletion problemnearest matrix approximation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

Structure methods for solving the nearest correlation matrix problem, Decomposition Methods for Sparse Matrix Nearness Problems, A least-squares approach for discretizable distance geometry problems with inexact distances, Sensor network localization, Euclidean distance matrix completions, and graph realization, Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier, Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications, Euclidean distance matrices, semidefinite programming and sensor network localization, Euclidean Distance Matrices and Applications, Global convergence of the alternating projection method for the Max-Cut relaxation problem, Coordinate Shadows of Semidefinite and Euclidean Distance Matrices, Complementarity problems with respect to Loewnerian cones, Structure method for solving the nearest Euclidean distance matrix problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of Euclidean and non-Euclidean distance matrices
• On certain linear mappings between inner-product and squared-distance matrices
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• A connection between positive semidefinite and Euclidean distance matrix completion problems
• Connections between the real positive semidefinite and distance matrix completion problems
• Monotonie und Randspektrum bei vollstetigen Operatoren
• The cone of distance matrices
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• Multidimensional scaling. I: Theory and method
• Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
• Sizing and Least-Change Secant Methods
• The Gauss-Newton direction in semidefinite programming
• Solving semidefinite programs using preconditioned conjugate gradients
• Spectral Properties of Matrices which have Invariant Cones
• Handbook of semidefinite programming. Theory, algorithms, and applications