Greedy Approach for Low-Rank Matrix Recovery
From MaRDI portal
Abstract: 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.
This page was built for publication: Greedy Approach for Low-Rank Matrix Recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6241154)
