[1] Y. Chen, Y. Chi, J. Fan, and C. Ma, "Gradient descent with random initialization: Fast global convergence for nonconvex phase retrieval," Mathematical Programming, vol. 176, no. 1-2, pp. 5-37, 2019.
[2] A. Ahmed, B. Recht, and J. Romberg, "Blind deconvolution using convex programming," IEEE Transactions on Information Theory, vol. 60, no. 3, pp. 1711-1732, 2014.
[3] S. Tu, R. Boczar, M. Simchowitz, M. Soltanolkotabi, and B. Recht, "Low-rank solutions of linear matrix equations via procrustes flow," in International Conference on Machine Learning, pp. 964-973, 2016.
[4] E. J. Candès and B. Recht, "Exact matrix completion via convex optimization," Foundations of Computational Mathematics, vol. 9, no. 6, pp. 717-772, 2009.
[5] D. F. Gleich and L.-h. Lim, “Rank aggregation via nuclear norm minimization,” in Proceedings of the 17th ACM international conference on Knowledge discovery and data mining, pp. 60–68, ACM, 2011.
[6] E. J. Candès, X. Li, Y. Ma, and J. Wright, "Robust principal component analysis?", Journal of the ACM, vol. 58, no. 3, pp. 11:1-11:37, 2011.
[7] Y. Hu, X. Liu, and M. Jacob, "A generalized structured low-rank matrix completion algorithm for mr image recovery," IEEE Transactions on Medical Imaging, vol. 38, no. 8, pp. 1841-1851, 2019.
[8] Y. Chi, Y. M. Lu, and Y. Chen, "Nonconvex optimization meets low-rank matrix factorization: An overview," IEEE Transactions on Signal Processing, vol. 67, no. 20, pp. 5239-5269, 2019.
[9] E. J. Candès and T. Tao, “The power of convex relaxation: Near-optimal matrix completion,” IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2053–2080, 2010.
[10] R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries," IEEE Transactions on Information Theory, vol. 56, no. 6, pp. 2980-2998, 2010.
[11] P. Jain, P. Netrapalli, and S. Sanghavi, "Low-rank matrix completion using alternating minimization," in Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pp. 665-674, ACM, 2013.
[12] Y. Chen and M. J. Wainwright, "Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees," arXiv preprint arXiv:1509.03025, 2015.
[13] R. Sun and Z.-Q. Luo, “Guaranteed matrix completion via non-convex factorization,” IEEE Transactions on Information Theory, vol. 62, no. 11, pp. 6535–6579, 2016.
[14] C. Ma, K. Wang, Y. Chi, and Y. Chen, "Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution," Foundations of Computational Mathematics, vol. 20, no. 3, pp. 451-632, 2020.
[15] J. Chen, D. Liu, and X. Li, “Nonconvex rectangular matrix completion via gradient descent without  $\ell_{2,\infty}$  regularization,” IEEE Transactions on Information Theory, vol. 66, no. 9, pp. 5806-5841, 2020.
[16] S. S. Du, C. Jin, J. D. Lee, M. I. Jordan, A. Singh, and B. Poczos, "Gradient descent can take exponential time to escape saddle points," in Advances in Neural Information Processing Systems, 2017.
[17] Y. Li, T. Ma, and H. Zhang, "Algorithms regularization in over-parameterized matrix sensing and neural networks with quadratic activations," in Conference on Learning Theory, pp. 2-47, 2018.
[18] T. Ye and S. S. Du, "Global convergence of gradient descent for asymmetric low-rank matrix factorization," in Advances in Neural Information Processing Systems, pp. 1429-1439, 2021.