{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T06:46:46Z","timestamp":1768718806898,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,2,15]],"date-time":"2018-02-15T00:00:00Z","timestamp":1518652800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,2,15]],"date-time":"2018-02-15T00:00:00Z","timestamp":1518652800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1127914"],"award-info":[{"award-number":["DMS-1127914"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10589-018-9983-4","type":"journal-article","created":{"date-parts":[[2018,2,15]],"date-time":"2018-02-15T16:11:36Z","timestamp":1518711096000},"page":"443-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A primal-dual homotopy algorithm for $$\\ell _{1}$$-minimization with $$\\ell _{\\infty }$$-constraints"],"prefix":"10.1007","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2913-0768","authenticated-orcid":false,"given":"Christoph","family":"Brauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7419-769X","authenticated-orcid":false,"given":"Dirk A.","family":"Lorenz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7744-836X","authenticated-orcid":false,"given":"Andreas M.","family":"Tillmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,15]]},"reference":[{"key":"9983_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01580112","volume":"5","author":"G Appa","year":"1973","unstructured":"Appa, G., Smith, C.: On $$L_{1}$$ and Chebyshev estimation. Math. Program. 5, 73\u201387 (1973). \n                    https:\/\/doi.org\/10.1007\/BF01580112","journal-title":"Math. Program."},{"key":"9983_CR2","unstructured":"Asif, M.S.: Primal dual pursuit\u2014a homotopy based algorithm for the Dantzig selector. Master\u2019s thesis, Georgia Institute of Technology (2008)"},{"key":"9983_CR3","unstructured":"Asif, M.S., Romberg, J.: Dantzig selector homotopy with dynamic measurements. In: Proceedings on SPIE 7246, Computational Imaging VII, 72460E (2009)"},{"key":"9983_CR4","doi-asserted-by":"crossref","unstructured":"Asif, M.S., Romberg, J.: On the Lasso and Dantzig selector equivalence. In: Proceedings on CISS. IEEE (2010)","DOI":"10.1109\/CISS.2010.5464890"},{"key":"9983_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/0885-064X(88)90025-8","volume":"4","author":"L Blum","year":"1988","unstructured":"Blum, L.: A new simple homotopy algorithm for linear programming I. J. Complex. 4, 124\u2013136 (1988)","journal-title":"J. Complex."},{"key":"9983_CR6","doi-asserted-by":"crossref","unstructured":"Brauer, C., Gerkmann, T., Lorenz, D.A.: Sparse reconstruction of quantized speech signals. In: Proceedings on ICASSP. IEEE (2016)","DOI":"10.1109\/ICASSP.2016.7472817"},{"issue":"496","key":"9983_CR7","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1198\/jasa.2011.tm11199","volume":"106","author":"T Cai","year":"2011","unstructured":"Cai, T., Liu, W.: A direct estimation approach to sparse linear discriminant analysis. J. Am. Stat. Assoc. 106(496), 1566\u20131577 (2011)","journal-title":"J. Am. Stat. Assoc."},{"issue":"494","key":"9983_CR8","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1198\/jasa.2011.tm10155","volume":"106","author":"T Cai","year":"2011","unstructured":"Cai, T., Liu, W., Luo, X.: A constrained $$\\ell _1$$ minimization approach to sparse precision matrix estimation. J. Am. Stat. Assoc. 106(494), 594\u2013607 (2011)","journal-title":"J. Am. Stat. Assoc."},{"issue":"12","key":"9983_CR9","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e9s","year":"2005","unstructured":"Cand\u00e9s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"9983_CR10","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1214\/009053606000001523","volume":"35","author":"EJ Cand\u00e9s","year":"2007","unstructured":"Cand\u00e9s, E.J., Tao, T.: The Dantzig selector: statistical estimation when $$p$$ is much larger than $$n$$. Ann. Stat. 35(6), 2313\u20132351 (2007)","journal-title":"Ann. Stat."},{"issue":"1","key":"9983_CR11","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.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20(1), 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"9983_CR12","doi-asserted-by":"publisher","DOI":"10.1515\/9781400884179","volume-title":"Linear Programming and Extensions","author":"GB Dantzig","year":"1963","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)"},{"issue":"4","key":"9983_CR13","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL 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":"9983_CR14","volume-title":"Compressed Sensing: Theory and Applications","year":"2012","unstructured":"Eldar, Y.C., Kutyniok, G. (eds.): Compressed Sensing: Theory and Applications. Cambridge University Press, Cambridge (2012)"},{"key":"9983_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7","volume-title":"A Mathematical Introduction to Compressive Sensing","author":"S Foucart","year":"2013","unstructured":"Foucart, S., Rauhut, H.: A Mathematical Introduction to Compressive Sensing. Birkh\u00e4user, Basel (2013)"},{"issue":"1","key":"9983_CR16","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/TIT.2010.2093310","volume":"57","author":"L Jacques","year":"2011","unstructured":"Jacques, L., Hammond, D.K., Fadili, J.M.: Dequantizing compressed sensing: when oversampling and non-Gaussian constraints combine. IEEE Trans. Inf. Theory 57(1), 559\u2013571 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"9983_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1111\/j.1467-9868.2008.00668.x","volume":"71","author":"GM James","year":"2009","unstructured":"James, G.M., Radchenko, P., Lv, J.: DASSO: connections between the Dantzig selector and Lasso. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 71(1), 127\u2013142 (2009)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"9983_CR18","unstructured":"Kohavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection. In: International Joint Conference on Artificial Intelligence (IJCAI) (1995)"},{"issue":"2","key":"9983_CR19","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/2689662","volume":"41","author":"DA Lorenz","year":"2015","unstructured":"Lorenz, D.A., Pfetsch, M.E., Tillmann, A.M.: Solving basis pursuit: heuristic optimality check and solver comparison. ACM Trans. Math. Softw. 41(2), 8 (2015)","journal-title":"ACM Trans. Math. Softw."},{"key":"9983_CR20","unstructured":"Mairal, J., Yu, B.: Complexity analysis of the lasso regularization path. ArXiv preprint \n                    arXiv:1205.0079\n                    \n                   (2012)"},{"issue":"3","key":"9983_CR21","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1137\/0801021","volume":"1","author":"JL Nazareth","year":"1991","unstructured":"Nazareth, J.L.: The homotopy principle and algorithms for linear programming. SIAM J. Optim. 1(3), 316\u2013332 (1991)","journal-title":"SIAM J. Optim."},{"key":"9983_CR22","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"9983_CR23","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.: A new approach to variable selection in least squares problems. IMA J. Numer. Anal. 20, 389\u2013404 (2000)","journal-title":"IMA J. Numer. Anal."},{"key":"9983_CR24","unstructured":"Pang, H., Zhao, T., Vanderbei, R.J., Liu, H.: A parametric simplex approach to statistical learning problems. Unpublished manuscript. \n                    http:\/\/www.princeton.edu\/~rvdb\/tex\/PSM\/PSM.pdf\n                    \n                   (2015)"},{"key":"9983_CR25","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"9983_CR26","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Hoboken (1986)"},{"key":"9983_CR27","series-title":"Computer Science and Scientific Computing. Translated and Revised from the 1987 German Original by the Author","volume-title":"Mathematical Algorithms for Linear Regression","author":"H Sp\u00e4th","year":"1992","unstructured":"Sp\u00e4th, H.: Mathematical Algorithms for Linear Regression. Computer Science and Scientific Computing. Translated and Revised from the 1987 German Original by the Author. Academic Press Inc., Boston (1992)"},{"issue":"1","key":"9983_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01386369","volume":"1","author":"E Stiefel","year":"1959","unstructured":"Stiefel, E.: \u00dcber diskrete und lineare tschebyscheff-approximationen. Numerische Mathematik 1(1), 1\u201328 (1959). \n                    https:\/\/doi.org\/10.1007\/BF01386369","journal-title":"Numerische Mathematik"},{"key":"9983_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5662-3","volume-title":"Linear Programming: Foundations and Extensions","author":"RJ Vanderbei","year":"2001","unstructured":"Vanderbei, R.J.: Linear Programming: Foundations and Extensions, 2nd edn. Kluwer Academic Publishers, Dordrecht (2001)","edition":"2"},{"issue":"11","key":"9983_CR30","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.compbiomed.2011.08.011","volume":"41","author":"S Zheng","year":"2011","unstructured":"Zheng, S., Liu, W.: An experimental comparison of gene selection by Lasso and Dantzig selector for cancer classification. Comput. Biol. Med. 41(11), 1033\u20131040 (2011)","journal-title":"Comput. Biol. Med."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-9983-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9983-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9983-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T10:57:22Z","timestamp":1589713042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-9983-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,15]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["9983"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-9983-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,15]]},"assertion":[{"value":"31 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}