{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T20:00:47Z","timestamp":1772913647155,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971170"],"award-info":[{"award-number":["11971170"]}],"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":[[2023,6]]},"DOI":"10.1007\/s00180-022-01249-w","type":"journal-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T16:03:00Z","timestamp":1658505780000},"page":"871-898","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems"],"prefix":"10.1007","volume":"38","author":[{"given":"Peili","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"issue":"3","key":"1249_CR1","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/16M1084754","volume":"27","author":"M Ahn","year":"2017","unstructured":"Ahn M, Pang JS, Xin J (2017) Difference-of-convex learning: directional stationarity, optimality, and sparsity. SIAM J Optim 27(3):1637\u20131665","journal-title":"SIAM J Optim"},{"key":"1249_CR2","volume-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","author":"S Boyd","year":"2011","unstructured":"Boyd S, Parikh N, Chu E (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Now Publishers Inc, Norwell"},{"issue":"1","key":"1249_CR3","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\u2013253","journal-title":"Ann Appl Stat"},{"issue":"12","key":"1249_CR4","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Candes","year":"2005","unstructured":"Candes EJ, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51(12):4203\u20134215","journal-title":"IEEE Trans Inf Theory"},{"issue":"10","key":"1249_CR5","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand R (2007) Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process Lett 14(10):707\u2013710","journal-title":"IEEE Signal Process Lett"},{"issue":"15","key":"1249_CR6","doi-asserted-by":"publisher","first-page":"3754","DOI":"10.1109\/TSP.2014.2330349","volume":"62","author":"L Chen","year":"2014","unstructured":"Chen L, Gu Y (2014) The convergence guarantees of a non-convex approach for sparse recovery. IEEE Trans Signal Process 62(15):3754\u20133767","journal-title":"IEEE Trans Signal Process"},{"issue":"1","key":"1249_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen SS, Donoho DL, Saunders MA (2001) Atomic decomposition by basis pursuit. SIAM Rev 43(1):129\u2013159","journal-title":"SIAM Rev"},{"issue":"4","key":"1249_CR8","doi-asserted-by":"publisher","first-page":"3344","DOI":"10.1137\/18M117337X","volume":"28","author":"Y Cui","year":"2018","unstructured":"Cui Y, Pang JS, Sen B (2018) Composite difference-max programs for modern statistical estimation problems. SIAM J Opti 28(4):3344\u20133374","journal-title":"SIAM J Opti"},{"issue":"432","key":"1249_CR9","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1080\/01621459.1995.10476626","volume":"90","author":"DL Donoho","year":"1995","unstructured":"Donoho DL, Johnstone IM (1995) Adapting to Unknown Smoothness via Wavelet Shrinkage. J Am Stat Assoc 90(432):1200\u20131224","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"1249_CR10","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(2):407\u2013451","journal-title":"Ann Stat"},{"issue":"456","key":"1249_CR11","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"JQ Fan","year":"2001","unstructured":"Fan JQ, Li RZ (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":"23","key":"1249_CR12","doi-asserted-by":"publisher","first-page":"6276","DOI":"10.1109\/TSP.2014.2362880","volume":"62","author":"Q Fan","year":"2014","unstructured":"Fan Q, Jiao Y, Lu X (2014) A primal dual active set algorithm with continuation for compressed sensing. IEEE Trans Signal Process 62(23):6276\u20136285","journal-title":"IEEE Trans Signal Process"},{"key":"1249_CR13","unstructured":"Flemming J (2011) Generalized Tikhonov regularization, basic theory and comprehensive results on convergence rates. PhD thesis, Fakultat fur Mathematik Technische Universitat Chemnitz"},{"issue":"2","key":"1249_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1080\/00401706.1993.10485033","volume":"35","author":"L Frank","year":"1993","unstructured":"Frank L, Friedman J (1993) A statistical view of some chemometrics regression tools. Technometrics 35(2):109\u2013135","journal-title":"Technometrics"},{"issue":"3","key":"1249_CR15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/10618600.1998.10474784","volume":"7","author":"W Fu","year":"1998","unstructured":"Fu W (1998) Penalized regressions: the bridge versus the lasso. J Comput Gr Stat 7(3):397\u2013416","journal-title":"J Comput Gr Stat"},{"key":"1249_CR16","unstructured":"Gong P, Zhang C, Lu Z, Huang J, Ye J (2013) A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. In: Proceedings of the 30th international conference on machine learning, PMLR 28(2):37-45"},{"issue":"3","key":"1249_CR17","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/S1052623401383558","volume":"13","author":"M Hinterm\u00fcller","year":"2002","unstructured":"Hinterm\u00fcller M, Ito K, Kunisch K (2002) The primal-dual active set strategy as a semismooth newton method. SIAM J Optim 13(3):865\u2013888","journal-title":"SIAM J Optim"},{"issue":"2","key":"1249_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1214\/19-STS758","volume":"36","author":"J Huang","year":"2021","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 36(2):215\u2013238","journal-title":"Stat Sci"},{"key":"1249_CR19","first-page":"883","volume":"23","author":"L Huang","year":"2010","unstructured":"Huang L, Jia J, Yu B, Chun BG, Maniatis P, Naik M (2010) Predicting execution time of computer programs using sparse polynomial regression. Adv Neural Inf Process Syst 23:883\u2013891","journal-title":"Adv Neural Inf Process Syst"},{"issue":"4","key":"1249_CR20","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1214\/009053605000000200","volume":"33","author":"D Hunter","year":"2005","unstructured":"Hunter D, Li R (2005) Variable selection using MM algorithms. Ann Stat 33(4):1617\u20131642","journal-title":"Ann Stat"},{"issue":"1","key":"1249_CR21","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"244","author":"HA Le Thi","year":"2015","unstructured":"Le Thi HA, Dinh TP, Le HM, Vo XT (2015) DC approximation approaches for sparse optimization. Eur J Op Res 244(1):26\u201346","journal-title":"Eur J Op Res"},{"issue":"3","key":"1249_CR22","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee JD, Sun Y, Saunders MA (2014) Proximal newton-type methods for minimizing composite functions. SIAM J Optim 24(3):1420\u20131443","journal-title":"SIAM J Optim"},{"issue":"5","key":"1249_CR23","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G Li","year":"2018","unstructured":"Li G, Pong TK (2018) Calculus of the exponent of Kurdyka-Lojasiewicz inequality and its applications to linear convergence of first-order methods. Found Comput Math 18(5):1199\u20131232","journal-title":"Found Comput Math"},{"key":"1249_CR24","first-page":"2742","volume":"30","author":"X Li","year":"2017","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. Adv Neural Inf Process Syst 30:2742\u20132752","journal-title":"Adv Neural Inf Process Syst"},{"issue":"1","key":"1249_CR25","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"XD Li","year":"2018","unstructured":"Li XD, Sun DF, Toh KC (2018) A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems. SIAM J Optim 28(1):433\u2013458","journal-title":"SIAM J Optim"},{"issue":"507","key":"1249_CR26","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 Asso 109(507):1229\u20131240","journal-title":"J Am Stat Asso"},{"issue":"495","key":"1249_CR27","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1198\/jasa.2011.tm09738","volume":"106","author":"R Mazumder","year":"2011","unstructured":"Mazumder R, Friedman JH, Hastie T (2011) SparseNet: coordinate descent with nonconvex penalties. J Am Stat Assoc 106(495):1125\u20131138","journal-title":"J Am Stat Assoc"},{"issue":"3","key":"1249_CR28","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. Ann Stat 34(3):1436\u20131462","journal-title":"Ann Stat"},{"issue":"4","key":"1249_CR29","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/4\/045009","volume":"27","author":"CA Micchelli","year":"2011","unstructured":"Micchelli CA, Shen L, Xu Y (2011) Proximity algorithms for image models: denoising. Inverse Probl 27(4):045009","journal-title":"Inverse Probl"},{"issue":"2","key":"1249_CR30","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":"1","key":"1249_CR31","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"JS Pang","year":"2017","unstructured":"Pang JS, Razaviyayn M, Alvarado A (2017) Computing B-stationary points of nonsmooth DC programs. Math Op Res 42(1):95\u2013118","journal-title":"Math Op Res"},{"key":"1249_CR32","volume-title":"Convex analysis","author":"RT Rockafellar","year":"2015","unstructured":"Rockafellar RT (2015) Convex analysis. Princeton University Press, Princeton"},{"key":"1249_CR33","unstructured":"Shi Y, Huang J, Jiao Y, Yang Q (2018) Semi-smooth Newton algorithm for non-convex penalized linear regression. arXiv preprint arXiv:1802.08895 URL https:\/\/arxiv.org\/pdf\/1802.08895.pdf"},{"issue":"226","key":"1249_CR34","first-page":"1","volume":"21","author":"P Tang","year":"2020","unstructured":"Tang P, Wang C, Sun D, Toh K-C (2020) A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems. J Mach Learn Res 21(226):1\u201338","journal-title":"J Mach Learn Res"},{"issue":"1","key":"1249_CR35","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 Royal Stat Soc Ser B (Methodol) 58(1):267\u2013288","journal-title":"J Royal Stat Soc Ser B (Methodol)"},{"issue":"5","key":"1249_CR36","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\u20132536","journal-title":"Ann Stat"},{"issue":"1","key":"1249_CR37","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1214\/07-AOAS147","volume":"2","author":"TT Wu","year":"2008","unstructured":"Wu TT, Lange K (2008) Coordinate descent algorithms for lasso penalized regression. Ann Appl Stat 2(1):224\u2013244","journal-title":"Ann Appl Stat"},{"issue":"2","key":"1249_CR38","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang CH (2010a) Nearly unbiased variable selection under minimax concave penalty. Ann Stat 38(2):894\u2013942","journal-title":"Ann Stat"},{"issue":"3","key":"1249_CR39","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang T (2010b) Analysis of multi-stage convex relaxation for sparse regularization. J Mach Learn Res 11(3):1081\u20131107","journal-title":"J Mach Learn Res"},{"key":"1249_CR40","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"},{"issue":"4","key":"1249_CR41","first-page":"1509","volume":"36","author":"H Zou","year":"2008","unstructured":"Zou H, Li R (2008) One-step sparse estimates in nonconcave penalized likelihood models. Ann Stat 36(4):1509\u20131533","journal-title":"Ann Stat"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-022-01249-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00180-022-01249-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-022-01249-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T18:13:17Z","timestamp":1727633597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00180-022-01249-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,22]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1249"],"URL":"https:\/\/doi.org\/10.1007\/s00180-022-01249-w","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"value":"0943-4062","type":"print"},{"value":"1613-9658","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,22]]},"assertion":[{"value":"20 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}