{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T15:55:35Z","timestamp":1772294135789,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1109\/allerton.2009.5394884","type":"proceedings-article","created":{"date-parts":[[2010,1,26]],"date-time":"2010-01-26T17:35:50Z","timestamp":1264527350000},"page":"1013-1020","source":"Crossref","is-referenced-by-count":11,"title":["Solving low-rank matrix completion problems efficiently"],"prefix":"10.1109","author":[{"given":"Donald","family":"Goldfarb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiqian","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zaiwen","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Convergence of fixed point continuation algorithms for matrix rank minimization","author":"goldfarb","year":"2009","journal-title":"Tech Report"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00074-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/070698920"},{"key":"ref13","author":"ma","year":"2009","journal-title":"Fixed point and Bregman iterative methods for matrix rank minimization to appear in Math Program A"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584660"},{"key":"ref15","author":"recht","year":"2007","journal-title":"Guaranteed Minimum Rank Solutions of Matrix Equations via Nuclear Norm Minimization"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.97"},{"key":"ref17","author":"srebro","year":"2004","journal-title":"Learning with Matrix Factorization"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","article-title":"Solving semidefinite-quadratic-linear programs using SDPT3","volume":"95","author":"t\u00fct\u00fcnc\u00fc","year":"2003","journal-title":"Mathematical Programming Series B"},{"key":"ref19","article-title":"Row by row methods for semidefinite programming","author":"wen","year":"2009","journal-title":"Tech Report"},{"key":"ref4","author":"cai","year":"2008","journal-title":"A Singular Value Thresholding Algorithm for Matrix Completion"},{"key":"ref3","author":"borwein","year":"2003","journal-title":"Convex Analysis and Nonlinear Optimization"},{"key":"ref6","author":"candes","year":"2009","journal-title":"The power of convex relaxation Near-optimal matrix completion"},{"key":"ref5","author":"candes","year":"2009","journal-title":"Exact Matrix Completion Via Convex Optimization"},{"key":"ref8","author":"fazel","year":"2002","journal-title":"Matrix Rank Minimization With Applications"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442696"},{"key":"ref2","article-title":"Constrained optimization and Lagrange multiplier methods","author":"bertsekas","year":"1982","journal-title":"Computer Science and Applied Mathematics"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0339-5"},{"key":"ref9","author":"fletcher","year":"1987","journal-title":"Practical Methods of Optimization"},{"key":"ref20","article-title":"Alternating direction methods for nuclear norm minimization","author":"wen","year":"2009"}],"event":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2009,9,30]]},"end":{"date-parts":[[2009,10,2]]}},"container-title":["2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5375733\/5394483\/05394884.pdf?arnumber=5394884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T04:06:24Z","timestamp":1497845184000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5394884\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/allerton.2009.5394884","relation":{},"subject":[],"published":{"date-parts":[[2009,9]]}}}