Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems

DOI10.1023/A:1021336413386zbMath1037.15015MaRDI QIDQ1810881

Zhi-An Liang, Panos M. Pardalos, Hong-Xuan Huang

Publication date: 9 June 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

positive semidefinite matrix completion; Euclidean distance geometry; Euclidean distance matrix completion

Mathematics Subject Classification ID

15A29: Inverse problems in linear algebra

15B48: Positive matrices and their generalizations; cones of matrices

51N20: Euclidean analytic geometry

Related Items

Least-squares approximations in geometric buildup for solving distance geometry problems, Discretization orders for distance geometry problems, The discretizable molecular distance geometry problem, Rigid versus unique determination of protein structures with geometric buildup, A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation, Recent advances on the interval distance geometry problem, The discretizable distance geometry problem, Phase retrieval of complex and vector-valued functions, A Euclidean distance matrix model for protein molecular conformation, Approximating the problem, not the solution: an alternative view of point set matching