{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:07:25Z","timestamp":1761059245398,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033977","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"2323-2327","source":"Crossref","is-referenced-by-count":4,"title":["Tight recovery thresholds and robustness analysis for nuclear norm minimization"],"prefix":"10.1109","author":[{"given":"Samet","family":"Oymak","sequence":"first","affiliation":[]},{"given":"Babak","family":"Hassibi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-012-9135-7"},{"key":"ref11","article-title":"New Null Space Results and Recovery Thresholds for Matrix Rank Minimization","author":"oymak","year":"0","journal-title":"available at arXiv 1011 6326v1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20212-4"},{"key":"ref13","first-page":"1317","article-title":"On Milmans inequality and random subspaces which escape through a mesh in ${\\BBR}^{n}$","author":"gordon","year":"1988","journal-title":"Geometric Aspect of Functional Analysis Isr Semin 198687 Lect Notes Math"},{"key":"ref14","article-title":"Random matrices, free probability, and the replica method","author":"m\u00fcller","year":"2004","journal-title":"Proceedings of European Signal Processing Conference"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"ref16","article-title":"Various thresholds for $\\ell_{1}$-optimization in compressed sensing","author":"stojnic","year":"0","journal-title":"available at arXiv 0907 3666v1"},{"key":"ref17","article-title":"Block-length dependent thresholds in block-sparse compressed sensing","author":"stojnic","year":"0","journal-title":"available at arXiv 0907 3666v1"},{"key":"ref18","article-title":"Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements","author":"cand\u00e8s","year":"0","journal-title":"available at arXiv 1001 0339v1"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"303306","DOI":"10.1007\/BF01647331","article-title":"A trace inequality of John von Neumann","volume":"79","author":"mirsky","year":"1975","journal-title":"Monatsh Math"},{"article-title":"Matrix rank minimization with applications","year":"2002","author":"fazel","key":"ref4"},{"key":"ref3","article-title":"Thresholds for the Recovery of Sparse Solutions via $\\ell_{1}$ Minimization","author":"donoho","year":"2006","journal-title":"Proc Conf on Information Sciences and Systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5947726"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2003.1243393"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref7","article-title":"Rank Minimization and Applications in System Theory","author":"fazel","year":"0","journal-title":"Proc American Control Conference"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0422-2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref20","article-title":"Matrix Analysis","volume":"169","author":"bhatia","year":"1996","journal-title":"Graduate Texts in Mathematics"},{"key":"ref21","article-title":"On Sharp Performance Bounds for Robust Sparse Signal Recoveries","author":"xu","year":"2009","journal-title":"Proceedings of the International Symposium on Information Theory"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033977.pdf?arnumber=6033977","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T07:35:38Z","timestamp":1497944138000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033977\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033977","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}