{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T13:49:05Z","timestamp":1781531345126,"version":"3.54.5"},"reference-count":35,"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":["Proc. IEEE"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/jproc.2009.2035722","type":"journal-article","created":{"date-parts":[[2010,4,30]],"date-time":"2010-04-30T18:49:47Z","timestamp":1272653387000},"page":"925-936","source":"Crossref","is-referenced-by-count":1185,"title":["Matrix Completion With Noise"],"prefix":"10.1109","volume":"98","author":[{"given":"Emmanuel J","family":"Candes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yaniv","family":"Plan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF00129684"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/090750688"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0709842104"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.1986.1143830"},{"key":"ref35","article-title":"matrix completion for doa estimation","author":"weng","year":"0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2002.1003065"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref13","article-title":"the dantzig selector: statistical estimation when <ref_formula><tex notation=\"tex\">$p$<\/tex><\/ref_formula> is much larger than <ref_formula><tex notation=\"tex\">$n$<\/tex><\/ref_formula>","volume":"35","author":"cands","year":"2007","journal-title":"Ann Statist"},{"key":"ref14","author":"cands","year":"2009","journal-title":"The power of convex relaxation Near-optimal matrix completion"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.52"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030287"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20132"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00600-0"},{"key":"ref19","author":"fazel","year":"2002","journal-title":"Matrix Rank Minimization With Applications"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/9.554402"},{"key":"ref4","article-title":"multi-task feature learning","author":"argyriou","year":"2007","journal-title":"Neural Inf Process Syst"},{"key":"ref27","author":"ma","year":"2008","journal-title":"Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273499"},{"key":"ref6","article-title":"computational study and comparisons of lft reducibility methods","author":"beck","year":"1998","journal-title":"Proc Amer Contr Conf"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380859"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1149283.1149286"},{"key":"ref2","volume":"25","year":"2008","journal-title":"IEEE Signal Processing Mag (Special Issue on Sensing Sampling and Compression)"},{"key":"ref9","author":"cai","year":"2008","journal-title":"A Singular Value Thresholding Algorithm for Matrix Completion"},{"key":"ref1","year":"0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074571"},{"key":"ref22","article-title":"improved time bounds for near-optimal sparse fourier representation","author":"gilbert","year":"2005","journal-title":"Proc Wavelets XI SPIE Opt Photon"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2003.1243393"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205567"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref25","author":"keshavan","year":"2009","journal-title":"Matrix completion from noisy entries"}],"container-title":["Proceedings of the IEEE"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5\/5466592\/05454406.pdf?arnumber=5454406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:00:23Z","timestamp":1633914023000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5454406\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":35,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/jproc.2009.2035722","relation":{},"ISSN":["0018-9219","1558-2256"],"issn-type":[{"value":"0018-9219","type":"print"},{"value":"1558-2256","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}