A Geometric Approach to Low-Rank Matrix Completion


The low-rank matrix completion problem can be succinctly stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. While several low-complexity algorithms for matrix completion have been proposed so far, it remains an open problem to devise -type search procedures with provable performance… (More)
DOI: 10.1109/TIT.2011.2171521

1 Figure or Table



Citations per Year

Citation Velocity: 6

Averaging 6 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics