{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T17:17:30Z","timestamp":1785604650015,"version":"3.56.0"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"20","license":[{"start":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T00:00:00Z","timestamp":1571097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T00:00:00Z","timestamp":1571097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T00:00:00Z","timestamp":1571097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61871265"],"award-info":[{"award-number":["61871265"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61971278"],"award-info":[{"award-number":["61971278"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61903246"],"award-info":[{"award-number":["61903246"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2019,10,15]]},"DOI":"10.1109\/tsp.2019.2940121","type":"journal-article","created":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:14:21Z","timestamp":1568074461000},"page":"5402-5416","source":"Crossref","is-referenced-by-count":36,"title":["Nonconvex Regularized Robust PCA Using the Proximal Block Coordinate Descent Algorithm"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3083-9611","authenticated-orcid":false,"given":"Fei","family":"Wen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6670-149X","authenticated-orcid":false,"given":"Rendong","family":"Ying","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5321-2336","authenticated-orcid":false,"given":"Peilin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Trieu-Kien","family":"Truong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Best pair formulation & accelerated scheme for non-convex principal component pursuit","author":"dutta","year":"2019","journal-title":"arXiv 1905 10598v2"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-014-0614-7"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2595499"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2309076"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.13001\/1081-3810.3218"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-014-0614-7"},{"key":"ref35","author":"magnus","year":"1988","journal-title":"Matrix Differential Calculus with Applications in Statistics and Econometrics"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-53-02004-3"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"},{"key":"ref27","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"mazumder","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0133-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref1","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","author":"wright","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2212015"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI.2009.5193034"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","article-title":"L1\/2 regularization: A thresholding representation theory and a fast solver","volume":"23","author":"xu","year":"2012","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753382273"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/32\/7\/075004"},{"key":"ref26","first-page":"855","article-title":"Wave shrink with firm shrinkage","volume":"7","author":"gao","year":"1997","journal-title":"Statistica Sinica"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.132"},{"key":"ref51","first-page":"646","article-title":"Smoothed low rank and sparse matrix recovery by iteratively reweighted least squares minimization","volume":"24","author":"lu","year":"2014","journal-title":"IEEE Trans Image Process"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref56","article-title":"Expanded alternating optimization of nonconvex functions with applications to matrix factorization and penalized regression","author":"murdoch","year":"2014","journal-title":"arXiv 1412 4128v1"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.01.003"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2018.1496086"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-017-9915-8"},{"key":"ref52","article-title":"Iteration bounds for finding $\\epsilon$-stationary points for structured nonconvex optimization","author":"jian","year":"2014"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2208955"},{"key":"ref11","first-page":"1107","article-title":"Non-convex robust pca","author":"netrapalli","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICSAI.2018.8599289"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487604"},{"key":"ref13","author":"ulfarsson","year":"0","journal-title":"Proc ICASSP"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.15"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011468"},{"key":"ref16","article-title":"A unified framework for low-rank plus sparse matrix recovery","author":"zhang","year":"2018","journal-title":"arXiv 1702 06525v3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2307\/2337118"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1992.tb01864.x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/24\/3\/035020"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513535"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2017.2744626"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOS582"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2853589"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2826566"},{"key":"ref49","first-page":"33","article-title":"Godec: Randomized low-rank and sparse matrix decomposition in noisy case","author":"zhou","year":"0","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2880454"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819861"},{"key":"ref45","first-page":"1805","article-title":"Generalized singular value thresholding","author":"lu","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref48","first-page":"1","article-title":"Robust PCA by manifold optimization","volume":"19","author":"zhang","year":"2018","journal-title":"J Mach Learn Res"},{"key":"ref47","first-page":"361","article-title":"Fast algorithms for robust PCA via gradient descent","author":"yi","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref42","article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2010","journal-title":"ArXiv 1009 5055"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/WACV.2019.00063"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2511584"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.526"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8834988\/08827294.pdf?arnumber=8827294","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:47:38Z","timestamp":1657745258000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8827294\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,15]]},"references-count":57,"journal-issue":{"issue":"20"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2019.2940121","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,15]]}}}