[1] Davenport M A, Romberg J. An overview of low-rank matrix recovery from incomplete observations[J]. IEEE Journal of Selected Topics in Signal Processing, 2016, 10(4): 608-622. [2] Fazel M. Matrix rank minimization with applications[D]. Ph.D. dissertation, Stanford University, 2002. [3] Harvey N J A, Karger D R, Yekhanin B. The complexity of matrix completion[C]. Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. Society for Industrial and Applied Mathematics, 2006. 1103-1111. [4] Candès E J, Recht B. Exact matrix completion via convex optimization[J]. Foundations of Computational Mathematics, 2009, 9(6): 717-772. [5] Candès E J, Tao T. The power of convex relaxation: near-optimal matrix completion[J]. IEEE Transactions on Information Theory, 2010, 56(5): 2053-2080. [6] Cai J F, Candès E J, Shen Z. A singular value thresholding algorithm for matrix completion[J]. SIAM Journal on Optimization, 2010, 20(4): 1956-1982. [7] Hu Y, Zhang D, Liu J. Accelerated Singular Value Thresholding for Matrix Completion[C]. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, 2012, 298-306. [8] Toh K C, Yun S W. An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems[J]. Pacific Journal of Optimization, 2010, 15(6): 615-640. [9] 陈敏铭.矩阵重建的算法与实现[D].中国科学院研究生院硕士学位论文,2010. [10] Ma S Q, Goldfarb D, Chen L F. Fixed point and Bregman iterative methods for matrix rank minmization[J]. Mathematical Programming, 2011, 128(1-2): 321-353. [11] Chen C H, He B S, Yuan X M. Matrix completion via an alternating direction method[J]. IMA Journal of Numerical Analysis, 2012, 32(1): 227-245. [12] Tanner J and Wei K. Normalized iterative hard thresholding for matrix completion[J]. SIAM Journal on Scientific Computing, 2013, 35(5): S104-S125. [13] Blanchard J D, Tanner J, Wei K. CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion[J]. Information and Inference: A Journal of the IMA, 2015, 4(4): 289-327. [14] Vandereycken B. Low-rank matrix completion by Riemannian optimization[J]. SIAM Journal on Optimization, 2013, 23(2): 1214-1236. [15] Ngo T, Saad Y. Scaled gradients on Grassmann manifolds for matrix completion[C]. Advances in Neural Information Processing Systems. 2012: 1412-1420. [16] Haldar J P, Hernando D. Rank-constrained solutions to linear matrix equations using powerfactorization[J]. IEEE Signal Processing Letters, 2009, 16(7): 584-587. [17] Wen Z W, Yin W T, Zhang Y. Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm[J]. Mathematical Programming Computation, 2012, 4: 333-361. [18] Tanner J, Wei K. Low rank matrix completion by alternating steepest descent methods[J]. Applied and Computational Harmonic Analysis, 2016, 40(2): 417-429. |