{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T22:20:18Z","timestamp":1772662818852,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,26]],"date-time":"2021-02-26T00:00:00Z","timestamp":1614297600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,26]],"date-time":"2021-02-26T00:00:00Z","timestamp":1614297600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771113"],"award-info":[{"award-number":["11771113"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1811461"],"award-info":[{"award-number":["U1811461"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s40314-021-01450-5","type":"journal-article","created":{"date-parts":[[2021,2,26]],"date-time":"2021-02-26T13:03:34Z","timestamp":1614344614000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A partially proximal linearized alternating minimization method for finding Dantzig selectors"],"prefix":"10.1007","volume":"40","author":[{"given":"Xiaoyu","family":"Mao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7672-4943","authenticated-orcid":false,"given":"Hongjin","family":"He","sequence":"additional","affiliation":[]},{"given":"Hong-Kun","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,26]]},"reference":[{"key":"1450_CR1","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch H, Bolte J, Redont P, Soubeyran A (2010) Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka\u2013Lojasiewicz inequality. Math Oper Res 35:438\u2013457","journal-title":"Math Oper Res"},{"key":"1450_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/13094829X","volume":"25","author":"A Beck","year":"2015","unstructured":"Beck A (2015) On the convergence of alternating minimization for convex programming with applications to iterative reweighted least squares and decomposition schemes. SIAM J Optim 25:185\u2013209","journal-title":"SIAM J Optim"},{"key":"1450_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"S Becker","year":"2011","unstructured":"Becker S, Cand\u00e9s E, Grant M (2011) Templates for convex cone problems with applications to sparse signal recovery. Math Program Comput 3:165\u2013218","journal-title":"Math Program Comput"},{"issue":"6","key":"1450_CR4","doi-asserted-by":"publisher","first-page":"2352","DOI":"10.1214\/009053607000000424","volume":"35","author":"P Bickel","year":"2007","unstructured":"Bickel P (2007) Discussion: the dantzig selector: statistical estimation when $$p$$ is much larger than $$n$$. Ann Stat 35(6):2352\u20132357","journal-title":"Ann Stat"},{"key":"1450_CR5","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte J, Sabach S, Teboulle M (2014) Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math Program 146:459\u2013494","journal-title":"Math Program"},{"key":"1450_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1080\/00401706.1995.10484371","volume":"37","author":"L Breiman","year":"1995","unstructured":"Breiman L (1995) Better subset regression using the non-negative garrote. Technometrics 37:373\u2013384","journal-title":"Technometrics"},{"key":"1450_CR7","doi-asserted-by":"publisher","first-page":"2365","DOI":"10.1214\/009053607000000442","volume":"35","author":"T Cai","year":"2007","unstructured":"Cai T, Lv J (2007) Discussion: the dantzig selector: statistical estimation when $$p$$ is much larger than $$n$$. Ann Stat 35:2365\u20132368","journal-title":"Ann Stat"},{"key":"1450_CR8","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1214\/009053606000001523","volume":"35","author":"E Cand\u00e9s","year":"2007","unstructured":"Cand\u00e9s E, Tao T (2007) The Dantzig selector: statistical estimation when $$p$$ is much larger than $$n$$. Ann Stat 35:2313\u20132351","journal-title":"Ann Stat"},{"key":"1450_CR9","doi-asserted-by":"publisher","first-page":"2392","DOI":"10.1214\/009053607000000532","volume":"35","author":"E Cand\u00e9s","year":"2007","unstructured":"Cand\u00e9s E, Tao T (2007) Rejoinder: the dantzig selector: statistical estimation when $$p$$ is much larger than $$n$$. Ann Stat 35:2392\u20132404","journal-title":"Ann Stat"},{"key":"1450_CR10","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1093\/biostatistics\/kxp018","volume":"10","author":"A Dobra","year":"2009","unstructured":"Dobra A (2009) Variable selection and dependency networks for genomewide data. Biostatistics 10:621\u2013639","journal-title":"Biostatistics"},{"key":"1450_CR11","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. Ann Stat 32:407\u2013451","journal-title":"Ann Stat"},{"key":"1450_CR12","doi-asserted-by":"publisher","first-page":"2358","DOI":"10.1214\/009053607000000433","volume":"35","author":"B Efron","year":"2007","unstructured":"Efron B, Hastie T, Tibshirani R (2007) Discussion: The Dantzig selector: Statistical estimation when $$p$$ is much larger than $$n$$. Ann Stat 35:2358\u20132364","journal-title":"Ann Stat"},{"key":"1450_CR13","doi-asserted-by":"publisher","first-page":"2385","DOI":"10.1214\/009053607000000479","volume":"35","author":"M Friedlander","year":"2007","unstructured":"Friedlander M, Saunders M (2007) Discussion: the dantzig selector: statistical estimation when $$p$$ is much larger than $$n$$. Ann Stat 35:2385\u20132391","journal-title":"Ann Stat"},{"key":"1450_CR14","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1126\/science.286.5439.531","volume":"286","author":"T Golub","year":"1999","unstructured":"Golub T, Slonim D, Tamayo P, Huard C, Gaasenbeek M, Mesirov J, Coller H, Loh M, Downing J, Caligiuri M, Bloomfield C, Lander E (1999) Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. Science 286:531\u2013537","journal-title":"Science"},{"key":"1450_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10589-013-9616-x","volume":"59","author":"G Gu","year":"2014","unstructured":"Gu G, He B, Yuan X (2014) Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach. Comput. Optim. Appl. 59:135\u2013161","journal-title":"Comput. Optim. Appl."},{"key":"1450_CR16","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10589-015-9748-2","volume":"62","author":"H He","year":"2015","unstructured":"He H, Cai X, Han D (2015) A fast splitting method tailored for Dantzig selectors. Comput Optim Appl 62:347\u2013372","journal-title":"Comput Optim Appl"},{"key":"1450_CR17","doi-asserted-by":"crossref","unstructured":"He H, Xu HK (2017) Splitting methods for split feasibility problems with application to Dantzig selectors. Inverse Probl. 33:055,003 (28pp)","DOI":"10.1088\/1361-6420\/aa5ec5"},{"key":"1450_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1111\/j.1467-9868.2008.00668.x","volume":"71","author":"G James","year":"2009","unstructured":"James G, Radchenko P, Lv J (2009) DASSO: connections between the Dantzig selector and lasso. J R Stat Soc B 71:127\u2013142","journal-title":"J R Stat Soc B"},{"key":"1450_CR19","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1214\/15-EJS1029","volume":"9","author":"J Jia","year":"2015","unstructured":"Jia J, Rohe K (2015) Preconditioning the Lasso for sign consistency. Electronic Journal of Statistics 9:1150\u20131172","journal-title":"Electronic Journal of Statistics"},{"key":"1450_CR20","doi-asserted-by":"publisher","first-page":"4037","DOI":"10.1016\/j.csda.2012.04.019","volume":"56","author":"Z Lu","year":"2012","unstructured":"Lu Z, Pong T, Zhang Y (2012) An alternating direction method for finding Dantzig selectors. Comput Stat Data Anal 56:4037\u20134046","journal-title":"Comput Stat Data Anal"},{"issue":"6","key":"1450_CR21","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1214\/009053607000000460","volume":"35","author":"N Meinshausen","year":"2007","unstructured":"Meinshausen N, Rocha G, Yu B (2007) Discussion: A tale of three cousins: Lasso, L2Boosting and Dantzig. Ann Stat 35(6):2373\u20132384","journal-title":"Ann Stat"},{"key":"1450_CR22","unstructured":"Nocedal J, Wright S (2006) Numerical Optimization, 2nd edn. Springer Series in Operations Research and Financial Engineering. Springer, New York"},{"key":"1450_CR23","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.csda.2015.04.005","volume":"90","author":"A Prater","year":"2015","unstructured":"Prater A, Shen L, Suter B (2015) Finding Dantzig selectors with a proximity operator based fixed-point algorithm. Comput Stat Data Anal 90:36\u201346","journal-title":"Comput Stat Data Anal"},{"key":"1450_CR24","doi-asserted-by":"publisher","first-page":"2370","DOI":"10.1214\/009053607000000451","volume":"35","author":"Y Ritov","year":"2007","unstructured":"Ritov Y (2007) Discussion: the dantzig selector: statistical estimation when $$p$$ is much larger than $$n$$. Ann Stat 35:2370\u20132372","journal-title":"Ann Stat"},{"key":"1450_CR25","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s13675-015-0048-5","volume":"4","author":"R Shefi","year":"2016","unstructured":"Shefi R, Teboulle M (2016) On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems. Eur J Comput Optim 4:27\u201346","journal-title":"Eur J Comput Optim"},{"key":"1450_CR26","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. J R Stat Soc Ser B 58:267\u2013288","journal-title":"J R Stat Soc Ser B"},{"key":"1450_CR27","doi-asserted-by":"publisher","first-page":"A2792","DOI":"10.1137\/110833543","volume":"34","author":"X Wang","year":"2012","unstructured":"Wang X, Yuan X (2012) The linearized alternating direction method of multipliers for Dantzig selector. SIAM J Sci Comput 34:A2792\u2013A2811","journal-title":"SIAM J Sci Comput"},{"key":"1450_CR28","doi-asserted-by":"publisher","first-page":"2394","DOI":"10.1093\/bioinformatics\/bti319","volume":"21","author":"K Yeung","year":"2005","unstructured":"Yeung K, Bumgarner R, Raftery A (2005) Bayesian model averaging: development of an improved multi-class, gene selection and classification tool for microarray data. Bioinformatics 21:2394\u20132402","journal-title":"Bioinformatics"},{"key":"1450_CR29","first-page":"2541","volume":"7","author":"P Zhao","year":"2006","unstructured":"Zhao P, Yu B (2006) On model selection consistency of LASSO. J Mach Learn Res 7:2541\u20132563","journal-title":"J Mach Learn Res"},{"key":"1450_CR30","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou H, Hastie T (2005) Regularization and variable selection via the elastic net. J R Stat Soc B 67:301\u2013320","journal-title":"J R Stat Soc B"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01450-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-021-01450-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01450-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T22:40:55Z","timestamp":1724539255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-021-01450-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,26]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1450"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01450-5","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,26]]},"assertion":[{"value":"20 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"62"}}