{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T08:49:02Z","timestamp":1778057342049,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10107-012-0540-0","type":"journal-article","created":{"date-parts":[[2012,4,30]],"date-time":"2012-04-30T04:05:04Z","timestamp":1335758704000},"page":"577-589","source":"Crossref","is-referenced-by-count":54,"title":["Simple bounds for recovering low-complexity models"],"prefix":"10.1007","volume":"141","author":[{"given":"Emmanuel","family":"Cand\u00e8s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Recht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,1]]},"reference":[{"key":"540_CR1","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66(4), 671\u2013687 (2003). Special issue of invited papers from PODS\u201901"},{"issue":"6","key":"540_CR2","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E. Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s E., Recht B.: Exact matrix completion via convex optimization. Found. Comut. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comut. Math."},{"issue":"4","key":"540_CR3","doi-asserted-by":"crossref","first-page":"2342","DOI":"10.1109\/TIT.2011.2111771","volume":"57","author":"E.J. Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s E.J., Plan Y.: Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements. IEEE Trans. Inf. Theory 57(4), 2342\u20132359 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"540_CR4","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s E.J., Romberg J., Tao T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"540_CR5","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, V., Recht, B., Parrilo, P.A., Willsky, A.: The convex geometry of linear inverse problems. Submitted for publication. Preprint available at arxiv.org\/1012.0621 (2010)","DOI":"10.1109\/ALLERTON.2010.5706975"},{"key":"540_CR6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S1874-5849(01)80010-3","volume-title":"Handbook on the Geometry of Banach Spaces","author":"K.R. Davidson","year":"2001","unstructured":"Davidson K.R., Szarek S.J.: Local operator theory, random matrices and Banach spaces. In: Johnson, W.B., Lindenstrauss, J. (eds.) Handbook on the Geometry of Banach Spaces, pp. 317\u2013366. Elsevier, Amsterdam (2001)"},{"issue":"1","key":"540_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0894-0347-08-00600-0","volume":"22","author":"D. Donoho","year":"2009","unstructured":"Donoho D., Tanner J.: Counting faces of randomly-projected polytopes when the projection radically lowers dimension. J. Am. Math. Soc. 22(1), 1\u201353 (2009)","journal-title":"J. Am. Math. Soc."},{"issue":"4","key":"540_CR8","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D.L. Donoho","year":"2006","unstructured":"Donoho D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"540_CR9","doi-asserted-by":"crossref","unstructured":"Eldar, Y.C., Bolcskei, H.: Block-sparsity: coherence and efficient recovery. In: ICASSP, The International Conference on Acoustics, Signal and Speech Processing (2009)","DOI":"10.1109\/ICASSP.2009.4960226"},{"key":"540_CR10","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1109\/TIT.2004.828141","volume":"50","author":"J.J. Fuchs","year":"2004","unstructured":"Fuchs J.J.: On sparse representations in arbitrary redundant bases. IEEE Trans. Inf. Theory 50, 1341\u20131344 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"540_CR11","first-page":"84","volume-title":"Geometric Aspects of Functional Analysis, Lecture Notes in Mathematics, vol. 1317","author":"Y. Gordon","year":"1988","unstructured":"Gordon Y.: On Milman\u2019s inequality and random subspaces which escape through a mesh in $${\\mathbb{R}^n}$$ . In: Lindenstrauss, J., Milman, V.D. (eds.) Geometric Aspects of Functional Analysis, Lecture Notes in Mathematics, vol. 1317, pp. 84\u2013106. Springer, Berlin (1988)"},{"issue":"301","key":"540_CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"issue":"5","key":"540_CR13","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1214\/aos\/1015957395","volume":"28","author":"B. Laurent","year":"2000","unstructured":"Laurent B., Massart P.: Adaptive estimation of a quadratic functional by model selection. Ann. Stat. 28(5), 1302\u20131338 (2000)","journal-title":"Ann. Stat."},{"key":"540_CR14","volume-title":"Multivariate Analysis","author":"K.V. Mardia","year":"1979","unstructured":"Mardia K.V., Kent J.T., Bibby J.M.: Multivariate Analysis. Academic Press, London (1979)"},{"key":"540_CR15","unstructured":"Negahban, S., Ravikumar, P., Wainwright, M.J., Yu, B.: A unified framework for high-dimensional analysis of m-estimators with decomposable regularizers. In: Advances in Neural Information Processing Systems, conference proceedings (2009)"},{"key":"540_CR16","unstructured":"Oymak, S., Hassibi, B.: New null space results and recovery thresholds for matrix rank minimization. Submitted for publication. Preprint available at arxiv.org\/abs\/1011.6326 (2010)"},{"key":"540_CR17","doi-asserted-by":"crossref","unstructured":"Parvaresh, F., Hassibi, B.: Explicit measurements with almost optimal thresholds for compressed sensing. In: ICASSP, The International Conference on Acoustics, Signal and Speech Processing, C (2008)","DOI":"10.1109\/ICASSP.2008.4518494"},{"key":"540_CR18","unstructured":"Rao, N., Recht, B., Nowak,R.: Universal measurement bounds for structured sparse signal recovery. In: Proceedings of AISTATS (2012)"},{"issue":"3","key":"540_CR19","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B. Recht","year":"2010","unstructured":"Recht B., Fazel M., Parrilo P.: Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"540_CR20","unstructured":"Stojnic, M.: Various thresholds for \u2113 1-optimization in compressed sensing. Preprint available at arxiv.org\/abs\/0907.3666 (2009)"},{"key":"540_CR21","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices. In: Eldar, Y.C., Kutyniok, G. (eds.) Compressed Sensing: Theory and Applications. Cambridge University Press, Cambridge. To appear. Preprint available at http:\/\/www-personal.umich.edu\/~romanv\/papers\/papers.html"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0540-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0540-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0540-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T02:18:42Z","timestamp":1561688322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0540-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,1]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["540"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0540-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,1]]}}}