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 completionEuclidean distance geometryEuclidean distance matrix completion

Mathematics Subject Classification ID

Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48) Euclidean analytic geometry (51N20)

Related Items (10)

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

This page was built for publication: Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems