{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T18:34:30Z","timestamp":1791311670441,"version":"4.3.1"},"reference-count":28,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T00:00:00Z","timestamp":1680048000000},"content-version":"vor","delay-in-days":5361,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-0705312"],"award-info":[{"award-number":["DMS-0705312"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-0806030"],"award-info":[{"award-number":["DMS-0806030"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,1,1]]},"abstract":"<jats:title>Summary<\/jats:title>\n                  <jats:p>We propose a new algorithm, DASSO, for fitting the entire coefficient path of the Dantzig selector with a similar computational cost to the least angle regression algorithm that is used to compute the lasso. DASSO efficiently constructs a piecewise linear path through a sequential simplex-like algorithm, which is remarkably similar to the least angle regression algorithm. Comparison of the two algorithms sheds new light on the question of how the lasso and Dantzig selector are related. In addition, we provide theoretical conditions on the design matrix X under which the lasso and Dantzig selector coefficient estimates will be identical for certain tuning parameters. As a consequence, in many instances, we can extend the powerful non-asymptotic bounds that have been developed for the Dantzig selector to the lasso. Finally, through empirical studies of simulated and real world data sets we show that in practice, when the bounds hold for the Dantzig selector, they almost always also hold for the lasso.<\/jats:p>","DOI":"10.1111\/j.1467-9868.2008.00668.x","type":"journal-article","created":{"date-parts":[[2008,7,24]],"date-time":"2008-07-24T09:54:18Z","timestamp":1216893258000},"page":"127-142","source":"Crossref","is-referenced-by-count":103,"title":["DASSO: Connections Between the Dantzig Selector and Lasso"],"prefix":"10.1093","volume":"71","author":[{"given":"Gareth M.","family":"James","sequence":"first","affiliation":[{"name":"University of Southern California , Los Angeles , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Radchenko","sequence":"additional","affiliation":[{"name":"University of Southern California , Los Angeles , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinchi","family":"Lv","sequence":"additional","affiliation":[{"name":"University of Southern California , Los Angeles , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2008,7,24]]},"reference":[{"key":"2023033000105635800_","doi-asserted-by":"crossref","DOI":"10.1007\/s00365-007-9003-x","article-title":"A simple proof of the restricted isometry property for random matrices","author":"Baraniuk","year":"2008","journal-title":"Construct. Approximn"},{"key":"2023033000105635800_","volume-title":"Linear Programming and Network Flows","author":"Bazaraa","year":"1990"},{"key":"2023033000105635800_","article-title":"Simultaneous analysis of Lasso and Dantzig selector","author":"Bickel","year":"2008","journal-title":"Ann. Statist."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1080\/00401706.1995.10484371","article-title":"Better subset regression using the non-negative garrote","volume":"37","author":"Breiman","year":"1995","journal-title":"Technometrics"},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10208-004-0162-x","article-title":"Quantitative robust uncertainty principles and optimally sparse decompositions","volume":"6","author":"Candes","year":"2006","journal-title":"Foundns Comput. Math."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","article-title":"Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information","volume":"52","author":"Candes","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","article-title":"Decoding by linear programming","volume":"51","author":"Candes","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2023033000105635800_","first-page":"2313","article-title":"The Dantzig selector: statistical estimation when p is much larger than n","volume":"35","author":"Candes","year":"2007","journal-title":"Ann. Statist."},{"key":"2023033000105635800_","first-page":"2392","article-title":"Rejoinder\u2014the Dantzig selector: Statistical estimation when p is much larger than n","volume":"35","author":"Candes","year":"2007","journal-title":"Ann. Statist."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","article-title":"Atomic decomposition by basis pursuit","volume":"20","author":"Chen","year":"1998","journal-title":"SIAM J. Scient. Comput."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1002\/cpa.20131","article-title":"For most large underdetermined systems of linear equations, the minimal l1-norm near-solution approximates the sparsest near-solution","volume":"59","author":"Donoho","year":"2006","journal-title":"Communs Pure Appl. Math."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/TIT.2005.860430","article-title":"Stable recovery of sparse overcomplete representations in the presence of noise","volume":"52","author":"Donoho","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2023033000105635800_","first-page":"9446","volume-title":"Proc. Natn. Acad. Sci. USA","author":"Donoho","year":"2005"},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","article-title":"Least angle regression (with discussion)","volume":"32","author":"Efron","year":"2004","journal-title":"Ann. Statist."},{"key":"2023033000105635800_","first-page":"2358","article-title":"Discussion of the \u2018\u2018dantzig selector\u2019\u2019","volume":"35","author":"Efron","year":"2007","journal-title":"Ann. Statist."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","article-title":"Variable selection via nonconcave penalized likelihood and its oracle properties","volume":"96","author":"Fan","year":"2001","journal-title":"J. Am. Statist. Ass."},{"key":"2023033000105635800_","volume-title":"A generalized Dantzig selector with shrinkage tuning","author":"James","year":"2008"},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.csda.2006.12.019","article-title":"Relaxed Lasso","volume":"52","author":"Meinshausen","year":"2007","journal-title":"Computnl Statist. Data Anal."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1214\/009053606000000281","article-title":"High dimensional graphs and variable selection with the lasso","volume":"34","author":"Meinshausen","year":"2006","journal-title":"Ann. Statist."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"2372","DOI":"10.1214\/009053607000000460","article-title":"A tale of three cousins: Lasso, L2Boosting, and Dantzig (discussion on Candes and Tao\u2019s Dantzig Selector paper)","volume":"35","author":"Meinshausen","year":"2007","journal-title":"Ann. Statist."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"3188","DOI":"10.1109\/TIT.2007.903129","article-title":"On polar polytopes and the recovery of sparse representations","volume":"53","author":"Plumbley","year":"2007","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1214\/009053606000001370","article-title":"Piecewise linear regularized solution paths","volume":"35","author":"Rosset","year":"2007","journal-title":"Ann. Statist."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1198\/016214502753479356","article-title":"Adaptive model selection","volume":"97","author":"Shen","year":"2002","journal-title":"J. Am. Statist. Ass."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani","year":"1996","journal-title":"J. R. Statist. Soc. B"},{"key":"2023033000105635800_","article-title":"Model-selection consistency of the lasso in high-dimensional linear regression","author":"Zhang","year":"2007","journal-title":"Manuscript"},{"key":"2023033000105635800_","first-page":"2541","article-title":"On model selection consistency of lasso","volume":"7","author":"Zhao","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1198\/016214506000000735","article-title":"The adaptive lasso and its oracle properties","volume":"101","author":"Zou","year":"2006","journal-title":"J. Am. Statist. Ass."},{"key":"2023033000105635800_","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","article-title":"Regularization and variable selection via the elastic net","volume":"67","author":"Zou","year":"2005","journal-title":"J. R. Statist. Soc. B"}],"container-title":["Journal of the Royal Statistical Society Series B: Statistical Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fj.1467-9868.2008.00668.x","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/71\/1\/127\/49684686\/jrsssb_71_1_127.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/71\/1\/127\/49684686\/jrsssb_71_1_127.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T00:05:32Z","timestamp":1738281932000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jrsssb\/article\/71\/1\/127\/7092869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,24]]},"references-count":28,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2008,7,24]]},"published-print":{"date-parts":[[2009,1,1]]}},"URL":"https:\/\/doi.org\/10.1111\/j.1467-9868.2008.00668.x","relation":{},"ISSN":["1369-7412","1467-9868"],"issn-type":[{"value":"1369-7412","type":"print"},{"value":"1467-9868","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2009,1]]},"published":{"date-parts":[[2008,7,24]]}}}