{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T02:38:14Z","timestamp":1776479894613,"version":"3.51.2"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:00:00Z","timestamp":1717113600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:00:00Z","timestamp":1717113600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1948341"],"award-info":[{"award-number":["1948341"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2113674"],"award-info":[{"award-number":["2113674"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1846690"],"award-info":[{"award-number":["1846690"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018258","name":"Southern Methodist University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100018258","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper studies a statistical learning model where the model coefficients have a pre-determined non-overlapping group sparsity structure. We consider a combination of a loss function and a regularizer to recover the desired group sparsity patterns, which can embrace many existing works. We analyze directional stationary solutions of the proposed formulation, obtaining a sufficient condition for a directional stationary solution to achieve optimality and establishing a bound of the distance from the solution to a reference point. We develop an efficient algorithm that adopts an alternating direction method of multiplier (ADMM), showing that the iterates converge to a directional stationary solution under certain conditions. In the numerical experiment, we implement the algorithm for generalized linear models with convex and nonconvex group regularizers to evaluate the model performance on various data types, noise levels, and sparsity settings.<\/jats:p>","DOI":"10.1007\/s10915-024-02571-9","type":"journal-article","created":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T11:02:24Z","timestamp":1717153344000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Generalized Formulation for Group Selection via ADMM"],"prefix":"10.1007","volume":"100","author":[{"given":"Chengyu","family":"Ke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunyoung","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifei","family":"Lou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5070-4079","authenticated-orcid":false,"given":"Miju","family":"Ahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,31]]},"reference":[{"key":"2571_CR1","volume-title":"Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables","author":"M Abramowitz","year":"1964","unstructured":"Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, vol. 55. US Government Printing Office, Washington, D.C (1964)"},{"issue":"3","key":"2571_CR2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10898-019-00857-z","volume":"78","author":"M Ahn","year":"2019","unstructured":"Ahn, M.: Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations. J. Glob. Optim. 78(3), 397\u2013422 (2019)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"2571_CR3","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1137\/16M1084754","volume":"27","author":"M Ahn","year":"2017","unstructured":"Ahn, M., Pang, J.S., Xin, J.: Difference-of-convex learning: directional stationarity, optimality, and sparsity. SIAM J. Optim. 27(3), 1637\u20131665 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2571_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000015","volume":"4","author":"F Bach","year":"2012","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G., et al.: Optimization with sparsity-inducing penalties. Found. Trends Mach. Learn. 4(1), 1\u2013106 (2012)","journal-title":"Found. Trends Mach. Learn."},{"key":"2571_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. Society for Industrial and Applied Mathematics, Philadelphia (2017)"},{"key":"2571_CR6","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.: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Now Publishers Inc., Hanover (2011)"},{"key":"2571_CR7","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1093\/jncimonographs\/lgs035","volume":"45","author":"OW Brawley","year":"2012","unstructured":"Brawley, O.W.: Trends in prostate cancer in the United States. J. Natl. Cancer Inst. Monogr. 45, 152\u2013156 (2012)","journal-title":"J. Natl. Cancer Inst. Monogr."},{"issue":"2","key":"2571_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11222-013-9424-2","volume":"25","author":"P Breheny","year":"2015","unstructured":"Breheny, P., Huang, J.: Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors. Stat. Comput. 25(2), 173\u2013187 (2015)","journal-title":"Stat. Comput."},{"issue":"5\u20136","key":"2571_CR9","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e9s","year":"2008","unstructured":"Cand\u00e9s, E.J., Wakin, M.B., Boyd, S.: Enhancing sparsity by reweighted $$\\ell _{1}$$ minimization. J. Fourier Anal. Appl. 14(5\u20136), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"2571_CR10","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Wohlberg, B.: A nonconvex ADMM algorithm for group sparsity with sparse groups. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 6009\u20136013","DOI":"10.1109\/ICASSP.2013.6638818"},{"key":"2571_CR11","unstructured":"Curtis, F.E., Dai, Y., Robinson, D.P.: A subspace acceleration method for minimization involving a group sparsity-inducing regularizer (2020). arXiv preprint arXiv:2007.14951"},{"key":"2571_CR12","first-page":"88580R","volume-title":"Wavelets and Sparsity XV","author":"W Deng","year":"2013","unstructured":"Deng, W., Yin, W., Zhang, Y.: Group sparse optimization by alternating direction method. In: Wavelets and Sparsity XV, vol. 8858, p. 88580R. International Society for Optics and Photonics, Bellingham (2013)"},{"key":"2571_CR13","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/978-1-4613-8511-0_64","volume-title":"Elements of Algebra","author":"L Euler","year":"1972","unstructured":"Euler, L.: Of a new method of resolving equations of the fourth degree. In: Elements of Algebra, pp. 282\u2013288. Springer, Cham (1972)"},{"issue":"456","key":"2571_CR14","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"2571_CR15","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/00401706.2017.1345703","volume":"60","author":"Y Gu","year":"2018","unstructured":"Gu, Y., Fan, J., Kong, L., Ma, S., Zou, H.: ADMM for high-dimensional sparse penalized quantile regression. Technometrics 60(3), 319\u2013331 (2018)","journal-title":"Technometrics"},{"issue":"Mar","key":"2571_CR16","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3(Mar), 1157\u20131182 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"2571_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.H., Friedman, J.H.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction, vol. 2. Springer (2009)"},{"key":"2571_CR18","doi-asserted-by":"crossref","DOI":"10.1201\/b18401","volume-title":"Statistical Learning with Sparsity: The Lasso and Generalizations","author":"T Hastie","year":"2015","unstructured":"Hastie, T., Tibshirani, R., Wainwright, M.: Statistical Learning with Sparsity: The Lasso and Generalizations. RC Press Taylor & Francis Group, Florida (2015)"},{"issue":"1","key":"2571_CR19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1137\/140990309","volume":"26","author":"M Hong","year":"2016","unstructured":"Hong, M., Luo, Z.Q., Razaviyayn, M.: Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems. SIAM J. Optim. 26(1), 337\u2013364 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"2571_CR20","first-page":"85","volume":"163","author":"M Hong","year":"2016","unstructured":"Hong, M., Wang, X., Razaviyayn, M., Luo, Z.Q.: Iteration complexity analysis of block coordinate descent methods. Math. Program. 163(1\u20132), 85\u2013114 (2016)","journal-title":"Math. Program."},{"key":"2571_CR21","doi-asserted-by":"publisher","DOI":"10.1214\/12-STS392","author":"J Huang","year":"2012","unstructured":"Huang, J., Breheny, P., Ma, S.: A selective review of group selection in high-dimensional models. Stat. Sci. (2012). https:\/\/doi.org\/10.1214\/12-STS392","journal-title":"Stat. Sci."},{"issue":"4","key":"2571_CR22","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1109\/TSP.2016.2630028","volume":"65","author":"Y Jiao","year":"2016","unstructured":"Jiao, Y., Jin, B., Lu, X.: Group sparse recovery via the $$l_0(l_2)$$ penalty: theory and algorithm. IEEE Trans. Signal Process. 65(4), 998\u20131012 (2016)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"2571_CR23","doi-asserted-by":"crossref","first-page":"S655","DOI":"10.1137\/20M1349072","volume":"43","author":"C Ke","year":"2021","unstructured":"Ke, C., Ahn, M., Shin, S., Lou, Y.: Iteratively reweighted group lasso based on log-composite regularization. SIAM J. Sci. Comput. 43(5), S655\u2013S678 (2021)","journal-title":"SIAM J. Sci. Comput."},{"issue":"154","key":"2571_CR24","first-page":"1","volume":"20","author":"K Khamaru","year":"2019","unstructured":"Khamaru, K., Wainwright, M.J.: Convergence guarantees for a class of non-convex and non-smooth optimization problems. J. Mach. Learn. Res. 20(154), 1\u201352 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"2571_CR25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.sigpro.2018.04.021","volume":"151","author":"T Kronvall","year":"2018","unstructured":"Kronvall, T., Jakobsson, A.: Hyperparameter selection for group-sparse regression: a probabilistic approach. Signal Process. 151, 107\u2013118 (2018)","journal-title":"Signal Process."},{"issue":"2","key":"2571_CR26","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed $$l_{q}$$ minimization. SIAM J. Numer. Anal. 51(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"2571_CR27","first-page":"1759","volume":"22","author":"G Lanckriet","year":"2009","unstructured":"Lanckriet, G., Sriperumbudur, B.K.: On the convergence of the concave-convex procedure. Adv. Neural Inf. Process. Syst. 22, 1759\u20131767 (2009)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"2571_CR28","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10898-014-0225-8","volume":"62","author":"F Lauer","year":"2015","unstructured":"Lauer, F., Ohlsson, H.: Finding sparse solutions of systems of polynomial equations via group-sparsity optimization. J. Glob. Optim. 62(2), 319\u2013349 (2015)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"2571_CR29","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s11081-015-9294-x","volume":"17","author":"T Lipp","year":"2015","unstructured":"Lipp, T., Boyd, S.: Variations and extension of the convex\u2013concave procedure. Optim. Eng. 17(2), 263\u2013287 (2015)","journal-title":"Optim. Eng."},{"issue":"1","key":"2571_CR30","first-page":"559","volume":"16","author":"PL Loh","year":"2015","unstructured":"Loh, P.L., Wainwright, M.J.: Regularized M-estimators with nonconvexity: statistical and algorithmic theory for local optima. J. Mach. Learn. Res. 16(1), 559\u2013616 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"2571_CR31","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1007\/s10915-017-0463-2","volume":"74","author":"Y Lou","year":"2018","unstructured":"Lou, Y., Yan, M.: Fast $$\\ell _1-\\ell _2$$ minimization via a proximal operator. J. Sci. Comput. 74(2), 767\u2013785 (2018)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2571_CR32","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10915-014-9930-1","volume":"64","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Yin, P., He, Q., Xin, J.: Computing sparse representation in a highly coherent dictionary based on difference of $$\\ell _1$$ and $$\\ell _2$$. J. Sci. Comput. 64(1), 178\u2013196 (2015)","journal-title":"J. Sci. Comput."},{"issue":"1\u20132","key":"2571_CR33","first-page":"369","volume":"176","author":"Z Lu","year":"2018","unstructured":"Lu, Z., Zhou, Z., Sun, Z.: Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization. Math. Program. 176(1\u20132), 369\u2013401 (2018)","journal-title":"Math. Program."},{"key":"2571_CR34","doi-asserted-by":"crossref","DOI":"10.1201\/9780203753736","volume-title":"Generalized Linear Models","author":"P McCullagh","year":"2019","unstructured":"McCullagh, P., Nelder, J.A.: Generalized Linear Models. Routledge, New York (2019)"},{"issue":"1","key":"2571_CR35","doi-asserted-by":"crossref","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.: The group lasso for logistic regression. J. R. Stat. Soc. Ser. B 70(1), 53\u201371 (2008)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"4","key":"2571_CR36","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1214\/12-STS400","volume":"27","author":"SN Negahban","year":"2012","unstructured":"Negahban, S.N., Ravikumar, P., Wainwright, M.J., Yu, B.: A unified framework for high-dimensional analysis of $$ m $$-estimators with decomposable regularizers. Stat. Sci. 27(4), 538\u2013557 (2012)","journal-title":"Stat. Sci."},{"issue":"2","key":"2571_CR37","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1137\/S0036139997327794","volume":"61","author":"M Nikolova","year":"2000","unstructured":"Nikolova, M.: Local strong homogeneity of a regularized estimator. SIAM J. Appl. Math. 61(2), 633\u2013658 (2000)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"2571_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/19M1304799","volume":"14","author":"L Pan","year":"2021","unstructured":"Pan, L., Chen, X.: Group sparse optimization for images recovery using capped folded concave functions. SIAM J. Imaging Sci. 14(1), 1\u201325 (2021)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"2571_CR39","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"JS Pang","year":"2017","unstructured":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing b-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1), 95\u2013118 (2017)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2571_CR40","doi-asserted-by":"crossref","first-page":"1640","DOI":"10.1137\/17M1110249","volume":"28","author":"JS Pang","year":"2018","unstructured":"Pang, J.S., Tao, M.: Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems. SIAM J. Optim. 28(2), 1640\u20131669 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2571_CR41","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"issue":"3","key":"2571_CR42","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1080\/10618600.2014.913516","volume":"24","author":"B Peng","year":"2015","unstructured":"Peng, B., Wang, L.: An iterative coordinate descent algorithm for high-dimensional nonconvex penalized quantile regression. J. Comput. Graph. Stat. 24(3), 676\u2013694 (2015)","journal-title":"J. Comput. Graph. Stat."},{"issue":"1","key":"2571_CR43","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.: Convex analysis approach to DC programming: Theory, algorithms and applications. Acta Math. Vietnam 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam"},{"key":"2571_CR44","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.neunet.2019.05.011","volume":"118","author":"DN Phan","year":"2019","unstructured":"Phan, D.N., Le Thi, H.A.: Group variable selection via $$l_{p,0}$$ regularization and application to optimal scoring. Neural Netw. 118, 220\u2013234 (2019)","journal-title":"Neural Netw."},{"issue":"6","key":"2571_CR45","doi-asserted-by":"crossref","first-page":"A3649","DOI":"10.1137\/18M123147X","volume":"41","author":"Y Rahimi","year":"2019","unstructured":"Rahimi, Y., Wang, C., Dong, H., Lou, Y.: A scale-invariant approach for sparse signal recovery. SIAM J. Sci. Comput. 41(6), A3649\u2013A3672 (2019)","journal-title":"SIAM J. Sci. Comput."},{"issue":"7","key":"2571_CR46","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1016\/j.sigpro.2011.01.012","volume":"91","author":"A Rakotomamonjy","year":"2011","unstructured":"Rakotomamonjy, A.: Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms. Signal Process. 91(7), 1505\u20131526 (2011)","journal-title":"Signal Process."},{"issue":"2","key":"2571_CR47","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.Q.: A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J. Optim. 23(2), 1126\u20131153 (2013)","journal-title":"SIAM J. Optim."},{"key":"2571_CR48","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM Publications, Philadelphia (2009)"},{"issue":"7","key":"2571_CR49","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1109\/LSP.2016.2567482","volume":"23","author":"X Shen","year":"2016","unstructured":"Shen, X., Chen, L., Gu, Y., So, H.C.: Square-root lasso with nonconvex regularization: an ADMM approach. IEEE Signal Process. Lett. 23(7), 934\u2013938 (2016)","journal-title":"IEEE Signal Process. Lett."},{"issue":"2","key":"2571_CR50","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S1535-6108(02)00030-2","volume":"1","author":"D Singh","year":"2002","unstructured":"Singh, D., et al.: Gene expression correlates of clinical prostate cancer behavior. Cancer Cell 1(2), 203\u2013209 (2002)","journal-title":"Cancer Cell"},{"key":"2571_CR51","volume-title":"Mathematical Handbook of Formulas and Tables","author":"MR Spiegel","year":"1968","unstructured":"Spiegel, M.R.: Mathematical Handbook of Formulas and Tables. McGraw-Hill, New York (1968)"},{"key":"2571_CR52","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.jbankfin.2014.12.003","volume":"52","author":"S Tian","year":"2015","unstructured":"Tian, S., Yu, Y., Guo, H.: Variable selection and corporate bankruptcy forecasts. J. Bank. Financ. 52, 89\u2013100 (2015)","journal-title":"J. Bank. Financ."},{"issue":"1","key":"2571_CR53","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.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"4","key":"2571_CR54","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1002\/(SICI)1097-0258(19970228)16:4<385::AID-SIM380>3.0.CO;2-3","volume":"16","author":"R Tibshirani","year":"1997","unstructured":"Tibshirani, R.: The lasso method for variable selection in the cox model. Stat. Med. 16(4), 385\u2013395 (1997)","journal-title":"Stat. Med."},{"issue":"2","key":"2571_CR55","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10589-020-00241-8","volume":"78","author":"W van Ackooij","year":"2020","unstructured":"van Ackooij, W., Demassey, S., Javal, P., Morais, H., de Oliveira, W., Swaminathan, B.: A bundle method for nonsmooth DC programming with application to chance-constrained problems. Comput. Optim. Appl. 78(2), 451\u2013490 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"2571_CR56","doi-asserted-by":"crossref","first-page":"2660","DOI":"10.1109\/TSP.2020.2985298","volume":"68","author":"C Wang","year":"2020","unstructured":"Wang, C., Yan, M., Rahimi, Y., Lou, Y.: Accelerated schemes for the $$l1\/l2 $$ minimization. IEEE Trans. Signal Process. 68, 2660\u20132669 (2020)","journal-title":"IEEE Trans. Signal Process."},{"issue":"12","key":"2571_CR57","doi-asserted-by":"crossref","first-page":"1486","DOI":"10.1093\/bioinformatics\/btm125","volume":"23","author":"L Wang","year":"2007","unstructured":"Wang, L., Chen, G., Li, H.: Group SCAD regression analysis for microarray time course gene expression data. Bioinformatics 23(12), 1486\u20131494 (2007)","journal-title":"Bioinformatics"},{"issue":"1","key":"2571_CR58","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex nonsmooth optimization. J. Sci. Comput. 78(1), 29\u201363 (2019)","journal-title":"J. Sci. Comput."},{"issue":"13","key":"2571_CR59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00949655.2021.1905815","volume":"91","author":"Y Wang","year":"2021","unstructured":"Wang, Y., Zhu, L.: Coordinate majorization descent algorithm for nonconvex penalized regression. J. Stat. Comput. Simul. 91(13), 1\u201315 (2021)","journal-title":"J. Stat. Comput. Simul."},{"issue":"2","key":"2571_CR60","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.csda.2011.08.007","volume":"56","author":"F Wei","year":"2012","unstructured":"Wei, F., Zhu, H.: Group coordinate descent algorithms for nonconvex penalized regression. Comput. Stat. Data Anal. 56(2), 316\u2013326 (2012)","journal-title":"Comput. Stat. Data Anal."},{"issue":"3","key":"2571_CR61","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/s10589-018-0022-2","volume":"71","author":"J Xie","year":"2018","unstructured":"Xie, J.: On inexact admms with relative error criteria. Comput. Optim. Appl. 71(3), 743\u2013765 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"2571_CR62","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s11590-016-1021-9","volume":"11","author":"J Xie","year":"2017","unstructured":"Xie, J., Liao, A., Yang, X.: An inexact alternating direction method of multipliers with relative error criteria. Optim. Lett. 11(3), 583\u2013596 (2017)","journal-title":"Optim. Lett."},{"issue":"1","key":"2571_CR63","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10589-020-00227-6","volume":"78","author":"Y Xie","year":"2020","unstructured":"Xie, Y., Shanbhag, U.V.: Tractable ADMM schemes for computing KKT points and local minimizers for $$\\ell _0$$-minimization problems. Comput. Optim. Appl. 78(1), 43\u201385 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"2571_CR64","first-page":"1385","volume":"30","author":"J Xu","year":"2017","unstructured":"Xu, J., Chi, E., Lange, K.: Generalized linear model regression under distance-to-set penalties. Adv. Neural Inf. Process. Syst. 30, 1385\u20131395 (2017)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"7","key":"2571_CR65","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., Zhang, H.: $$ l_{1\/2} $$ regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23(7), 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"2571_CR66","doi-asserted-by":"crossref","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37(1), A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"2571_CR67","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B 68(1), 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"2","key":"2571_CR68","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"key":"2571_CR69","doi-asserted-by":"publisher","first-page":"511","DOI":"10.4310\/CMS.2017.v15.n2.a9","volume":"15","author":"S Zhang","year":"2017","unstructured":"Zhang, S., Xin, J.: Minimization of transformed $$\\ell _1$$ penalty: closed form representation and iterative thresholding algorithms. Commun. Math. Sci. 15, 511\u2013537 (2017). https:\/\/doi.org\/10.4310\/CMS.2017.v15.n2.a9","journal-title":"Commun. Math. Sci."},{"issue":"1","key":"2571_CR70","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-018-1236-x","volume":"169","author":"S Zhang","year":"2018","unstructured":"Zhang, S., Xin, J.: Minimization of transformed $$\\ell _1$$ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing. Math. Program. 169(1), 307\u2013336 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"2571_CR71","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10107-018-1329-6","volume":"179","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Zhang, N., Sun, D., Toh, K.C.: An efficient hessian based algorithm for solving large-scale sparse group lasso problems. Math. Program. 179(1), 223\u2013263 (2020)","journal-title":"Math. Program."},{"issue":"8","key":"2571_CR72","doi-asserted-by":"crossref","first-page":"1798","DOI":"10.1109\/TMM.2017.2689918","volume":"19","author":"Y Zhou","year":"2017","unstructured":"Zhou, Y., Han, J., Yuan, X., Wei, Z., Hong, R.: Inverse sparse group lasso model for robust object tracking. IEEE Trans. Multimed. 19(8), 1798\u20131810 (2017)","journal-title":"IEEE Trans. Multimed."},{"issue":"1","key":"2571_CR73","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/10618600.2015.1114491","volume":"26","author":"Y Zhu","year":"2017","unstructured":"Zhu, Y.: An augmented ADMM algorithm with application to the generalized lasso problem. J. Comput. Graph. Stat. 26(1), 195\u2013204 (2017)","journal-title":"J. Comput. Graph. Stat."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02571-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02571-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02571-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T20:53:15Z","timestamp":1732135995000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02571-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,31]]},"references-count":73,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2571"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02571-9","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,31]]},"assertion":[{"value":"9 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"15"}}