A convergent Gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements
2015
We propose a simple, scalable, and fast gradient descent algorithm to optimize a nonconvex objective for the rank minimization problem and a closely related family of semidefinite programs. With O(r3K2n log n) random measurements of a positive semidefinite n x n matrix of rank r and condition number K, our method is guaranteed to converge linearly to the global optimum.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
25
References
84
Citations
NaN
KQI