A Gradient System for Low Rank Matrix Completion
In this article we present and discuss a two step methodology to find the closest low rank completion of a sparse large matrix. Given a large sparse matrix M, the method consists of fixing the rank to r and then looking for the closest rank-r matrix X to M, where the distance is measured in the Frob...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-07-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2075-1680/7/3/51 |