A Note on Alternating Minimization Algorithm for the Matrix Completion Problem
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...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2017-05-16T14:04:50Z.
|
| Subjects: | |
| Online Access: | Get fulltext |