skip to main content


Title: A Note on Alternating Minimization Algorithm for the Matrix Completion Problem

Here, we consider the problem of reconstructing a low-rank matrix from a subset of its entries and analyze two variants of the so-called alternating minimization algorithm, which has been proposed in the past.We establish that when the underlying matrix has rank one, has positive bounded entries, and the graph underlying the revealed entries has diameter which is logarithmic in the size of the matrix, both algorithms succeed in reconstructing the matrix approximately in polynomial time starting from an arbitrary initialization.We further provide simulation results which suggest that the second variant which is based on the message passing type updates performs significantly better.
 [1] ; ORCiD logo [2]
  1. Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)
  2. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Publication Date:
Report Number(s):
Journal ID: ISSN 1070-9908; TRN: US1702183
Grant/Contract Number:
AC52-06NA25396; CMMI-1335155
Accepted Manuscript
Journal Name:
IEEE Signal Processing Letters
Additional Journal Information:
Journal Volume: 23; Journal Issue: 10; Journal ID: ISSN 1070-9908
IEEE Signal Processing Society
Research Org:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org:
USDOE Laboratory Directed Research and Development (LDRD) Program; National Science Foundation of China
Country of Publication:
United States
97 MATHEMATICS AND COMPUTING; Mathematics; Alternating minimization; compressive sensing; low-rank matrix completion
OSTI Identifier: