Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-Rank Matrix Completion

DOI10.1109/TIT.2018.2881749zbMath1432.90117arXiv1804.04310OpenAlexW2963286770WikidataQ128913755 ScholiaQ128913755MaRDI QIDQ5223989

Abiy Tasissa, Rongjie Lai

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.04310

Mathematics Subject Classification ID

Convex programming (90C25) Matrix completion problems (15A83)

Related Items

Phase retrieval of complex and vector-valued functions ⋮ Central limit theorems for classical multidimensional scaling ⋮ On density extrema for digital discs ⋮ A dual basis approach to multidimensional scaling ⋮ Low-rank matrix completion in a general non-orthogonal basis ⋮ Low-rank factorization for rank minimization with nonconvex regularizers