{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T10:05:26Z","timestamp":1780394726162,"version":"3.54.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61601284"],"award-info":[{"award-number":["61601284"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Huawei Innovation Research Program"},{"DOI":"10.13039\/100007567","name":"CityU","doi-asserted-by":"publisher","award":["7004431"],"award-info":[{"award-number":["7004431"]}],"id":[{"id":"10.13039\/100007567","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1109\/lsp.2017.2685518","type":"journal-article","created":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T02:04:38Z","timestamp":1490148278000},"page":"579-583","source":"Crossref","is-referenced-by-count":51,"title":["Robust Matrix Completion via Alternating Projection"],"prefix":"10.1109","volume":"24","author":[{"given":"Xue","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhimeng","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xingzhao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hing Cheung","family":"So","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/120902653"},{"key":"ref10","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pac J Optim"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2212015"},{"key":"ref12","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"jain","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/120876459"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-013-0434-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2323359"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.25"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2576979"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-008-9036-y"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144593251710"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472907"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-012-0406-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2183773"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"ref21","first-page":"771","article-title":"Efficient computation of robust low-rank matrix approximations in the presence\n of missing data using the $L_1$ norm","author":"eriksson","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref24","first-page":"272","article-title":"Efficient projections\n onto the L1-ball for learning in high dimensions","author":"duchi","year":"0","journal-title":"Proc 25th Int Conf Mach Learn"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0946-6"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/7885156\/07883929.pdf?arnumber=7883929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:27:50Z","timestamp":1642004870000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7883929\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/lsp.2017.2685518","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5]]}}}