Chandler Smith

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness

A Riemannian optimization framework for solving the EDMC problem by formulating it as a low-rank matrix completion task over the space of positive semi-definite Gram matrices, which provides a geometric interpretation of matrix incoherence tailored to the EDMC setting and provides robustness guarantees for the method.