Low-rank matrix completion by Riemannian optimization---extended version

Bart Vandereycken

The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that mi…