{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:24:37Z","timestamp":1781367877297,"version":"3.54.1"},"reference-count":97,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Mag."],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/msp.2018.2821706","type":"journal-article","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T18:43:40Z","timestamp":1530211420000},"page":"14-31","source":"Crossref","is-referenced-by-count":123,"title":["Harnessing Structures in Big Data via Guaranteed Low-Rank Matrix Estimation: Recent Theory and Fast Algorithms via Convex and Nonconvex Optimization"],"prefix":"10.1109","volume":"35","author":[{"given":"Yudong","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6766-5459","authenticated-orcid":false,"given":"Yuejie","family":"Chi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","author":"lin","year":"2009","journal-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref32","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0422-2"},{"key":"ref37","first-page":"615","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":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805762"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS894"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2429594"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1267"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS949"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.105.150401"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2346205"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1272"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2248414"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref51","first-page":"964","article-title":"Low-rank solutions of linear matrix equations via Procrustes flow","author":"tu","year":"0","journal-title":"Proc Int Conf Machine Learning"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21638"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541725"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2018.01.001"},{"key":"ref55","first-page":"3873","article-title":"Global optimality of local search for low rank matrix recovery","author":"bhojanapalli","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems Conf"},{"key":"ref54","first-page":"29","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems Conf"},{"key":"ref53","article-title":"Convergence analysis for rectangular matrix completion using Burer-Monteiro factorization and gradient descent","author":"zheng","year":"2016"},{"key":"ref52","first-page":"109","article-title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements","author":"zheng","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems Conf"},{"key":"ref40","first-page":"427","article-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","author":"jaggi","year":"0","journal-title":"Proc Int Conf Machine Learning"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1904-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1148\/radiol.2016151002"},{"key":"ref6","first-page":"235","article-title":"Fast low-rank semidefinite programming for embedding and clustering","author":"kulis","year":"0","journal-title":"Proc Int Conf Artificial Intelligence and Statistics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177153"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref49","article-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","author":"chen","year":"2015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref9","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"98888","author":"negahban","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref46","first-page":"6192","article-title":"Linear convergence of a Frank-Wolfe type algorithm over trace-norm balls","author":"allen-zhu","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems Conf"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0564-1"},{"key":"ref47","first-page":"1188","article-title":"Sketchy decisions: Convex low-rank matrix optimization with optimal storage","author":"yurtsever","year":"0","journal-title":"Proc Int Conf Artificial Intelligence Statistics"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2461515"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/15M104726X"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329397"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/15M1035793"},{"key":"ref73","first-page":"2351","article-title":"Complete dictionary recovery using nonconvex optimization","author":"sun","year":"0","journal-title":"Proceedings of the 32nd Intl Conf on Machine Learning"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"ref71","first-page":"4152","article-title":"Fast algorithms for robust PCA via gradient descent","author":"yi","year":"0","journal-title":"Proc Neural Information Processing Systems Conf"},{"key":"ref70","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","author":"ge","year":"2017"},{"key":"ref76","article-title":"Accelerated methods for non-convex optimization","author":"carmon","year":"2016"},{"key":"ref77","article-title":"Finding approximate local minima for nonconvex optimization in linear time","author":"agarwal","year":"2016"},{"key":"ref74","first-page":"797","article-title":"Escaping from saddle points: Online stochastic gradient for tensor decomposition","author":"ge","year":"0","journal-title":"Proc Conf Learning Theory"},{"key":"ref75","first-page":"1724","article-title":"How to escape saddle points efficiently","author":"jin","year":"0","journal-title":"Proc Int Conf Machine Learning"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/78.365290"},{"key":"ref79","article-title":"Symmetry, saddle points, and global geometry of nonconvex matrix factorization","author":"li","year":"2016"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref62","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"jain","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems Conf"},{"key":"ref61","article-title":"Global optimality in tensor factorization, deep learning, and beyond","author":"haeffele","year":"2015"},{"key":"ref63","first-page":"1007","article-title":"Fast exact matrix completion with finite samples","author":"jain","year":"0","journal-title":"Proc Conf Learning Theory"},{"key":"ref64","first-page":"1107","article-title":"Non-convex robust PCA","author":"netrapalli","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems Conf"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref66","first-page":"1022","article-title":"Provable non-convex phase retrieval with outliers: Median truncated Wirtinger flow","author":"zhang","year":"0","journal-title":"Proc Int Conf Machine Learning"},{"key":"ref67","article-title":"Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval, matrix completion and blind deconvolution","author":"ma","year":"2017"},{"key":"ref68","article-title":"Nonconvex matrix factorization from rank-one measurements","author":"li","year":"2018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref69","first-page":"361","article-title":"On the low-rank approach for semidefinite programs arising in synchronization and community detection","author":"bandeira","year":"0","journal-title":"Proc 29th Annu Conf Learn Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref95","first-page":"1224","article-title":"Low rank matrix completion with exponential family noise","author":"lafond","year":"0","journal-title":"Proc Conf Learning Theory"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2684758"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2773474"},{"key":"ref91","article-title":"Finding low-rank solutions to matrix problems, efficiently and provably","author":"park","year":"2016"},{"key":"ref90","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/2827872","article-title":"The MovieLens datasets: History and context","volume":"5","author":"harper","year":"2016","journal-title":"ACM Trans Interact Intell Syst"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447183"},{"key":"ref97","article-title":"The leave-one-out approach for matrix completion: Primal and dual analysis","author":"ding","year":"2018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1987.1165136"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2005.07.001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21432"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294644"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2112650"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-012-9129-5"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2016.2601296"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2003.1243393"},{"key":"ref84","article-title":"Spectral compressed sensing via projected gradient descent","author":"cai","year":"2017"},{"key":"ref19","first-page":"35","article-title":"The Netflix prize","author":"bennett","year":"0","journal-title":"Proc KDD Cup and Workshop"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.12.003"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343623"},{"key":"ref89","first-page":"1","article-title":"Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices","volume":"17","author":"chen","year":"2016","journal-title":"J Mach Learning Res"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2659644"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"},{"key":"ref88","article-title":"Community detection and the stochastic block model: Recent developments","author":"abbe","year":"2017","journal-title":"J Mach Learn Res"}],"container-title":["IEEE Signal Processing Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/79\/8398571\/08399563.pdf?arnumber=8399563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:23:37Z","timestamp":1642004617000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8399563\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":97,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/msp.2018.2821706","relation":{},"ISSN":["1053-5888","1558-0792"],"issn-type":[{"value":"1053-5888","type":"print"},{"value":"1558-0792","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}