{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T02:00:40Z","timestamp":1775181640291,"version":"3.50.1"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T00:00:00Z","timestamp":1444089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10208-015-9278-4","type":"journal-article","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T15:38:23Z","timestamp":1444145903000},"page":"965-1029","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Sharp MSE Bounds for Proximal Denoising"],"prefix":"10.1007","volume":"16","author":[{"given":"Samet","family":"Oymak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Babak","family":"Hassibi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,6]]},"reference":[{"issue":"2","key":"9278_CR1","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1214\/12-AOS1000","volume":"40","author":"A Agarwal","year":"2012","unstructured":"A. Agarwal, S. Negahban, M. J. Wainwright, et al. Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions. The Annals of Statistics, 40(2):1171\u20131197, 2012.","journal-title":"The Annals of Statistics"},{"key":"9278_CR2","doi-asserted-by":"crossref","unstructured":"D. Amelunxen, M. Lotz, M. B. McCoy, and J. A. Tropp. Living on the edge: Phase transitions in convex programs with random data. Inform. Inference, 2014.","DOI":"10.1093\/imaiai\/iau005"},{"key":"9278_CR3","unstructured":"F. R. Bach. Structured sparsity-inducing norms through submodular functions. In Advances in Neural Information Processing Systems, pages 118\u2013126, 2010."},{"key":"9278_CR4","unstructured":"A. Banerjee, S. Chen, F. Fazayeli, and V. Sivakumar. Estimation with norm regularization. In Advances in Neural Information Processing Systems, pages 1556\u20131564, 2014."},{"issue":"4","key":"9278_CR5","doi-asserted-by":"crossref","first-page":"1982","DOI":"10.1109\/TIT.2010.2040894","volume":"56","author":"RG Baraniuk","year":"2010","unstructured":"R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde. Model-based compressive sensing. Information Theory, IEEE Transactions on, 56(4):1982\u20132001, 2010.","journal-title":"Information Theory, IEEE Transactions on"},{"key":"9278_CR6","unstructured":"M. Bayati, M. Lelarge, and A. Montanari. Universality in polytope phase transitions and message passing algorithms. arXiv preprint\u00a0 arXiv:1207.7321 , 2012."},{"issue":"2","key":"9278_CR7","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1109\/TIT.2010.2094817","volume":"57","author":"M Bayati","year":"2011","unstructured":"M. Bayati and A. Montanari. The dynamics of message passing on dense graphs, with applications to compressed sensing. Information Theory, IEEE Transactions on, 57(2):764\u2013785, 2011.","journal-title":"Information Theory, IEEE Transactions on"},{"issue":"4","key":"9278_CR8","doi-asserted-by":"crossref","first-page":"1997","DOI":"10.1109\/TIT.2011.2174612","volume":"58","author":"M Bayati","year":"2012","unstructured":"M. Bayati and A. Montanari. The lasso risk for gaussian matrices. Information Theory, IEEE Transactions on, 58(4):1997\u20132017, 2012.","journal-title":"Information Theory, IEEE Transactions on"},{"issue":"4","key":"9278_CR9","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1093\/biomet\/asr043","volume":"98","author":"A Belloni","year":"2011","unstructured":"A. Belloni, V. Chernozhukov, and L. Wang. Square-root lasso: pivotal recovery of sparse signals via conic programming. Biometrika, 98(4):791\u2013806, 2011.","journal-title":"Biometrika"},{"key":"9278_CR10","volume-title":"Convex analysis and optimization","author":"DP Bertsekas","year":"2003","unstructured":"D. P. Bertsekas, A. Nedi\u0107, and A. E. Ozdaglar. Convex analysis and optimization. Athena Scientific, Belmont, 2003."},{"issue":"23","key":"9278_CR11","doi-asserted-by":"crossref","first-page":"5987","DOI":"10.1109\/TSP.2013.2273443","volume":"61","author":"BN Bhaskar","year":"2013","unstructured":"B. N. Bhaskar, G. Tang, and B. Recht. Atomic norm denoising with applications to line spectral estimation. Signal Processing, IEEE Transactions on, 61(23):5987\u20135999, 2013.","journal-title":"Signal Processing, IEEE Transactions on"},{"key":"9278_CR12","doi-asserted-by":"crossref","unstructured":"P. J. Bickel, Y. Ritov, and A. B. Tsybakov. Simultaneous analysis of lasso and dantzig selector. The Annals of Statistics, pages 1705\u20131732, 2009.","DOI":"10.1214\/08-AOS620"},{"key":"9278_CR13","doi-asserted-by":"crossref","DOI":"10.1090\/surv\/062","volume-title":"Gaussian measures","author":"VI Bogachev","year":"1998","unstructured":"V. I. Bogachev. Gaussian measures. American Mathematical Society, Providence 1998."},{"key":"9278_CR14","volume-title":"Convex optimization","author":"S Boyd","year":"2009","unstructured":"S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, Cambridge 2009."},{"key":"9278_CR15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1214\/07-EJS008","volume":"1","author":"F Bunea","year":"2007","unstructured":"F. Bunea, A. Tsybakov, M. Wegkamp, et al. Sparsity oracle inequalities for the lasso. Electronic Journal of Statistics, 1:169\u2013194, 2007.","journal-title":"Electronic Journal of Statistics"},{"issue":"4","key":"9278_CR16","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"J.-F. Cai, E. J. Cand\u00e8s, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4):1956\u20131982, 2010.","journal-title":"SIAM Journal on Optimization"},{"key":"9278_CR17","unstructured":"J.-F. Cai and W. Xu. Guarantees of total variation minimization for signal recovery. arXiv preprint\u00a0 arXiv:1301.6791 , 2013."},{"key":"9278_CR18","unstructured":"T. T. Cai, T. Liang, and A. Rakhlin. Geometrizing local rates of convergence for linear inverse problems. arXiv preprint\u00a0 arXiv:1404.4408 , 2014."},{"issue":"1\u20132","key":"9278_CR19","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/s10107-012-0540-0","volume":"141","author":"E Cand\u00e8s","year":"2013","unstructured":"E. Cand\u00e8s and B. Recht. Simple bounds for recovering low-complexity models. Mathematical Programming, 141(1-2):577\u2013589, 2013.","journal-title":"Mathematical Programming"},{"issue":"3","key":"9278_CR20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"E. J. Cand\u00e8s, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? Journal of the ACM (JACM), 58(3):11, 2011.","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"9278_CR21","doi-asserted-by":"crossref","first-page":"2342","DOI":"10.1109\/TIT.2011.2111771","volume":"57","author":"EJ Candes","year":"2011","unstructured":"E. J. Candes and Y. Plan. Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. Information Theory, IEEE Transactions on, 57(4):2342\u20132359, 2011.","journal-title":"Information Theory, IEEE Transactions on"},{"issue":"6","key":"9278_CR22","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"E. J. Cand\u00e8s and B. Recht. Exact matrix completion via convex optimization. Foundations of Computational mathematics, 9(6):717\u2013772, 2009.","journal-title":"Foundations of Computational mathematics"},{"issue":"2","key":"9278_CR23","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"E. J. Cand\u00e8s, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. Information Theory, IEEE Transactions on, 52(2):489\u2013509, 2006.","journal-title":"Information Theory, IEEE Transactions on"},{"issue":"8","key":"9278_CR24","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Candes","year":"2006","unstructured":"E. J. Candes, J. K. Romberg, and T. Tao. Stable signal recovery from incomplete and inaccurate measurements. Communications on pure and applied mathematics, 59(8):1207\u20131223, 2006.","journal-title":"Communications on pure and applied mathematics"},{"issue":"5\u20136","key":"9278_CR25","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Candes","year":"2008","unstructured":"E. J. Candes, M. B. Wakin, and S. P. Boyd. Enhancing sparsity by reweighted $$\\ell _1$$ \u2113 1 minimization. Journal of Fourier analysis and applications, 14(5-6):877\u2013905, 2008.","journal-title":"Journal of Fourier analysis and applications"},{"issue":"13","key":"9278_CR26","doi-asserted-by":"crossref","first-page":"E1181","DOI":"10.1073\/pnas.1302293110","volume":"110","author":"V Chandrasekaran","year":"2013","unstructured":"V. Chandrasekaran and M. I. Jordan. Computational and statistical tradeoffs via convex relaxation. Proceedings of the National Academy of Sciences, 110(13):E1181\u2013E1190, 2013.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"6","key":"9278_CR27","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s10208-012-9135-7","volume":"12","author":"V Chandrasekaran","year":"2012","unstructured":"V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky. The convex geometry of linear inverse problems. Foundations of Computational Mathematics, 12(6):805\u2013849, 2012.","journal-title":"Foundations of Computational Mathematics"},{"key":"9278_CR28","doi-asserted-by":"crossref","unstructured":"S. Chen and D. L. Donoho. Examples of basis pursuit. In SPIE\u2019s 1995 International Symposium on Optical Science, Engineering, and Instrumentation, pages 564\u2013574. International Society for Optics and Photonics, 1995.","DOI":"10.1117\/12.217610"},{"key":"9278_CR29","doi-asserted-by":"crossref","unstructured":"P. L. Combettes and J.-C. Pesquet. Proximal splitting methods in signal processing. In Fixed-point algorithms for inverse problems in science and engineering, pages 185\u2013212. Springer, Berlin 2011.","DOI":"10.1007\/978-1-4419-9569-8_10"},{"issue":"4","key":"9278_CR30","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"P. L. Combettes and V. R. Wajs. Signal recovery by proximal forward-backward splitting. Multiscale Modeling & Simulation, 4(4):1168\u20131200, 2005.","journal-title":"Multiscale Modeling & Simulation"},{"key":"9278_CR31","unstructured":"D. Donoho, I. Johnstone, and A. Montanari. Accurate prediction of phase transitions in compressed sensing via a connection to minimax denoising. arXiv preprint\u00a0 arXiv:1111.1041 , 2011."},{"issue":"1906","key":"9278_CR32","doi-asserted-by":"crossref","first-page":"4273","DOI":"10.1098\/rsta.2009.0152","volume":"367","author":"D Donoho","year":"2009","unstructured":"D. Donoho and J. Tanner. Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 367(1906):4273\u20134293, 2009.","journal-title":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences"},{"issue":"3","key":"9278_CR33","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/18.382009","volume":"41","author":"DL Donoho","year":"1995","unstructured":"D. L. Donoho. De-noising by soft-thresholding. Information Theory, IEEE Transactions on, 41(3):613\u2013627, 1995.","journal-title":"Information Theory, IEEE Transactions on"},{"issue":"4","key":"9278_CR34","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"D. L. Donoho. Compressed sensing. Information Theory, IEEE Transactions on, 52(4):1289\u20131306, 2006.","journal-title":"Information Theory, IEEE Transactions on"},{"issue":"4","key":"9278_CR35","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s00454-005-1220-0","volume":"35","author":"DL Donoho","year":"2006","unstructured":"D. L. Donoho. High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension. Discrete & Computational Geometry, 35(4):617\u2013652, 2006.","journal-title":"Discrete & Computational Geometry"},{"key":"9278_CR36","unstructured":"D. L. Donoho and M. Gavish. Minimax risk of matrix denoising by singular value thresholding. arXiv preprint\u00a0 arXiv:1304.2085 , 2013."},{"issue":"21","key":"9278_CR37","doi-asserted-by":"crossref","first-page":"8405","DOI":"10.1073\/pnas.1306110110","volume":"110","author":"DL Donoho","year":"2013","unstructured":"D. L. Donoho, M. Gavish, and A. Montanari. The phase transition of matrix recovery from gaussian measurements matches the minimax mse of matrix denoising. Proceedings of the National Academy of Sciences, 110(21):8405\u20138410, 2013.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"45","key":"9278_CR38","doi-asserted-by":"crossref","first-page":"18914","DOI":"10.1073\/pnas.0909892106","volume":"106","author":"DL Donoho","year":"2009","unstructured":"D. L. Donoho, A. Maleki, and A. Montanari. Message-passing algorithms for compressed sensing. Proceedings of the National Academy of Sciences, 106(45):18914\u201318919, 2009.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"10","key":"9278_CR39","doi-asserted-by":"crossref","first-page":"6920","DOI":"10.1109\/TIT.2011.2165823","volume":"57","author":"DL Donoho","year":"2011","unstructured":"D. L. Donoho, A. Maleki, and A. Montanari. The noise-sensitivity phase transition in compressed sensing. Information Theory, IEEE Transactions on, 57(10):6920\u20136941, 2011.","journal-title":"Information Theory, IEEE Transactions on"},{"issue":"27","key":"9278_CR40","doi-asserted-by":"crossref","first-page":"9452","DOI":"10.1073\/pnas.0502258102","volume":"102","author":"DL Donoho","year":"2005","unstructured":"D. L. Donoho and J. Tanner. Neighborliness of randomly projected simplices in high dimensions. Proceedings of the National Academy of Sciences of the United States of America, 102(27):9452\u20139457, 2005.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"9278_CR41","doi-asserted-by":"crossref","unstructured":"D. L. Donoho and J. Tanner. Thresholds for the recovery of sparse solutions via l1 minimization. In Information Sciences and Systems, 2006 40th Annual Conference on, pages 202\u2013206. IEEE, 2006.","DOI":"10.1109\/CISS.2006.286462"},{"issue":"6","key":"9278_CR42","doi-asserted-by":"crossref","first-page":"3042","DOI":"10.1109\/TSP.2010.2044837","volume":"58","author":"YC Eldar","year":"2010","unstructured":"Y. C. Eldar, P. Kuppinger, and H. Bolcskei. Block-sparse signals: Uncertainty relations and efficient recovery. Signal Processing, IEEE Transactions on, 58(6):3042\u20133054, 2010.","journal-title":"Signal Processing, IEEE Transactions on"},{"key":"9278_CR43","unstructured":"M. Fazel. Matrix rank minimization with applications. PhD thesis, Stanford University, 2002."},{"issue":"2","key":"9278_CR44","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1109\/TIT.2013.2293654","volume":"60","author":"R Foygel","year":"2014","unstructured":"R. Foygel and L. Mackey. Corrupted sensing: Novel guarantees for separating structured signals. Information Theory, IEEE Transactions on, 60(2):1223\u20131247, 2014.","journal-title":"Information Theory, IEEE Transactions on"},{"key":"9278_CR45","doi-asserted-by":"crossref","unstructured":"Y. Gordon. On Milman\u2019s inequality and random subspaces which escape through a mesh in $${\\mathbb{R}}^n$$ R n . Springer, Berlin 1988.","DOI":"10.1007\/BFb0081737"},{"issue":"2","key":"9278_CR46","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0329022","volume":"29","author":"O G\u00fcler","year":"1991","unstructured":"O. G\u00fcler. On the convergence of the proximal point algorithm for convex minimization. SIAM Journal on Control and Optimization, 29(2):403\u2013419, 1991.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"9278_CR47","unstructured":"E. T. Hale, W. Yin, and Y. Zhang. A fixed-point continuation method for l1-regularized minimization with applications to compressed sensing. CAAM TR07-07, Rice University, 2007."},{"key":"9278_CR48","volume-title":"Convex Analysis and Minimization Algorithms I: Part 1: Fundamentals","author":"J-B Hiriart-Urruty","year":"1996","unstructured":"J.-B. Hiriart-Urruty and C. Lemar\u00e9chal. Convex Analysis and Minimization Algorithms I: Part 1: Fundamentals, volume 305. Springer, Berlin 1996."},{"key":"9278_CR49","unstructured":"R. Jenatton, J. Mairal, F. R. Bach, and G. R. Obozinski. Proximal methods for sparse hierarchical dictionary learning. In Proceedings of the 27th International Conference on Machine Learning (ICML-10), pages 487\u2013494, 2010."},{"issue":"1","key":"9278_CR50","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1109\/TSP.2010.2082536","volume":"59","author":"MA Khajehnejad","year":"2011","unstructured":"M. A. Khajehnejad, A. G. Dimakis, W. Xu, and B. Hassibi. Sparse recovery of nonnegative signals with minimal expansion. Signal Processing, IEEE Transactions on, 59(1):196\u2013208, 2011.","journal-title":"Signal Processing, IEEE Transactions on"},{"key":"9278_CR51","doi-asserted-by":"crossref","unstructured":"M. A. Khajehnejad, W. Xu, A. S. Avestimehr, and B. Hassibi. Weighted $$\\ell _1$$ \u2113 1 minimization for sparse recovery with prior information. In Information Theory, 2009. ISIT 2009. IEEE International Symposium on, pages 483\u2013487. IEEE, 2009.","DOI":"10.1109\/ISIT.2009.5205716"},{"issue":"5","key":"9278_CR52","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1214\/11-AOS894","volume":"39","author":"V Koltchinskii","year":"2011","unstructured":"V. Koltchinskii, K. Lounici, A. B. Tsybakov, et al. Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. The Annals of Statistics, 39(5):2302\u20132329, 2011.","journal-title":"The Annals of Statistics"},{"key":"9278_CR53","doi-asserted-by":"crossref","DOI":"10.1090\/surv\/089","volume-title":"The concentration of measure phenomenon","author":"M Ledoux","year":"2005","unstructured":"M. Ledoux. The concentration of measure phenomenon, volume 89. American Mathematical Society, Providence, 2005."},{"key":"9278_CR54","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20212-4","volume-title":"Probability in Banach Spaces: isoperimetry and processes","author":"M Ledoux","year":"1991","unstructured":"M. Ledoux and M. Talagrand. Probability in Banach Spaces: isoperimetry and processes, volume 23. Springer, Berlin 1991."},{"key":"9278_CR55","first-page":"2897","volume":"255","author":"J-J Moreau","year":"1962","unstructured":"J.-J. Moreau. Fonctions convexes duales et points proximaux dans un espace hilbertien. CR Acad. Sci. Paris S\u00e9r. A Math, 255:2897\u20132899, 1962.","journal-title":"CR Acad. Sci. Paris S\u00e9r. A Math"},{"issue":"2","key":"9278_CR56","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/120868281","volume":"6","author":"D Needell","year":"2013","unstructured":"D. Needell and R. Ward. Stable image reconstruction using total variation minimization. SIAM Journal on Imaging Sciences, 6(2):1035\u20131058, 2013.","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"9278_CR57","unstructured":"S. Negahban, B. Yu, M. J. Wainwright, and P. K. Ravikumar. A unified framework for high-dimensional analysis of $$ m $$ m -estimators with decomposable regularizers. In Advances in Neural Information Processing Systems, pages 1348\u20131356, 2009."},{"key":"9278_CR58","unstructured":"S. Oymak and B. Hassibi. New null space results and recovery thresholds for matrix rank minimization. arXiv preprint\u00a0 arXiv:1011.6326 , 2010."},{"key":"9278_CR59","doi-asserted-by":"crossref","unstructured":"S. Oymak and B. Hassibi. Tight recovery thresholds and robustness analysis for nuclear norm minimization. In Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, pages 2323\u20132327. IEEE, 2011.","DOI":"10.1109\/ISIT.2011.6033977"},{"key":"9278_CR60","unstructured":"S. Oymak, A. Jalali, M. Fazel, Y. C. Eldar, and B. Hassibi. Simultaneously structured models with application to sparse and low-rank matrices. arXiv preprint\u00a0 arXiv:1212.3753 , 2012."},{"key":"9278_CR61","unstructured":"S. Oymak, C. Thrampoulidis, and B. Hassibi. The squared-error of generalized lasso: A precise analysis. arXiv preprint\u00a0 arXiv:1311.0830 , 2013."},{"issue":"3","key":"9278_CR62","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"N. Parikh and S. Boyd. Proximal algorithms. Foundations and Trends in optimization, 1(3):123\u2013231, 2013.","journal-title":"Foundations and Trends in optimization"},{"key":"9278_CR63","unstructured":"N. Rao, B. Recht, and R. Nowak. Tight measurement bounds for exact recovery of structured sparse signals. arXiv preprint\u00a0 arXiv:1106.4355 , 2011."},{"issue":"3","key":"9278_CR64","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"B. Recht, M. Fazel, and P. A. Parrilo. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM review, 52(3):471\u2013501, 2010.","journal-title":"SIAM review"},{"key":"9278_CR65","doi-asserted-by":"crossref","unstructured":"B. Recht, W. Xu, and B. Hassibi. Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization. In Decision and Control, 2008. CDC 2008. 47th IEEE Conference on, pages 3065\u20133070. IEEE, 2008.","DOI":"10.1109\/CDC.2008.4739332"},{"key":"9278_CR66","unstructured":"E. Richard, F. Bach, and J.-P. Vert. Intersecting singularities for multi-structured estimation. In ICML 2013-30th International Conference on Machine Learning, 2013."},{"key":"9278_CR67","unstructured":"E. Richard, P.-A. Savalle, and N. Vayatis. Estimation of simultaneously sparse and low rank matrices. arXiv preprint\u00a0 arXiv:1206.6474 , 2012."},{"issue":"5","key":"9278_CR68","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"R. T. Rockafellar. Monotone operators and the proximal point algorithm. SIAM journal on control and optimization, 14(5):877\u2013898, 1976.","journal-title":"SIAM journal on control and optimization"},{"key":"9278_CR69","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1997","unstructured":"R. T. Rockafellar. Convex analysis. Princeton University Press, Princeton 1997."},{"issue":"1","key":"9278_CR70","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"L. I. Rudin, S. Osher, and E. Fatemi. Nonlinear total variation based noise removal algorithms. Physica D: Nonlinear Phenomena, 60(1):259\u2013268, 1992.","journal-title":"Physica D: Nonlinear Phenomena"},{"key":"9278_CR71","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.jmva.2013.03.005","volume":"118","author":"AA Shabalin","year":"2013","unstructured":"A. A. Shabalin and A. B. Nobel. Reconstruction of a low-rank matrix in the presence of gaussian noise. Journal of Multivariate Analysis, 118:67\u201376, 2013.","journal-title":"Journal of Multivariate Analysis"},{"key":"9278_CR72","unstructured":"M. Stojnic. Various thresholds for $$\\ell _1$$ \u2113 1 -optimization in compressed sensing. arXiv preprint\u00a0 arXiv:0907.3666 , 2009."},{"key":"9278_CR73","unstructured":"M. Stojnic. A framework to characterize performance of lasso algorithms. arXiv preprint\u00a0 arXiv:1303.7291 , 2013."},{"key":"9278_CR74","unstructured":"M. Stojnic. A performance analysis framework for socp algorithms in noisy compressed sensing. arXiv preprint\u00a0 arXiv:1304.0002 , 2013."},{"issue":"8","key":"9278_CR75","doi-asserted-by":"crossref","first-page":"3075","DOI":"10.1109\/TSP.2009.2020754","volume":"57","author":"M Stojnic","year":"2009","unstructured":"M. Stojnic, F. Parvaresh, and B. Hassibi. On the reconstruction of block-sparse signals with an optimal number of measurements. Signal Processing, IEEE Transactions on, 57(8):3075\u20133085, 2009.","journal-title":"Signal Processing, IEEE Transactions on"},{"issue":"1","key":"9278_CR76","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"M. Tao and X. Yuan. Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM Journal on Optimization, 21(1):57\u201381, 2011.","journal-title":"SIAM Journal on Optimization"},{"key":"9278_CR77","unstructured":"C. Thrampoulidis, A. Panahi, and B. Hassibi. Asymptotically exact error analysis for the generalized $$\\ell _2^2$$ \u2113 2 2 -lasso. lasso. arXiv preprint\u00a0 arXiv:1502.06287 , 2015."},{"key":"9278_CR78","doi-asserted-by":"crossref","unstructured":"R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological), pages 267\u2013288, 1996.","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"issue":"9","key":"9278_CR79","doi-asserted-by":"crossref","first-page":"4595","DOI":"10.1109\/TSP.2010.2051150","volume":"58","author":"N Vaswani","year":"2010","unstructured":"N. Vaswani and W. Lu. Modified-cs: Modifying compressive sensing for problems with partially known support. Signal Processing, IEEE Transactions on, 58(9):4595\u20134607, 2010.","journal-title":"Signal Processing, IEEE Transactions on"},{"issue":"1","key":"9278_CR80","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1093\/imaiai\/iat002","volume":"2","author":"J Wright","year":"2013","unstructured":"J. Wright, A. Ganesh, K. Min, and Y. Ma. Compressive principal component pursuit. Information and Inference, 2(1):32\u201368, 2013.","journal-title":"Information and Inference"},{"key":"9278_CR81","doi-asserted-by":"crossref","unstructured":"Z. Zhou, X. Li, J. Wright, E. Candes, and Y. Ma. Stable principal component pursuit. In Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on, pages 1518\u20131522. IEEE, 2010.","DOI":"10.1109\/ISIT.2010.5513535"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9278-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-015-9278-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9278-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T22:47:53Z","timestamp":1748645273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-015-9278-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,6]]},"references-count":81,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9278"],"URL":"https:\/\/doi.org\/10.1007\/s10208-015-9278-4","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,6]]}}}