arXiv:1507.03566 [math.OC]AbstractReferencesReviewsResources
Low-rank Solutions of Linear Matrix Equations via Procrustes Flow
Stephen Tu, Ross Boczar, Mahdi Soltanolkotabi, Benjamin Recht
Published 2015-07-13Version 1
In this paper we study the problem of recovering an low-rank positive semidefinite matrix from linear measurements. Our algorithm, which we call Procrustes Flow, starts from an initial estimate obtained by a thresholding scheme followed by gradient descent on a non-convex objective. We show that as long as the measurements obey a standard restricted isometry property, our algorithm converges to the unknown matrix at a geometric rate. In the case of Gaussian measurements, such convergence occurs for a $n \times n$ matrix of rank $r$ when the number of measurements exceeds a constant times $nr$.
Categories: math.OC
Related articles:
arXiv:1809.02491 [math.OC] (Published 2018-09-06)
A note on rank constrained solutions to linear matrix equations
arXiv:0706.4138 [math.OC] (Published 2007-06-28)
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
arXiv:2210.14671 [math.OC] (Published 2022-10-26)
Bures-Wasserstein Barycenters and Low-Rank Matrix Recovery