On the uniqueness of Euclidean distance matrix completions: the case of points in general position
DOI10.1016/j.laa.2004.10.025zbMath1072.15019OpenAlexW2087832775MaRDI QIDQ1774976
Publication date: 4 May 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.2004.10.025
semidefinite programmingGale transformEuclidean distance matrixmatrix completion problemspoints in general positionsymmetric partial matrix
Semidefinite programming (90C22) Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48) General theory of distance geometry (51K05) Gale and other diagrams (52B35)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- 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
- On the uniqueness of Euclidean distance matrix completions.
- Distance matrix completion by numerical optimization
- Distance geometry optimization for protein structures
- 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
- Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
- The Euclidian Distance Matrix Completion Problem
- The Euclidean distance completion problem: cycle completability
- The Molecule Problem: Exploiting Structure in Global Optimization
- Convex Analysis
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: On the uniqueness of Euclidean distance matrix completions: the case of points in general position
