{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T02:51:13Z","timestamp":1791341473035,"version":"4.3.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/tit.2010.2046205","type":"journal-article","created":{"date-parts":[[2010,5,27]],"date-time":"2010-05-27T10:37:19Z","timestamp":1274956639000},"page":"2980-2998","source":"Crossref","is-referenced-by-count":692,"title":["Matrix Completion From a Few Entries"],"prefix":"10.1109","volume":"56","author":[{"given":"Raghunandan H.","family":"Keshavan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sewoong","family":"Oh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","author":"toh","year":"2009","journal-title":"An Accelerated Proximal Gradient Algorithm for Nuclear Norm Regularized Least Squares Problems"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1017\/S096354830000420X"},{"key":"ref31","author":"singer","year":"2009","journal-title":"Uniqueness of Low-Rank Matrix Completion by Rigidity Theory"},{"key":"ref30","author":"recht","year":"2007","journal-title":"Guaranteed Minimum Rank Solutions of Matrix Equations via Nuclear Norm Minimization"},{"key":"ref34","author":"wang","year":"2006","journal-title":"Further Relaxations of the sdp Approach to Sensor Network Localization Tech Rep"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.52"},{"key":"ref12","author":"cands","year":"2009","journal-title":"The power of convex relaxation Near-optimal matrix completion"},{"key":"ref13","author":"dai","year":"2009","journal-title":"Set An Algorithm for Consistent Matrix Completion"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895290954"},{"key":"ref16","author":"fazel","year":"2002","journal-title":"Matrix Rank Minimization With Applications"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73063"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039494"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20089"},{"key":"ref28","author":"meka","year":"2009","journal-title":"Guaranteed rank minimization via singular value projection"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347035"},{"key":"ref27","author":"mazumder","year":"2009","journal-title":"Spectral Regularization Algorithms for Learning Large Incomplete Matrices"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.1"},{"key":"ref6","author":"bollobs","year":"1979","journal-title":"Graph Theory an Introductory Course"},{"key":"ref29","year":"0"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1177\/109434209200600103","article-title":"large scale sparse singular value computations","volume":"6","author":"berry","year":"1992","journal-title":"Int J Supercomput Appl"},{"key":"ref8","author":"cands","year":"2009","journal-title":"Matrix Completion with Noise"},{"key":"ref7","author":"cai","year":"2008","journal-title":"A Singular Value Thresholding Algorithm for Matrix Completion"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1219092.1219097"},{"key":"ref9","author":"cands","year":"2008","journal-title":"Exact Matrix Completion Via Convex Optimization"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380859"},{"key":"ref20","article-title":"learning low rank matrices from <formula formulatype=\"inline\"><tex notation=\"tex\">$o(n)$<\/tex><\/formula> entries","author":"keshavan","year":"2008","journal-title":"Allerton Conf on Communication Control and Computing"},{"key":"ref22","author":"keshavan","year":"2009","journal-title":"Matrix completion from noisy entries"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205567"},{"key":"ref24","author":"lee","year":"2009","journal-title":"Admira Atomic Decomposition for Minimum Rank Approximation"},{"key":"ref23","author":"keshavan","year":"2009","journal-title":"A Gradient Descent Algorithm on the Grassmann Manifold for Matrix Completion"},{"key":"ref26","author":"ma","year":"2009","journal-title":"Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization"},{"key":"ref25","first-page":"151","article-title":"on the equivalence of two basic models of random graphs","author":"luczak","year":"1990","journal-title":"Proc 3rd Int Seminar on Random Graphs and Probabilistic Methods in Combinatorics"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5466507\/05466511.pdf?arnumber=5466511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T21:01:06Z","timestamp":1633899666000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5466511\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":34,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2046205","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}