Low-rank matrix completion for the Euclidean distance geometry problem and beyond

Applied and Computational Mathematics Seminar
Monday, February 18, 2019 - 1:55pm for 1 hour (actually 50 minutes)
Skiles 005
Rongjie Lai – Rensselaer Polytechnic Institute – lair@rpi.eduhttp://homepages.rpi.edu/~lair/
Wenjing Liao
Abstract: The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor networks. Instead of directly reconstruct the incomplete distance matrix, we consider a low-rank matrix completion method to reconstruct the associated Gram matrix with respect to a suitable basis. Computationally, simple and fast algorithms are designed to solve the proposed problem. Theoretically, the well known restricted isometry property (RIP) can not be satisfied in the scenario. Instead, a dual basis approach is considered to theoretically analyze the reconstruction problem. Furthermore, by introducing a new condition on the basis called the correlation condition, our theoretical analysis can be also extended to a more general setting to handle low-rank matrix completion problems under any given non-orthogonal basis. This new condition is polynomial time checkable and holds for many cases of deterministic basis where RIP might not hold or is NP-hard to verify. If time permits, I will also discuss a combination of low-rank matrix completion with geometric PDEs on point clouds to understanding manifold-structured data represented as incomplete inter-point distance data. This talk is based on:1. A. Tasissa, R. Lai, “Low-rank Matrix Completion in a General Non-orthogonal Basis”, arXiv:1812.05786 2018. 2. A. Tasissa, R. Lai, “Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion”, accepted, IEEE. Transaction on Information Theory, 2018. 3. R. Lai, J. Li, “Solving Partial Differential Equations on Manifolds From Incomplete Inter-Point Distance”, SIAM Journal on Scientific Computing, 39(5), pp. 2231-2256, 2017.