| [1] Bennett J,Lanning S.The netflix prize[J].In Proceedings of KDD Cup and Workshop,2007.[2] Bertalmio M,Sapiro G,Caselles V,Ballester C.Image inpainting[J].Comput.Grapher,(SIGGRAPH 2000),2000,34:417-424.[3] Argyriou A,Evgeniou T,Pontil M.Multi-task feature learing[J].Adv.Neural Information Processing Systems,2007,19:41-48.[4] Tomasi C,Kanade T.Shape and motion from image streams under orthography:a factorization method[J].Int.J.Comput Vision,1992,9:137-154.[5] Mesbahi M,Papavassilopoulos G P.On the rank minimization problem over a positive semidefinite linear matrix inequality[J].IEEE Transactions on Automatic Control,1997,42:239-243.[6] Moon Y S,Park P G,Kwon W H.Delay-dependent robust stabilization of uncertain state-delayed systems[J].Internation Journal of Control,2001,74(14):1447-1455.[7] Candès E J,Plan Y.Matrix completion with noise[J].Proceedings of the IEEE,2010,98(6):925-936.[8] Chen P,Suter D.Recovering the missing components in a large noisy low-rank matrix:application to sfm source[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2004,26:1051-1063.[9] Abernethy F,Evgeniou T,Vert J P.A new approach to collaborative filtering:operator estimation with spectral regularization[J].Journal of Machine Learning Research,2009,10:803-826.[10] Nicolas Boumal,Absil P A.RTRMC:A Riemannian trust-region method for low-rank matrix completion[A].Annual conference on Neural Information Processing Systems 25th,2011,24:406-414.[11] Keshavan R H,Montanari A,Sewoong O.Matrix Completion From a Few Entries[J].IEEE Trans.Inform.Theory,2010,56(6):2980-2998.[12] Lee K,Bresler Y.ADMiRA:Atomic Decomposition for Minimum Rank Approximation[J].IEEE Trans.Inform.Theory,2010,56(9):4402-4416.[13] Candès E J,Recht B.Exact matrix completion via convex optimization[J].Found.Comput.Math.,2009,9(6):717-772.[14] Toh K C,Yun S.An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems[J].Pacific J.Optimi.,2010,6:615-640.[15] Cai J F,Candès E J,Shen Z.A singuar value thresholding algorithm for matrix completion[J].SIAM J.Optim.,2010,20:1956-1982.[16] Lin Z,Chen M,Wu L,Ma Y.The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices[M].UIUC Technicial Report UIUL-ENG-09-2214,2010.[17] Lin Z,Ganesh A,Wright J,Wu L,Chen M,Ma Y.Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix[A].IEEE International Workshop on Computational Advances in Multi-sensor Adaptive Processing,Aruba,Dutch Antilles,2009,56(3):707-722.[18] Dai W,Milenkovic O.SET:an algorithm for consistent matrix completion[A].IEEE International Conference on Acoustics,Speech,and Signal Processing,2010,3646-3649.[19] Ma S,Goldfarb D,Chen L.Fixed point and Bregman iterative methods for matrix rank minimization[J].Math.Program.,2011,128(1-2):321-353.[20] Chen C,He B,Yuan X.Matrix completion via an alternating direction method[J].Ima.J.Numer.Anal.,2012,32(1):227-245.[21] Yuan M,Joseph R,Zou H.Structured variable selection and estimation[J].Annals of Applied Statistics,2009,3(4):1738-1757.[22] Ma Y,Zhi L.The minimum-rank gram matrix completion via modified fixed point continuation method[A].International Symposium on Symbolic and Algebraic Computation 36th,2011,241-248.[23] Jain P,Netrapalli P,Sanghavi S.Low-rank matrix completion using alternating minimization[J].Statistics,2012,665-674.[24] 刘丽霞,王川龙.基于均值的Toeplitz矩阵填充的子空间算法[J].计算数学,2017,2(39):179-188. |
