arXiv:1304.4162 Abstract | arXiv Analytics

arXiv:1304.4162 [math.NA]Abstract References Reviews Resources

Greedy Approach for Low-Rank Matrix Recovery

Published 2013-04-15Version 1

We describe the Simple Greedy Matrix Completion Algorithm providing an efficient method for restoration of low-rank matrices from incomplete corrupted entries. We provide numerical evidences that, even in the simplest implementation, the greedy approach may increase the recovery capability of existing algorithms significantly.

Categories: math.NA, cs.IT, cs.NA, math.IT

Subjects: 65F30

Keywords: low-rank matrix recovery, greedy approach, simple greedy matrix completion algorithm, recovery capability, incomplete corrupted entries

Related articles: Most relevant | Search more

arXiv:2103.00531 [math.NA] (Published 2021-02-28)

Sensitivity of low-rank matrix recovery

Paul Breiding, Nick Vannieuwenhoven

arXiv:1010.2471 [math.NA] (Published 2010-10-12, updated 2011-07-15)

Low-rank matrix recovery via iteratively reweighted least squares minimization

Massimo Fornasier, Holger Rauhut, Rachel Ward

arXiv:1703.05038 [math.NA] (Published 2017-03-15)

Harmonic Mean Iteratively Reweighted Least Squares for Low-Rank Matrix Recovery