The low-rank matrix completion problem can be solved by Riemannian optimization on a fixed-rank manifold. However, drawback of the known approaches is that rank parameter has to fixed priori. In this paper, we consider set bounded-rank matrices. We propose rank-adaptive method, which consists optimization, increase step and reduction step. explore its performance applied problem. Numerical expe...
