Differential Geometry with Applications to Low-Rank Matrix Completion

We will tell a few words about Riemannian optimization for low-rank matrix completion problem, more precisely, about algorithm that minimizes the least-square distance on the sampling set over fixed-rank matrices manifold. During the talk we will discuss in detail differential geometry that appears in proposed algorithm.