In this talk, we consider the low-rank matrix completion problem which has been extensively studied in recent years. This problem can be solved by Riemannian optimization on a fixed-rank manifold.