{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:21:55Z","timestamp":1787494915590,"version":"build-2736575974"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1109\/ssp.2012.6319655","type":"proceedings-article","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T17:02:02Z","timestamp":1368637322000},"page":"185-188","source":"Crossref","is-referenced-by-count":13,"title":["MATRIX ALPS: Accelerated low rank and sparse matrix reconstruction"],"prefix":"10.1109","author":[{"given":"Anastasios","family":"Kyrillidis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Volkan","family":"Cevher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"15","author":"larsen","year":"0","journal-title":"Propack Software for Large and Sparse Svd Calculations"},{"key":"13","author":"halko","year":"2009","journal-title":"Finding structure with randomness Probabilistic algorithms for constructing approximate matrix decompositions"},{"key":"14","doi-asserted-by":"crossref","DOI":"10.21236\/ADA585818","author":"kyrillidis","year":"2012","journal-title":"Matrix Algebraic Pursuits Recipes for Hard Thresholding Methods"},{"key":"11","author":"nesterov","year":"1996","journal-title":"Introductory Lectures on Convex Optimization"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2011.6136024"},{"key":"3","author":"candes","year":"2009","journal-title":"Robust principal component analysis?"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"10","article-title":"Guaranteed rank minimization via singular value projection","author":"meka","year":"2010","journal-title":"NIPS"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054251"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"5","article-title":"Sparcs: Recovering low-rank and sparse matrices from com-pressive measurements","author":"waters","year":"2011","journal-title":"NIPS"},{"key":"4","article-title":"Godec: Randomized low-rank & sparse matrix decomposition in noisy case","author":"zhou","year":"2011","journal-title":"ICML"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"8","article-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"wu","year":"0","journal-title":"UIUC Technical Report UILU-ENG-09-2215"}],"event":{"name":"2012 IEEE Statistical Signal Processing Workshop (SSP)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2012,8,5]]},"end":{"date-parts":[[2012,8,8]]}},"container-title":["2012 IEEE Statistical Signal Processing Workshop (SSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6310431\/6319629\/06319655.pdf?arnumber=6319655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T17:27:46Z","timestamp":1563038866000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6319655\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ssp.2012.6319655","relation":{},"subject":[],"published":{"date-parts":[[2012,8]]}}}