Benoît Loucheur

Graph-Regularized Low-Rank Matrix Completion by Variable Projection

Benoît Loucheur, P. -A. Absil, Michel Journée

We address the low-rank matrix completion problem by incorporating graph regularization into the existing Riemannian Trust-Region Matrix Completion (RTRMC) framework. The latter uses the geometry of the low-rank constraint to remodel the problem as an unconstrained optimization p…Read more