most citedLow-rank optimization methods based on projected projected-gradient descent that accumulate at Bouligand stationary points

3 citations · 3 across the 4 of their papers we have counts for

collaborators
Showing cs.LGShow all

1 paper · 1 filter

cs.LG2026

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 us…