{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T15:52:53Z","timestamp":1784562773750,"version":"3.55.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS-1916199"],"award-info":[{"award-number":["DMS-1916199"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871474"],"award-info":[{"award-number":["11871474"]}],"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":["11971362"],"award-info":[{"award-number":["11971362"]}],"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":["91630313"],"award-info":[{"award-number":["91630313"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Stat"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s00180-021-01098-z","type":"journal-article","created":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T20:02:32Z","timestamp":1617048152000},"page":"507-533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["GSDAR: a fast Newton algorithm for $$\\ell _0$$ regularized generalized linear models with statistical guarantee"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5218-9269","authenticated-orcid":false,"given":"Jian","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuling","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lican","family":"Kang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanyan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiliang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,29]]},"reference":[{"issue":"2","key":"1098_CR1","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1214\/009053606000000074","volume":"34","author":"F Abramovich","year":"2006","unstructured":"Abramovich F, Benjamini Y, Donoho DL, Johnstone IM et al (2006) Adapting to unknown sparsity by controlling the false discovery rate. Ann Stat 34(2):584\u2013653","journal-title":"Ann Stat"},{"issue":"3","key":"1098_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s100970100031","volume":"3","author":"L Birg\u00e9","year":"2001","unstructured":"Birg\u00e9 L, Massart P (2001) Gaussian model selection. J Eur Math Soc 3(3):203\u2013268","journal-title":"J Eur Math Soc"},{"issue":"2","key":"1098_CR3","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1534\/genetics.103.021683","volume":"167","author":"M Bogdan","year":"2004","unstructured":"Bogdan M, Ghosh JK, Doerge R (2004) Modifying the schwarz bayesian information criterion to locate multiple interacting quantitative trait loci. Genetics 167(2):989\u2013999","journal-title":"Genetics"},{"issue":"6","key":"1098_CR4","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1002\/qre.936","volume":"24","author":"M Bogdan","year":"2008","unstructured":"Bogdan M, Ghosh JK, \u017bak-Szatkowska M (2008) Selecting explanatory variables with the modified version of the Bayesian information criterion. Qual Reliab Eng Int 24(6):627\u2013641","journal-title":"Qual Reliab Eng Int"},{"issue":"1","key":"1098_CR5","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1214\/10-AOAS388","volume":"5","author":"P Breheny","year":"2011","unstructured":"Breheny P, Huang J (2011) Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection. Ann Appl Stat 5(1):232","journal-title":"Ann Appl Stat"},{"issue":"2","key":"1098_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s11222-013-9424-2","volume":"25","author":"P Breheny","year":"2015","unstructured":"Breheny P, Huang J (2015) Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors. Stat Comput 25(2):173\u2013187","journal-title":"Stat Comput"},{"issue":"3","key":"1098_CR7","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1093\/biomet\/asn034","volume":"95","author":"J Chen","year":"2008","unstructured":"Chen J, Chen Z (2008) Extended bayesian information criteria for model selection with large model spaces. Biometrika 95(3):759\u2013771","journal-title":"Biometrika"},{"key":"1098_CR8","doi-asserted-by":"publisher","first-page":"555","DOI":"10.5705\/ss.2010.216","volume":"22","author":"J Chen","year":"2012","unstructured":"Chen J, Chen Z (2012) Extended bic for small-n-large-p sparse glm. Stat Sinica 22:555\u2013574","journal-title":"Stat Sinica"},{"issue":"4","key":"1098_CR9","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1137\/S0036142999356719","volume":"38","author":"X Chen","year":"2000","unstructured":"Chen X, Nashed Z, Qi L (2000) Smoothing methods and semismooth methods for nondifferentiable operator equations. SIAM J Numer Anal 38(4):1200\u20131216","journal-title":"SIAM J Numer Anal"},{"issue":"1\u20132","key":"1098_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-012-0613-0","volume":"143","author":"X Chen","year":"2014","unstructured":"Chen X, Ge D, Wang Z, Ye Y (2014) Complexity of unconstrained l2-lp minimization. Math Program 143(1\u20132):371\u2013383","journal-title":"Math Program"},{"issue":"7","key":"1098_CR11","doi-asserted-by":"publisher","first-page":"e103322","DOI":"10.1371\/journal.pone.0103322","volume":"9","author":"E Dolejsi","year":"2014","unstructured":"Dolejsi E, Bodenstorfer B, Frommlet F (2014) Analyzing genome-wide association studies with an fdr controlling modification of the bayesian information criterion. PloS One 9(7):e103322","journal-title":"PloS One"},{"issue":"456","key":"1098_CR12","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan J, Li R (2001) Variable selection via nonconcave penalized likelihood and its oracle properties. J Am stat Assoc 96(456):1348\u20131360","journal-title":"J Am stat Assoc"},{"issue":"5","key":"1098_CR13","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1111\/j.1467-9868.2008.00674.x","volume":"70","author":"J Fan","year":"2008","unstructured":"Fan J, Lv J (2008) Sure independence screening for ultrahigh dimensional feature space. J R Stat Soc: Ser B (Stat Methodol) 70(5):849\u2013911","journal-title":"J R Stat Soc: Ser B (Stat Methodol)"},{"issue":"1","key":"1098_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v033.i01","volume":"33","author":"J Friedman","year":"2010","unstructured":"Friedman J, Hastie T, Tibshirani R (2010) Regularization paths for generalized linear models via coordinate descent. J Stat Softw 33(1):1","journal-title":"J Stat Softw"},{"issue":"2","key":"1098_CR15","doi-asserted-by":"publisher","first-page":"e0148620","DOI":"10.1371\/journal.pone.0148620","volume":"11","author":"F Frommlet","year":"2016","unstructured":"Frommlet F, Nuel G (2016) An adaptive ridge procedure for l 0 regularization. PloS One 11(2):e0148620","journal-title":"PloS One"},{"issue":"5","key":"1098_CR16","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1016\/j.csda.2011.05.005","volume":"56","author":"F Frommlet","year":"2012","unstructured":"Frommlet F, Ruhaltinger F, Twar\u00f3g P, Bogdan M (2012) Modified versions of Bayesian information criterion for genome-wide association studies. Comput Stat Data Anal 56(5):1038\u20131051","journal-title":"Comput Stat Data Anal"},{"key":"1098_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5310-8","volume-title":"Phenotypes and genotypes","author":"F Frommlet","year":"2016","unstructured":"Frommlet F, Bogdan M, Ramsey D (2016) Phenotypes and genotypes. Springer, Berlin"},{"issue":"44","key":"1098_CR18","first-page":"1","volume":"20","author":"J Ge","year":"2019","unstructured":"Ge J, Li X, Jiang H, Liu H, Zhang T, Wang M, Zhao T (2019) Picasso: A sparse learning library for high dimensional data analysis in R and Python. J Mach Learn Res 20(44):1\u20135","journal-title":"J Mach Learn Res"},{"issue":"1","key":"1098_CR19","first-page":"403","volume":"19","author":"J Huang","year":"2018","unstructured":"Huang J, Jiao Y, Liu Y, Lu X (2018) A constructive approach to l 0 penalized regression. J Mach Learn Res 19(1):403\u2013439","journal-title":"J Mach Learn Res"},{"key":"1098_CR20","doi-asserted-by":"crossref","unstructured":"Huang J, Jiao Y, Jin B, Liu J, Lu X, Yang C (2021) A unified primal dual active set algorithm for nonconvex sparse recovery. Stat Sci (to appear). arXiv:1310.1147","DOI":"10.1214\/19-STS758"},{"issue":"4","key":"1098_CR21","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1109\/TSP.2016.2630028","volume":"65","author":"Y Jiao","year":"2017","unstructured":"Jiao Y, Jin B, Lu X (2017) Group sparse recovery via the $$\\ell ^0(\\ell ^2)$$ penalty: theory and algorithm. IEEE Trans Signal Process 65(4):998\u20131012","journal-title":"IEEE Trans Signal Process"},{"key":"1098_CR22","unstructured":"Li X, Yang L, Ge J, Haupt J, Zhang T, Zhao T (2017) On quadratic convergence of DC proximal Newton algorithm in nonconvex sparse learning. In: Guyon I, Luxburg UV, Bengio S, Wallach H, Fergus R, Vishwanathan S, Garnett R (eds) Advances in neural information processing systems, vol 30, Curran Associates, Inc"},{"key":"1098_CR23","first-page":"559","volume":"16","author":"P-L Loh","year":"2015","unstructured":"Loh P-L, Wainwright MJ (2015) Regularized m-estimators with nonconvexity: statistical and algorithmic theory for local optima. J Mach Learn Res 16:559\u2013616","journal-title":"J Mach Learn Res"},{"key":"1098_CR24","unstructured":"Louizos C, Welling M, Kingma DP (2018) Learning sparse neural networks through $$L_0$$ regularization. In: International conference on learning representations, pp 1\u201313. URL https:\/\/openreview.net\/forum?id=H1Y8hhg0b"},{"issue":"507","key":"1098_CR25","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1080\/01621459.2013.877275","volume":"109","author":"S Luo","year":"2014","unstructured":"Luo S, Chen Z (2014) Sequential lasso cum ebic for feature selection with ultra-high dimensional feature space. J Am Stat Assoc 109(507):1229\u20131240","journal-title":"J Am Stat Assoc"},{"key":"1098_CR26","unstructured":"Ma R, Miao J, Niu L, Zhang P (2019) Transformed $$\\ell _1$$ regularization for learning sparse deep neural networks. URL https:\/\/arxiv.org\/abs\/1901.01021"},{"key":"1098_CR27","doi-asserted-by":"publisher","DOI":"10.1201\/9780203753736","volume-title":"Generalized linear models","author":"P McCullagh","year":"2019","unstructured":"McCullagh P (2019) Generalized linear models. Routledge, Oxfordshire"},{"issue":"1","key":"1098_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"70","author":"L Meier","year":"2008","unstructured":"Meier L, Van De Geer S, B\u00fchlmann P (2008) The group lasso for logistic regression. J R Stat Soc: Ser B (Stat Methodol) 70(1):53\u201371","journal-title":"J R Stat Soc: Ser B (Stat Methodol)"},{"issue":"2","key":"1098_CR29","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan BK (1995) Sparse approximate solutions to linear systems. SIAM J Comput 24(2):227\u2013234","journal-title":"SIAM J Comput"},{"issue":"3","key":"1098_CR30","first-page":"370","volume":"135","author":"JA Nelder","year":"1972","unstructured":"Nelder JA, Wedderburn RW (1972) Generalized linear models. J R Stat Soc: Ser A (General) 135(3):370\u2013384","journal-title":"J R Stat Soc: Ser A (General)"},{"issue":"1","key":"1098_CR31","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov Y (2013) Gradient methods for minimizing composite functions. Math Program 140(1):125\u2013161","journal-title":"Math Program"},{"issue":"4","key":"1098_CR32","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1111\/j.1467-9868.2007.00607.x","volume":"69","author":"MY Park","year":"2007","unstructured":"Park MY, Hastie T (2007) L1-regularization path algorithm for generalized linear models. J R Stat Soc: Ser B (Stat Methodol) 69(4):659\u2013677","journal-title":"J R Stat Soc: Ser B (Stat Methodol)"},{"issue":"1","key":"1098_CR33","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1287\/moor.18.1.227","volume":"18","author":"L Qi","year":"1993","unstructured":"Qi L (1993) Convergence analysis of some algorithms for solving nonsmooth equations. Math Oper Res 18(1):227\u2013244","journal-title":"Math Oper Res"},{"issue":"1\u20133","key":"1098_CR34","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L Qi","year":"1993","unstructured":"Qi L, Sun J (1993) A nonsmooth version of Newton\u2019s method. Math Program 58(1\u20133):353\u2013367","journal-title":"Math Program"},{"key":"1098_CR35","volume-title":"Var Anal","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar RT, Wets RJ-B (2009) Var Anal. Springer Science & Business Media, Berlin"},{"key":"1098_CR36","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.neucom.2017.02.029","volume":"241","author":"S Scardapane","year":"2017","unstructured":"Scardapane S, Comminiello D, Hussain A, Uncini A (2017) Group sparse regularization for deep neural networks. Neurocomputing 241:81\u201389","journal-title":"Neurocomputing"},{"issue":"2","key":"1098_CR37","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G Schwarz","year":"1978","unstructured":"Schwarz G et al (1978) Estimating the dimension of a model. Ann Stat 6(2):461\u2013464","journal-title":"Ann Stat"},{"key":"1098_CR38","unstructured":"Shen J, Li P (2017) On the iteration complexity of support recovery via hard thresholding pursuit. In: Proceedings of the 34th international conference on machine learning-volume 70, pp 3115\u20133124"},{"issue":"1","key":"1098_CR39","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 (Methodological) 58(1):267\u2013288","journal-title":"J R Stat Soc: Ser B (Methodological)"},{"issue":"2","key":"1098_CR40","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1214\/009053607000000929","volume":"36","author":"SA Van de Geer","year":"2008","unstructured":"Van de Geer SA et al (2008) High-dimensional generalized linear models and the lasso. Ann Stat 36(2):614\u2013645","journal-title":"Ann Stat"},{"issue":"5","key":"1098_CR41","doi-asserted-by":"publisher","first-page":"2505","DOI":"10.1214\/13-AOS1159","volume":"41","author":"L Wang","year":"2013","unstructured":"Wang L, Kim Y, Li R (2013) Calibrating non-convex penalized regression in ultra-high dimension. Ann Stat 41(5):2505","journal-title":"Ann Stat"},{"key":"1098_CR42","unstructured":"Wang R, Xiu N, Zhou S (2019) Fast newton method for sparse logistic regression. arXiv preprint arXiv:1901.02768"},{"issue":"6","key":"1098_CR43","doi-asserted-by":"publisher","first-page":"2164","DOI":"10.1214\/14-AOS1238","volume":"42","author":"Z Wang","year":"2014","unstructured":"Wang Z, Liu H, Zhang T (2014) Optimal computational and statistical rates of convergence for sparse nonconvex learning problems. Ann Stat 42(6):2164","journal-title":"Ann Stat"},{"issue":"Dec","key":"1098_CR44","first-page":"3519","volume":"11","author":"F Ye","year":"2010","unstructured":"Ye F, Zhang C-H (2010) Rate minimaxity of the lasso and dantzig selector for the lq loss in lr balls. J Mach Learn Res 11(Dec):3519\u20133540","journal-title":"J Mach Learn Res"},{"key":"1098_CR45","first-page":"166","volume":"18","author":"X-T Yuan","year":"2017","unstructured":"Yuan X-T, Li P, Zhang T (2017) Gradient hard thresholding pursuit. J Mach Learn Res 18:166","journal-title":"J Mach Learn Res"},{"issue":"11","key":"1098_CR46","doi-asserted-by":"publisher","first-page":"2908","DOI":"10.1016\/j.csda.2011.04.016","volume":"55","author":"M \u017bak-Szatkowska","year":"2011","unstructured":"\u017bak-Szatkowska M, Bogdan M (2011) Modified versions of the bayesian information criterion for sparse generalized linear models. Comput Stat Data Anal 55(11):2908\u20132924","journal-title":"Comput Stat Data Anal"},{"issue":"2","key":"1098_CR47","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang C-H (2010) Nearly unbiased variable selection under minimax concave penalty. Ann Stat 38(2):894\u2013942","journal-title":"Ann Stat"},{"issue":"4","key":"1098_CR48","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1214\/12-STS399","volume":"27","author":"C-H Zhang","year":"2012","unstructured":"Zhang C-H, Zhang T et al (2012) A general theory of concave regularization for high-dimensional sparse estimation problems. Stat Sci 27(4):576\u2013593","journal-title":"Stat Sci"},{"issue":"2","key":"1098_CR49","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: Ser B (Stat Methodol) 67(2):301\u2013320","journal-title":"J R Stat Soc: Ser B (Stat Methodol)"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-021-01098-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00180-021-01098-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-021-01098-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T02:13:03Z","timestamp":1724724783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00180-021-01098-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,29]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1098"],"URL":"https:\/\/doi.org\/10.1007\/s00180-021-01098-z","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"value":"0943-4062","type":"print"},{"value":"1613-9658","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,29]]},"assertion":[{"value":"8 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}