Low rank matrix completion by alternating steepest descent methods
Matrix completion involves recovering a matrix from a subset of its entries by utilizing interdependency between the entries, typically through low rank structure. Despite matrix completion requiring the global solution of a non-convex objective, there are many computationally efficient algorithms w...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
2015
|