Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
arXiv:2508.00091v3 Announce Type: replace-cross
Abstract: The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of a…