{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T15:30:17Z","timestamp":1777649417567,"version":"3.51.4"},"reference-count":78,"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"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100007707","name":"University of California, Davis","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007707","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1400217"],"award-info":[{"award-number":["CMMI-1400217"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1635106"],"award-info":[{"award-number":["CMMI-1635106"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-17-1-0298"],"award-info":[{"award-number":["W911NF-17-1-0298"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. IEEE"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/jproc.2018.2846606","type":"journal-article","created":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T19:08:23Z","timestamp":1531940903000},"page":"1411-1426","source":"Crossref","is-referenced-by-count":42,"title":["Efficient Optimization Algorithms for Robust Principal Component Analysis and Its Variants"],"prefix":"10.1109","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1967-1069","authenticated-orcid":false,"given":"Shiqian","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9839-9894","authenticated-orcid":false,"given":"Necdet Serhat","family":"Aybat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244"},{"key":"ref72","author":"wei","year":"2016","journal-title":"Guarantees of Riemannian optimization for low rank matrix completion"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1137\/110845768"},{"key":"ref70","first-page":"406","article-title":"RTRMC: A Riemannian trust-region method for low-rank matrix completion","author":"boumal","year":"2011","journal-title":"NIPS"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1561\/2400000011"},{"key":"ref77","first-page":"1","article-title":"Low-rank matrix completion using nuclear norm with facial reduction","author":"huang","year":"2017","journal-title":"J Global Optim"},{"key":"ref74","first-page":"121","article-title":"Robust PCA: Optimization of the robust reconstruction error over the stiefel manifold","author":"podosinnikova","year":"2014","journal-title":"Proc GCPR"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/090777761"},{"key":"ref75","author":"zhang","year":"2017","journal-title":"Primal-dual optimization algorithms over Riemannian manifolds An iteration complexity analysis"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042333"},{"key":"ref78","author":"ma","year":"2018","journal-title":"Robust principal component analysis using facial reduction"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref32","author":"jiang","year":"2016","journal-title":"Structured nonconvex and nonsmooth optimization Algorithms and iteration complexity analysis"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2012.700713"},{"key":"ref30","article-title":"Online robust PCA via stochastic optimization","author":"feng","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/080725891"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910264"},{"key":"ref35","article-title":"On accelerated proximal gradient methods for convex-concave optimization","author":"tseng","year":"2008"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref60","article-title":"Une propriete topologique des sous-ensembles analytiquesreels","author":"?ojasiewicz","year":"1963","journal-title":"Les équations aux dérivées partielles"},{"key":"ref62","first-page":"1089","article-title":"SpaRCS: Recovering low-rank and sparse matrices from compressive measurements","author":"waters","year":"2011","journal-title":"Proc NIPS"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1070.0291"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0846-1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-014-0527-y"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref27","first-page":"650","article-title":"Greedy bilateral sketch, completion & smoothing","volume":"31","author":"zhou","year":"2013","journal-title":"Proc 16th Int Conf Artif Intell Statist"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2338077"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841059"},{"key":"ref29","first-page":"600","article-title":"Low-rank and sparse structure pursuit via alternating minimization","author":"gu","year":"2016","journal-title":"Proc AISTATS"},{"key":"ref67","first-page":"203","article-title":"Decomposition and coordination methods in large scale optimization problems: The nondifferentiable case and the use of augmented Lagrangians","volume":"1","author":"cohen","year":"1984","journal-title":"Adv Large Scale Syst"},{"key":"ref68","author":"keshavan","year":"2009","journal-title":"A Gradient Descent Algorithm on the Grassmann Manifold for Matrix Completion"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.282"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","article-title":"Robust principal component analysis?","volume":"58","author":"cand\u00e8s","year":"2009","journal-title":"J ACM"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/100781894"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9736-6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-013-9613-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-017-0612-7"},{"key":"ref23","article-title":"A variational approach to stable principal component pursuit","author":"aravkin","year":"2014","journal-title":"Proc Conf Uncertainty in Artificial Intelligence (UAI)"},{"key":"ref26","article-title":"GoDec: Randomized low-rank and sparse matrix decomposition in noisy case","author":"zhou","year":"2011","journal-title":"Proc ICML"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/15M101628X"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.7146\/dpb.v27i537.7070"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/120899157"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.5802\/aif.1638"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1137\/15M1027528"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0117135"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2014.2380195"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1981"},{"key":"ref54","article-title":"Sparse convex optimization methods for machine learning","author":"jaggi","year":"2011"},{"key":"ref53","first-page":"427","article-title":"Revisiting Frank–Wolfe: Projection-free sparse convex optimization","author":"jaggi","year":"2013","journal-title":"Proc ICML"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref10","article-title":"Analysis of robust PCA via local incoherence","volume":"28","author":"zhang","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref11","author":"yi","year":"2016","journal-title":"Fast algorithms for robust PCA via gradient descent"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(76)90003-1"},{"key":"ref12","author":"zhang","year":"2017","journal-title":"Robust PCA by manifold optimization"},{"key":"ref13","author":"netrapalli","year":"2014","journal-title":"Non-convex robust PCA"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2013.11.009"},{"key":"ref15","article-title":"Algorithms for stable PCA","author":"aybat","year":"2016","journal-title":"Handbook of Robust Low Rank and Sparse Matrix Decomposition Applications in Image and Video Processing"},{"key":"ref16","article-title":"Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix","author":"lin","year":"2009","journal-title":"Proc Int Workshop Comput Adv Multi-Sensor Adapt Process"},{"key":"ref17","article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2009"},{"key":"ref18","first-page":"167","article-title":"Sparse and low-rank matrix decomposition via alternating direction methods","volume":"9","author":"yuan","year":"2013","journal-title":"Pacific J Optim"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0530-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.322"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref6","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","volume":"22","author":"wright","year":"2009","journal-title":"Advances in neural information processing systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref7","first-page":"2496","article-title":"Robust PCA via outlier pursuit","volume":"23","author":"xu","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref49","author":"aybat","year":"2011","journal-title":"Fast Firstorder Methods for Stable Principal Component Pursuit"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513535"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/110849468"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/110836936"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0826-5"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-015-0092-0"},{"key":"ref42","author":"fortin","year":"1983","journal-title":"Augmented Lagrangian Methods Applications to the Numerical Solution of Boundary-Value Problems"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-2024(08)70034-1"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581204"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/0716071"}],"container-title":["Proceedings of the IEEE"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/5\/8425666\/8412568-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5\/8425666\/08412568.pdf?arnumber=8412568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:55Z","timestamp":1649444155000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8412568\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":78,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/jproc.2018.2846606","relation":{},"ISSN":["0018-9219","1558-2256"],"issn-type":[{"value":"0018-9219","type":"print"},{"value":"1558-2256","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}