Near-Optimal Nonconvex Matrix Completion
Riemannian gradient descent (RGD) and Riemannian Gauss--Newton (RGN) methods are analyzed, finding that the resulting RGD iterates converge linearly, whereas RGN eventually converges Q-quadratically.
Jian-Feng Cai, Xi-Liang Lu, Juntao You
· 0 citations