{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:51:07Z","timestamp":1774540267900,"version":"3.50.1"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tsp.2020.3011024","type":"journal-article","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T20:33:56Z","timestamp":1595363636000},"page":"6128-6141","source":"Crossref","is-referenced-by-count":5,"title":["Best Pair Formulation & Accelerated Scheme for Non-Convex Principal Component Pursuit"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6994-1659","authenticated-orcid":false,"given":"Aritra","family":"Dutta","sequence":"first","affiliation":[]},{"given":"Filip","family":"Hanzely","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0752-3851","authenticated-orcid":false,"given":"Jingwei","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Richtarik","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2005.09.012"},{"key":"ref70","first-page":"1","article-title":"Optimality, identifiability, and sensitivity","volume":"147","author":"drusvyatskiy","year":"2013","journal-title":"Math Program"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ejor.2016.07.014","article-title":"Matrix completion under interval uncertainty","volume":"256","author":"mare?ek","year":"2017","journal-title":"Eur J Oper Res"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICSAI.2018.8599289"},{"key":"ref30","first-page":"797","article-title":"Nearly optimal robust matrix completion","author":"cherapanamjeri","year":"0","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref34","first-page":"1007","article-title":"Fast exact matrix completion with finite samples","author":"jain","year":"0","journal-title":"Proc 28th Conf Learn Theory"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1999.791228"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177153"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819861"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008005721484"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2784361"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/34.927464"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2685518"},{"key":"ref65","first-page":"266","article-title":"Robust stochastic principal component analysis","author":"goes","year":"0","journal-title":"Proc Int Conf Articial Intell Stat"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2465956"},{"key":"ref29","first-page":"593","article-title":"Thresholding based outlier robust PCA","author":"cherapanamjeri","year":"0","journal-title":"Proc 30th Conf Learn Theory"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2818322"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623401387623"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1137\/110852103"},{"key":"ref2","article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2010"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000055"},{"key":"ref20","first-page":"873","article-title":"Robust matrix completion and corrupted columns","author":"chen","year":"0","journal-title":"Proc Int Conf Int Conf Mach Learn"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158250"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/100781894"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-012-9176-9"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.160"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-016-0736-y"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/15M1025153"},{"key":"ref50","article-title":"Convergence rates of first-order operator splitting methods","author":"liang","year":"2016"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.12.024"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995508"},{"key":"ref58","first-page":"1568","article-title":"Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video","author":"he","year":"0","journal-title":"Proc IEEE Conf Comput Vision Pattern Recognit"},{"key":"ref57","first-page":"1853","article-title":"Weighted low rank approximation for background estimation problems","author":"dutta","year":"0","journal-title":"Proc IEEE Int Conf Comput Vision Workshops"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/WACV.2019.00063"},{"key":"ref55","first-page":"1835","article-title":"A batch-incremental video background estimation model using weighted low-rank approximation of matrices","author":"dutta","year":"0","journal-title":"Proc IEEE Int Conf Comput Vision Workshops"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2014.04.001"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2016.11.001"},{"key":"ref52","article-title":"Weighted low-rank approximation of matrices and background modeling","author":"dutta","year":"2018","journal-title":"arXiv 1804 06252"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7"},{"key":"ref11","first-page":"33","article-title":"Godec: Randomized low-rank and sparse matrix decomposition in noisy case","author":"zhou","year":"0","journal-title":"Proc 28th Int Conf Mach Learn"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2940121"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref13","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":"ref14","first-page":"1107","article-title":"Non-convex robust PCA","volume":"27","author":"netrapalli","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref15","article-title":"Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix","author":"lin","year":"2009"},{"key":"ref16","first-page":"1089","article-title":"SpaRCS: Recovering low-rank and sparse matrices from compressive measurements","author":"waters","year":"0","journal-title":"Proc 24nd Advances Neural Inf Process Syst"},{"key":"ref17","first-page":"361","article-title":"Fast algorithms for robust PCA via gradient descent","author":"yi","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref18","first-page":"1","article-title":"Robust PCA by manifold optimization","volume":"19","author":"zhang","year":"2018","journal-title":"J Mach Learn Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2013.11.009"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref3","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices by convex optimization","author":"wright","year":"0","journal-title":"Proc 22nd Adv Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref49","first-page":"1970","article-title":"Local linear convergence of Forward–Backward under partial smoothness","author":"liang","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011468"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-09-05048-X"},{"key":"ref45","first-page":"4042","article-title":"A multi-step inertial forward–backward splitting method for non-convex optimization","author":"liang","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21752-9"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/050644641"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2880454"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/0716071"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8933520\/09145595.pdf?arnumber=9145595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:40:38Z","timestamp":1651070438000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9145595\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":71,"URL":"https:\/\/doi.org\/10.1109\/tsp.2020.3011024","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}