{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:45:46Z","timestamp":1783611946602,"version":"3.55.0"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1526434"],"award-info":[{"award-number":["CCF-1526434"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61571384"],"award-info":[{"award-number":["61571384"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007249","name":"Doctoral Dissertation Fellowship from the Graduate School of the University of Minnesota","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007249","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1109\/tit.2016.2598574","type":"journal-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T18:39:21Z","timestamp":1470681561000},"page":"6535-6579","source":"Crossref","is-referenced-by-count":207,"title":["Guaranteed Matrix Completion via Non-Convex Factorization"],"prefix":"10.1109","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2487-5322","authenticated-orcid":false,"given":"Ruoyu","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi-Quan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1198"},{"key":"ref38","first-page":"476","article-title":"Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima","author":"loh","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","article-title":"Quantum state tomography via compressed sensing","author":"gross","year":"2009"},{"key":"ref32","article-title":"Phase retrieval via Wirtinger flow: Theory and algorithms","author":"cand\u00e8s","year":"2014"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref30","article-title":"Matrix completion via nonconvex factorization: Algorithms and theory","author":"sun","year":"2015"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1214\/12-STS399"},{"key":"ref36","first-page":"2796","article-title":"Phase retrieval using alternating minimization","author":"netrapalli","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref35","article-title":"Global convergence of stochastic gradient descent for some non-convex matrix problems","author":"de sa","year":"2014"},{"key":"ref34","article-title":"Fast exact matrix completion with finite samples","author":"jain","year":"2014"},{"key":"ref60","article-title":"On the expected convergence of randomly permuted ADMM","author":"sun","year":"2015"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497331063"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1080\/10556789408805580"},{"key":"ref63","author":"stewart","year":"1998","journal-title":"Perturbation theory for the singular value decomposition"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864726"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507164"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.168"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.52"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref20","first-page":"638","article-title":"Fast matrix completion without the condition number","author":"hardt","year":"2014","journal-title":"Proc Conf Learning Theory (COLT)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"},{"key":"ref24","first-page":"5","article-title":"Improving regularized singular value decomposition for collaborative filtering","volume":"2007","author":"paterek","year":"2007","journal-title":"Proc KDD Cup Workshop"},{"key":"ref23","author":"funk","year":"2006","journal-title":"Netflix update Try this at home"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0053-8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020426"},{"key":"ref50","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00074-7"},{"key":"ref58","article-title":"Matrix completion and low-rank SVD via fast alternating least squares","author":"hastie","year":"2014"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130211"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2335237"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/120891009"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"ref53","article-title":"Worst-case complexity of cyclic coordinate descent: O(n2) gap with randomized version","author":"sun","year":"2016"},{"key":"ref52","first-page":"1306","article-title":"Improved iteration complexity bounds of cyclic block coordinate descent for convex problems","author":"sun","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref40","first-page":"899","article-title":"Truncated power method for sparse eigenvalue problems","volume":"14","author":"yuan","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"},{"key":"ref12","first-page":"15","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Optim"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1032"},{"key":"ref14","first-page":"710","article-title":"On the linear convergence of the proximal gradient method for trace norm regularization","author":"hou","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87481-2_24"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345466"},{"key":"ref17","article-title":"Efficient algorithms for collaborative filtering","author":"keshavan","year":"2012"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.13.5.344"},{"key":"ref7","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref9","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"negahban","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20089"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932678"},{"key":"ref48","article-title":"Universal matrix completion","author":"bhojanapalli","year":"2014"},{"key":"ref47","first-page":"674","article-title":"Coherent matrix completion","author":"chen","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref42","first-page":"1107","article-title":"Non-convex robust PCA","author":"netrapalli","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","article-title":"Nonconvex statistical optimization: Minimax-optimal sparse PCA in polynomial time","author":"wang","year":"2014"},{"key":"ref44","article-title":"High dimensional expectation-maximization algorithm: Statistical optimization and asymptotic normality","author":"wang","year":"2014"},{"key":"ref43","article-title":"Statistical guarantees for the EM algorithm: From population to sample-based analysis","author":"balakrishnan","year":"2014"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/7593371\/7536166-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7593371\/07536166.pdf?arnumber=7536166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:25Z","timestamp":1649444125000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7536166\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":63,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2598574","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}