{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:21:05Z","timestamp":1770538865880,"version":"3.49.0"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T00:00:00Z","timestamp":1542326400000},"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":["Mach Learn"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10994-018-5772-7","type":"journal-article","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T18:39:28Z","timestamp":1542393568000},"page":"1019-1056","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A simple homotopy proximal mapping algorithm for compressive sensing"],"prefix":"10.1007","volume":"108","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7858-5438","authenticated-orcid":false,"given":"Tianbao","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenghuo","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Hua","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"5772_CR1","first-page":"37","volume":"23","author":"A Agarwal","year":"2010","unstructured":"Agarwal, A., Negahban, S., & Wainwright, M. J. (2010). Fast global convergence rates of gradient methods for high-dimensional statistical recovery. Advances in Neural Information Processing Systems, 23, 37\u201345.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"5772_CR2","first-page":"29","volume-title":"The Banach fixed point theorem","author":"P Amster","year":"2014","unstructured":"Amster, P. (2014). The Banach fixed point theorem (pp. 29\u201351). Boston, MA: Springer."},{"issue":"16","key":"5772_CR3","doi-asserted-by":"publisher","first-page":"4209","DOI":"10.1109\/TSP.2014.2328981","volume":"62","author":"MS Asif","year":"2014","unstructured":"Asif, M. S., & Romberg, J. K. (2014). Sparse recovery of streaming signals using $$\\ell _1$$ \u2113 1 -homotopy. IEEE Transactions on Signal Processing, 62(16), 4209\u20134223.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"5772_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/090756855","volume":"4","author":"S Becker","year":"2011","unstructured":"Becker, S., Bobin, J., & Cand\u00e8s, E. J. (2011). Nesta: A fast and accurate first-order method for sparse recovery. SIAM Journal on Imaging Sciences, 4, 1\u201339.","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"1","key":"5772_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., & Teboulle, M. (2009). A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2(1), 183\u2013202.","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"4","key":"5772_CR6","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1214\/08-AOS620","volume":"37","author":"PJ Bickel","year":"2009","unstructured":"Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009). Simultaneous analysis of Lasso and Dantzig selector. Annals of Statistics, 37(4), 1705\u20131732.","journal-title":"Annals of Statistics"},{"key":"5772_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., & Davies, M. E. (2009). Iterative hard thresholding for compressed sensing. Applied and Computational Harmonic Analysis, 27, 265\u2013274.","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"2","key":"5772_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-018-9983-4","volume":"70","author":"C Brauer","year":"2018","unstructured":"Brauer, C., Lorenz, D. A., & Tillmann, A. M. (2018). A primal-dual homotopy algorithm for $$\\ell _1$$ \u2113 1 -minimization with $$\\ell _\\infty $$ \u2113 \u221e -constraints. Computational Optimization and Applications, 70(2), 443\u2013478.","journal-title":"Computational Optimization and Applications"},{"issue":"5\u20136","key":"5772_CR9","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s00041-008-9041-1","volume":"14","author":"K Bredies","year":"2008","unstructured":"Bredies, K., & Lorenz, D. A. (2008). Linear convergence of iterative soft-thresholding. Journal of Fourier Analysis and Applications, 14(5\u20136), 813\u2013837.","journal-title":"Journal of Fourier Analysis and Applications"},{"issue":"1","key":"5772_CR10","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.2013.2288639","volume":"60","author":"TT Cai","year":"2014","unstructured":"Cai, T. T., & Zhang, A. (2014). Sparse representation of a polytope and recovery of sparse signals and low-rank matrices. IEEE Transactions on Information Theory, 60(1), 122\u2013132.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5772_CR11","first-page":"589","volume":"I","author":"E Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E. (2008). The restricted isometry property and its implications for compressed sensing. Comptes rendus de l\u2019Acad\u00e9mie des Sciences Serie, I, 589\u2013592.","journal-title":"Comptes rendus de l\u2019Acad\u00e9mie des Sciences Serie"},{"key":"5772_CR12","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E. J., Romberg, J. K., & Tao, T. (2006). Stable signal recovery from incomplete and inaccurate measurements. Communications on Pure and Applied Mathematics, 59, 1207\u20131223. https:\/\/doi.org\/10.1002\/cpa.20124 .","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"5772_CR13","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E. J., & Tao, T. (2005). Decoding by linear programming. IEEE Transactions on Information Theory, 51, 4203\u20134215.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"5772_CR14","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1214\/009053606000001523","volume":"35","author":"E Cand\u00e8s","year":"2007","unstructured":"Cand\u00e8s, E., & Tao, T. (2007). The dantzig selector: Statistical estimation when $$p$$ p is much larger than $$n$$ n . The Annals of Statistics, 35(6), 2313\u20132351.","journal-title":"The Annals of Statistics"},{"key":"5772_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E. J., & Wakin, M. B. (2008). An introduction to compressive sampling. IEEE Signal Processing Magazine, 25, 21\u201330.","journal-title":"IEEE Signal Processing Magazine"},{"issue":"1","key":"5772_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998). Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing, 20(1), 33\u201361.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"5772_CR17","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001). Atomic decomposition by basis pursuit. SIAM Review, 43, 129\u2013159.","journal-title":"SIAM Review"},{"key":"5772_CR18","unstructured":"Dasgupta, A., Kumar, R., & Sarl\u00f3s, T. (2010). A sparse Johnson\u2013Lindenstrauss transform. In Proceedings of the 42nd ACM symposium on theory of computing, STOC \u201910 (pp. 341\u2013350)."},{"key":"5772_CR19","doi-asserted-by":"crossref","unstructured":"Davenport, M. A., Duarte, M. F., Eldar, Y. C., & Kutyniok, G. (2012). Introduction to compressed sensing. In Compressed sensing: Theory and applications. Cambridge University Press","DOI":"10.1017\/CBO9780511794308.002"},{"key":"5772_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02678430","volume":"13","author":"G Davis","year":"2004","unstructured":"Davis, G., Mallat, S., & Avellaneda, M. (2004). Adaptive greedy approximations. Constructive Approximation, 13, 57\u201398.","journal-title":"Constructive Approximation"},{"key":"5772_CR21","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D. L. (2006). Compressed sensing. IEEE Transactions on Information Theory, 52, 1289\u20131306.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5772_CR22","doi-asserted-by":"crossref","unstructured":"Donoho, D. L., & Tanner, J. (2009). Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing. CoRR abs\/0906.2530.","DOI":"10.1098\/rsta.2009.0152"},{"issue":"6","key":"5772_CR23","doi-asserted-by":"publisher","first-page":"3396","DOI":"10.1109\/TIT.2013.2239356","volume":"59","author":"DL Donoho","year":"2013","unstructured":"Donoho, D. L., Johnstone, I., & Montanari, A. (2013). Accurate prediction of phase transitions in compressed sensing via a connection to minimax denoising. IEEE Transactions on Information Theory, 59(6), 3396\u20133433.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"5772_CR24","doi-asserted-by":"publisher","first-page":"6920","DOI":"10.1109\/TIT.2011.2165823","volume":"57","author":"DL Donoho","year":"2011","unstructured":"Donoho, D. L., Maleki, A., & Montanari, A. (2011). The noise-sensitivity phase transition in compressed sensing. IEEE Transactions on Information Theory, 57(10), 6920\u20136941.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5772_CR25","doi-asserted-by":"publisher","first-page":"4789","DOI":"10.1109\/TIT.2008.929958","volume":"54","author":"DL Donoho","year":"2008","unstructured":"Donoho, D. L., & Tsaig, Y. (2008). Fast solution of l1-norm minimization problems when the solution may be sparse. IEEE Transactions on Information Theory, 54, 4789\u20134812.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5772_CR26","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/TIT.2011.2173241","volume":"58","author":"DL Donoho","year":"2012","unstructured":"Donoho, D. L., Tsaig, Y., Drori, I., & Starck, J. L. (2012). Sparse solution of underdetermined systems of linear equations by stagewise orthogonal matching pursuit. IEEE Transactions on Information Theory, 58, 1094\u20131121.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5772_CR27","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004). Least angle regression. Annals of Statistics, 32, 407\u2013499.","journal-title":"Annals of Statistics"},{"issue":"2","key":"5772_CR28","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10589-016-9871-8","volume":"66","author":"R Eghbali","year":"2017","unstructured":"Eghbali, R., & Fazel, M. (2017). Decomposable norm minimization with proximal-gradient homotopy algorithm. Computational Optimization and Applications, 66(2), 345\u2013381. https:\/\/doi.org\/10.1007\/s10589-016-9871-8 .","journal-title":"Computational Optimization and Applications"},{"key":"5772_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308","volume-title":"Compressed sensing: Theory and applications","author":"Y Eldar","year":"2012","unstructured":"Eldar, Y., & Kutyniok, G. (2012). Compressed sensing: Theory and applications. Cambridge: Cambridge University Press."},{"issue":"6","key":"5772_CR30","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1137\/100806278","volume":"49","author":"S Foucart","year":"2011","unstructured":"Foucart, S. (2011). Hard thresholding pursuit: An algorithm for compressive sensing. SIAM Journal on Numerical Analysis, 49(6), 2543\u20132563.","journal-title":"SIAM Journal on Numerical Analysis"},{"issue":"4","key":"5772_CR31","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1214\/aop\/1176995765","volume":"5","author":"J Galambos","year":"1977","unstructured":"Galambos, J. (1977). Bonferroni inequalities. Annals of Probability, 5(4), 577\u2013581. https:\/\/doi.org\/10.1214\/aop\/1176995765 .","journal-title":"Annals of Probability"},{"key":"5772_CR32","doi-asserted-by":"crossref","unstructured":"Garg, R., & Khandekar, R. (2009). Gradient descent with sparsification: An iterative algorithm for sparse recovery with restricted isometry property. In Proceedings of the 26th annual international conference on machine learning (pp. 337\u2013344). ACM.","DOI":"10.1145\/1553374.1553417"},{"issue":"3","key":"5772_CR33","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E. T., Wotao, Y., & Zhang, Y. (2008). Fixed-point continuation for l1-minimization: methodology and convergence. SIAM Journal on Optimization, 19(3), 1107\u20131130.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"5772_CR34","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1214\/aoms\/1177693335","volume":"42","author":"DL Hanson","year":"1971","unstructured":"Hanson, D. L., & Wright, F. T. (1971). A bound on tail probabilities for quadratic forms in independent random variables. Annals of Mathematical Statistics, 42(3), 1079\u20131083. https:\/\/doi.org\/10.1214\/aoms\/1177693335 .","journal-title":"Annals of Mathematical Statistics"},{"key":"5772_CR35","doi-asserted-by":"crossref","unstructured":"Johnson, W., & Lindenstrauss, J. (1984). Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (New Haven, CT, 1982) (Vol. 26, pp. 189\u2013206).","DOI":"10.1090\/conm\/026\/737400"},{"key":"5772_CR36","first-page":"23","volume":"61, 4:1\u20134","author":"DM Kane","year":"2014","unstructured":"Kane, D. M., & Nelson, J. (2014). Sparser Johnson\u2013Lindenstrauss transforms. Journal of the ACM, 61, 4:1\u20134, 23.","journal-title":"Journal of the ACM"},{"key":"5772_CR37","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1109\/JSTSP.2007.910971","volume":"1","author":"S Kim","year":"2008","unstructured":"Kim, S., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2008). An interior-point method for large-scale l1-regularized least squares. IEEE Journal of Selected Topics in Signal Processing, 1, 606\u2013617.","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"key":"5772_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22147-7","volume-title":"Oracle inequalities in empirical risk minimization and sparse recovery problems: \u00c9cole D\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XXXVIII-2008. Ecole d\u2019\u00e9t\u00e9 de probabilit\u00e9s de Saint-Flour","author":"V Koltchinskii","year":"2011","unstructured":"Koltchinskii, V. (2011). Oracle inequalities in empirical risk minimization and sparse recovery problems: \u00c9cole D\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XXXVIII-2008. Ecole d\u2019\u00e9t\u00e9 de probabilit\u00e9s de Saint-Flour. New York: Springer."},{"key":"5772_CR39","doi-asserted-by":"crossref","unstructured":"Kyrillidis, A. T., & Cevher, V. (2012). Combinatorial selection and least absolute shrinkage via the clash algorithm. In ISIT (pp. 2216\u20132220).","DOI":"10.1109\/ISIT.2012.6283847"},{"issue":"2","key":"5772_CR40","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10851-013-0434-7","volume":"48","author":"AT Kyrillidis","year":"2014","unstructured":"Kyrillidis, A. T., & Cevher, V. (2014). Matrix recipes for hard thresholding methods. Journal of Mathematical Imaging and Vision, 48(2), 235\u2013265.","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"3","key":"5772_CR41","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s10589-014-9694-4","volume":"60","author":"Q Lin","year":"2015","unstructured":"Lin, Q., & Xiao, L. (2015). An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization. Computational Optimization and Applications, 60(3), 633\u2013674. https:\/\/doi.org\/10.1007\/s10589-014-9694-4 .","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"5772_CR42","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10589-013-9602-3","volume":"57","author":"DA Lorenz","year":"2014","unstructured":"Lorenz, D. A., Pfetsch, M. E., & Tillmann, A. M. (2014a). An infeasible-point subgradient method using adaptive approximate projections. Computational Optimization and Applications, 57(2), 271\u2013306. https:\/\/doi.org\/10.1007\/s10589-013-9602-3 .","journal-title":"Computational Optimization and Applications"},{"key":"5772_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2689662","volume":"41","author":"DA Lorenz","year":"2014","unstructured":"Lorenz, D. A., Pfetsch, M. E., & Tillmann, A. M. (2014b). Solving basis pursuit: Heuristic optimality check and solver comparison. ACM Transactions on Mathematical Software, 41, 1\u201329.","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"2","key":"5772_CR44","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/JSTSP.2009.2039176","volume":"4","author":"A Maleki","year":"2010","unstructured":"Maleki, A., & Donoho, D. L. (2010). Optimally tuned iterative reconstruction algorithms for compressed sensing. The Journal of Selected Topics in Signal Processing, 4(2), 330\u2013341.","journal-title":"The Journal of Selected Topics in Signal Processing"},{"key":"5772_CR45","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S Mallat","year":"1993","unstructured":"Mallat, S., & Zhang, Z. (1993). Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing, 41, 3397\u20133415.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"3","key":"5772_CR46","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1214\/009053606000000281","volume":"34","author":"N Meinshausen","year":"2006","unstructured":"Meinshausen, N., & B\u00fchlmann, P. (2006). High-dimensional graphs and variable selection with the lasso. The Annals of Statistics, 34(3), 1436\u20131462.","journal-title":"The Annals of Statistics"},{"key":"5772_CR47","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1859204.1859229","volume":"53","author":"D Needell","year":"2010","unstructured":"Needell, D., & Tropp, J. A. (2010). CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Communications of the ACM, 53, 93\u2013100.","journal-title":"Communications of the ACM"},{"key":"5772_CR48","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10208-008-9031-3","volume":"9","author":"D Needell","year":"2009","unstructured":"Needell, D., & Vershynin, R. (2009). Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Foundations of Computational Mathematics, 9, 317\u2013334.","journal-title":"Foundations of Computational Mathematics"},{"key":"5772_CR49","unstructured":"Nelson, J. (2013). Johnson\u2013Lindenstrauss notes. Technical report."},{"key":"5772_CR50","unstructured":"Nesterov, Y. (2007). Gradient methods for minimizing composite objective function. Core discussion papers, Universit catholique de Louvain, Center for Operations Research and Econometrics (CORE)."},{"key":"5772_CR51","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/10618600.2000.10474883","volume":"9","author":"MR Osborne","year":"1999","unstructured":"Osborne, M. R., Presnell, B., & Turlach, B. A. (1999). On the lasso and its dual. Journal of Computational and Graphical Statistics, 9, 319\u2013337.","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"5772_CR52","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1093\/imanum\/20.3.389","volume":"20","author":"MR Osborne","year":"2000","unstructured":"Osborne, M. R., Presnell, B., & Turlach, B. A. (2000). A new approach to variable selection in least squares problems. IMA Journal of Numerical Analysis, 20, 389\u2013403.","journal-title":"IMA Journal of Numerical Analysis"},{"issue":"6","key":"5772_CR53","doi-asserted-by":"publisher","first-page":"4129","DOI":"10.1109\/TIT.2017.2773497","volume":"64","author":"S Oymak","year":"2018","unstructured":"Oymak, S., Recht, B., & Soltanolkotabi, M. (2018). Sharp time?data tradeoffs for linear inverse problems. IEEE Transactions on Information Theory, 64(6), 4129\u20134158. https:\/\/doi.org\/10.1109\/TIT.2017.2773497 .","journal-title":"IEEE Transactions on Information Theory"},{"key":"5772_CR54","unstructured":"Plan, Y., & Vershynin, R. (2011). One-bit compressed sensing by linear programming. CoRR abs\/1109.4299."},{"key":"5772_CR55","volume-title":"Theory of orlicz spaces. Chapman and Hall pure and applied mathematics","author":"M Rao","year":"1991","unstructured":"Rao, M., & Ren, Z. (1991). Theory of orlicz spaces. Chapman and Hall pure and applied mathematics. Boca Raton: CRC Press."},{"key":"5772_CR56","volume-title":"Convex analysis. Princeton mathematical series","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R. T. (1970). Convex analysis. Princeton mathematical series. Princeton, NJ: Princeton University Press."},{"key":"5772_CR57","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society (Series B), 58, 267\u2013288.","journal-title":"Journal of the Royal Statistical Society (Series B)"},{"issue":"2","key":"5772_CR58","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1109\/TIT.2013.2290112","volume":"60","author":"AM Tillmann","year":"2014","unstructured":"Tillmann, A. M., & Pfetsch, M. E. (2014). The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing. IEEE Transactions on Information Theory, 60(2), 1248\u20131259. https:\/\/doi.org\/10.1109\/TIT.2013.2290112 .","journal-title":"IEEE Transactions on Information Theory"},{"key":"5772_CR59","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2006","unstructured":"Tropp, J. A. (2006a). Greed is good: Algorithmic results for sparse approximation. IEEE Transactions on Information Theory, 50, 2231\u20132242.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5772_CR60","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"52","author":"JA Tropp","year":"2006","unstructured":"Tropp, J. A. (2006b). Just relax: convex programming methods for identifying sparse signals in noise. IEEE Transactions on Information Theory, 52, 1030\u20131051.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5772_CR61","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"Tropp, J. A., & Gilbert, A. C. (2007). Signal recovery from random measurements via orthogonal matching pursuit. IEEE Transactions on Information Theory, 53, 4655\u20134666.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5772_CR62","unstructured":"Tseng, P. (2008). On accelerated proximal gradient methods for convex-concave optimization. SIAM Journal on Optimization (submitted)."},{"key":"5772_CR63","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1198\/004017005000000139","volume":"47","author":"BA Turlach","year":"2005","unstructured":"Turlach, B. A., Venables, W. N., & Wright, S. J. (2005). Simultaneous variable selection. Technometrics, 47, 349\u2013363.","journal-title":"Technometrics"},{"key":"5772_CR64","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1214\/09-EJS506","volume":"3","author":"SA Geer van de","year":"2009","unstructured":"van de Geer, S. A., & B\u00fchlmann, P. (2009). On the conditions used to prove oracle results for the lasso. The Electronic Journal of Statistics, 3, 1360\u20131392.","journal-title":"The Electronic Journal of Statistics"},{"issue":"2","key":"5772_CR65","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E Berg van den","year":"2008","unstructured":"van den Berg, E., & Friedlander, M. P. (2008). Probing the pareto frontier for basis pursuit solutions. SIAM Journal on Scientific Computing, 31(2), 890\u2013912. https:\/\/doi.org\/10.1137\/080714488 .","journal-title":"SIAM Journal on Scientific Computing"},{"key":"5772_CR66","doi-asserted-by":"publisher","first-page":"2183","DOI":"10.1109\/TIT.2009.2016018","volume":"55","author":"MJ Wainwright","year":"2009","unstructured":"Wainwright, M. J. (2009). Sharp thresholds for high-dimensional and noisy sparsity recovery using l1-constrained quadratic programming (Lasso). IEEE Transactions on Information Theory, 55, 2183\u20132202.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"5772_CR67","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Yin, W., Goldfarb, D., & Zhang, Y. (2010). A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation. SIAM Journal on Scientific Computing, 32(4), 1832\u20131857. https:\/\/doi.org\/10.1137\/090747695 .","journal-title":"SIAM Journal on Scientific Computing"},{"key":"5772_CR68","doi-asserted-by":"crossref","unstructured":"Wright, S., Nowak, R., & Figueiredo, M. A. T. (2009). Sparse reconstruction by separable approximation. IEEE Transactions on Signal Processing. https:\/\/doi.org\/10.1109\/TSP.2009.2016892 .","DOI":"10.1109\/TSP.2009.2016892"},{"issue":"2","key":"5772_CR69","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1137\/120869997","volume":"23","author":"L Xiao","year":"2013","unstructured":"Xiao, L., & Zhang, T. (2013). A proximal-gradient homotopy method for the sparse least-squares problem. SIAM Journal on Optimization, 23(2), 1062\u20131091.","journal-title":"SIAM Journal on Optimization"},{"key":"5772_CR70","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1214\/08-AOS659","volume":"37","author":"T Zhang","year":"2009","unstructured":"Zhang, T. (2009). Some sharp performance bounds for least squares regression with l1 regularization. The Annals of Statistics, 37, 2109\u20132144.","journal-title":"The Annals of Statistics"},{"key":"5772_CR71","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1214\/07-AOS520","volume":"36","author":"CH Zhang","year":"2008","unstructured":"Zhang, C. H., & Huang, J. (2008). The sparsity and bias of the lasso selection in high-dimensional linear regression. The Annals of Statistics, 36, 1567\u20131594.","journal-title":"The Annals of Statistics"},{"key":"5772_CR72","first-page":"2541","volume":"7","author":"P Zhao","year":"2006","unstructured":"Zhao, P., & Yu, B. (2006). On model selection consistency of lasso. Journal of Machine Learning Research, 7, 2541\u20132563.","journal-title":"Journal of Machine Learning Research"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5772-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-018-5772-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5772-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T13:18:02Z","timestamp":1720790282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-018-5772-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,16]]},"references-count":72,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["5772"],"URL":"https:\/\/doi.org\/10.1007\/s10994-018-5772-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,16]]},"assertion":[{"value":"23 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}