{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T17:12:35Z","timestamp":1790615555850,"version":"4.1.0"},"reference-count":84,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"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":["Proc. IEEE"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/jproc.2018.2844126","type":"journal-article","created":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T17:43:06Z","timestamp":1533577386000},"page":"1359-1379","source":"Crossref","is-referenced-by-count":67,"title":["Static and Dynamic Robust PCA and Matrix Completion: A Review"],"prefix":"10.1109","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2774-0650","authenticated-orcid":false,"given":"Namrata","family":"Vaswani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5761-7357","authenticated-orcid":false,"given":"Praneeth","family":"Narayanamurthy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Proc NIPS"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref71","first-page":"638","article-title":"Fast matrix completion without the condition number","author":"hardt","year":"2014","journal-title":"Proc COLT"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref76","first-page":"1460","article-title":"Global convergence of a Grassmannian gradient descent algorithm for subspace estimation","author":"zhang","year":"2016","journal-title":"Proc AISTATS"},{"key":"ref77","first-page":"1","article-title":"Enhanced online subspace estimation via adaptive sensing","author":"ongie","year":"2018","journal-title":"Proc Asilomar"},{"key":"ref74","author":"ge","year":"2017","journal-title":"No spurious local minima in nonconvex low rank problems A unified geometric analysis"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158250"},{"key":"ref75","author":"sun","year":"2015","journal-title":"When are nonconvex problems not scary?"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034215"},{"key":"ref79","doi-asserted-by":"crossref","DOI":"10.1201\/b20190","author":"bouwmans","year":"2016","journal-title":"Handbook of Robust Low-Rank and Sparse Matrix Decomposition Applications in Image and Video Processing"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120243"},{"key":"ref32","author":"cherapanamjeri","year":"2016","journal-title":"Nearly-optimal robust matrix completion"},{"key":"ref31","first-page":"873","article-title":"Robust matrix completion with corrupted columns","author":"chen","year":"2011","journal-title":"Proc ICML"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref37","article-title":"LRSLibrary: Low-rank and sparse tools for background modeling and subtraction in videos","author":"sobral","year":"2016","journal-title":"Robust Low-Rank and Sparse Matrix Decomposition Applications in Image and Video Processing"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257913"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283062"},{"key":"ref34","first-page":"1089","article-title":"SpaRCS: Recovering low-rank and sparse matrices from compressive measurements","author":"waters","year":"2011","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref60","first-page":"1768","article-title":"Correlated-PCA: Principal components’ analysis when data and noise are correlated","author":"vaswani","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2003.1246944"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262819"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238667"},{"key":"ref28","author":"narayanamurthy","year":"2018","journal-title":"Provable dynamic robust PCA or robust subspace tracking"},{"key":"ref64","first-page":"404","article-title":"Online robust PCA via stochastic optimization","author":"feng","year":"2013","journal-title":"Proc NIPS"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282771"},{"key":"ref65","first-page":"1568","article-title":"Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video","author":"he","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit (CVPR)"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/s00138-013-0555-4"},{"key":"ref29","first-page":"1107","article-title":"Non-convex robust PCA","author":"netrapalli","year":"2014","journal-title":"Proc NIPS"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178735"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref69","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/2346896"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2826566"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2833429"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2016.7551731"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2668146"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.25240"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2012.2233193"},{"key":"ref50","first-page":"4152","article-title":"Fast algorithms for robust PCA via gradient descent","author":"yi","year":"2016","journal-title":"Proc NIPS"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/78.365290"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1137\/15M1054201"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2051150"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2421485"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-014-9227-7"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2282910"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1002\/9780470575758"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0165-1684(96)00008-4","article-title":"Asymptotic convergence analysis of the projection approximation subspace tracking algorithms","volume":"50","author":"yang","year":"1996","journal-title":"Signal Process"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706961"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2331612"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2331344"},{"key":"ref14","first-page":"1488","article-title":"Online (and offline) robust PCA: Novel algorithms and performance guarantees","author":"zhan","year":"2016","journal-title":"Proc Artif Intell Statist (AISTATS) Conf"},{"key":"ref15","article-title":"Nearly optimal robust subspace tracking","author":"narayanamurthy","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21432"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6737077"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2847041"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.939739"},{"key":"ref18","first-page":"749","article-title":"A novel M-estimator for robust PCA","volume":"15","author":"zhang","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref83","author":"zhang","year":"2016","journal-title":"Provable Non-convex Phase Retrieval with Outliers Median Truncated Wirtinger Flow"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2853141"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854862"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46992-3_22"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1002\/0471725250","author":"huber","year":"1981","journal-title":"Robust Statistics"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/72.363442"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(01)00188-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048473"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023709501986"},{"key":"ref49","article-title":"A fast and memory-efficient algorithm for robust PCA (MERoP)","author":"narayanamurthy","year":"2018","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process (ICASSP)"},{"key":"ref9","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","author":"wright","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2684758"},{"key":"ref45","article-title":"Reshaped Wirtinger flow and incremental algorithm for solving quadratic system of equations","author":"zhang","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/110843642"},{"key":"ref47","article-title":"Godec: Randomized low-rank & sparse matrix decomposition in noisy case","author":"zhou","year":"2011","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref42","first-page":"665","article-title":"Low-rank matrix completion using alternating minimization","author":"netrapalli","year":"2013","journal-title":"Proc STOC"},{"key":"ref41","article-title":"Matrix rank minimization with applications","author":"fazel","year":"2002"},{"key":"ref44","first-page":"739","article-title":"Solving random quadratic systems of equations is nearly as easy as solving linear systems","author":"chen","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref43","first-page":"2796","article-title":"Phase retrieval using alternating minimization","author":"netrapalli","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"}],"container-title":["Proceedings of the IEEE"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5\/8425666\/08425658.pdf?arnumber=8425658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T09:55:27Z","timestamp":1643190927000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8425658\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":84,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/jproc.2018.2844126","relation":{},"ISSN":["0018-9219","1558-2256"],"issn-type":[{"value":"0018-9219","type":"print"},{"value":"1558-2256","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}