{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:05:44Z","timestamp":1730196344997,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1109\/allerton.2012.6483329","type":"proceedings-article","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T20:58:45Z","timestamp":1364417925000},"page":"1010-1017","source":"Crossref","is-referenced-by-count":0,"title":["Low rank matrix completion: A smoothed l&lt;inf&gt;0&lt;\/inf&gt;-search"],"prefix":"10.1109","author":[{"given":"Guangyu","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochen","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Numerical Optimization (2nd Edition)","year":"2006","author":"nocedal","key":"13"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.277"},{"journal-title":"Low-rank Matrix Completion with Smoothed ?0-search","year":"0","author":"guangyu zhou","key":"12"},{"key":"3","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 Optimiz"},{"journal-title":"Robust principal component analysis?","year":"2009","author":"cande?s","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"journal-title":"Rtrmc A Riemannian Trust-region Method for Low-rank Matrix Completion","year":"2011","author":"boumal","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2018223"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2171521"},{"journal-title":"Guaranteed rank minimization via singular value projection","year":"2009","author":"meka","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054251"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2144977"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"}],"event":{"name":"2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2012,10,1]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2012,10,5]]}},"container-title":["2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6475439\/6483185\/06483329.pdf?arnumber=6483329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T02:29:57Z","timestamp":1490236197000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6483329\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/allerton.2012.6483329","relation":{},"subject":[],"published":{"date-parts":[[2012,10]]}}}