{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:07:04Z","timestamp":1773778024526,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"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":["12425115"],"award-info":[{"award-number":["12425115"]}],"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":["12271127"],"award-info":[{"award-number":["12271127"]}],"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":["62576117"],"award-info":[{"award-number":["62576117"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10957-026-02955-x","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:55:53Z","timestamp":1773759353000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Smoothing Proximal Gradient Block-coordinate Algorithms for Group Sparse $$\\ell _0$$ Regularized Nonsmooth Convex Regression Problem"],"prefix":"10.1007","volume":"209","author":[{"given":"Xue","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4252-047X","authenticated-orcid":false,"given":"Wei","family":"Bian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,17]]},"reference":[{"issue":"1","key":"2955_CR1","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s10957-021-01880-5","volume":"190","author":"M Ahookhosh","year":"2021","unstructured":"Ahookhosh, M., Hien, L., Gillis, N., Patrinos, P.: A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization. J. Optim. Theory Appl. 190(1), 234\u2013258 (2021)","journal-title":"J. Optim. Theory Appl."},{"key":"2955_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-018-1277-1","volume":"178","author":"A Beck","year":"2019","unstructured":"Beck, A., Hallak, N.: Optimization problems involving group sparsity terms. Math. Program. 178, 39\u201367 (2019)","journal-title":"Math. Program."},{"issue":"4","key":"2955_CR3","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(4), 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2955_CR4","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1137\/18M1186009","volume":"58","author":"W Bian","year":"2020","unstructured":"Bian, W., Chen, X.: A smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty. SIAM J. Numer. Anal. 58(1), 858\u2013883 (2020)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"2955_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-023-02249-8","volume":"96","author":"W Bian","year":"2023","unstructured":"Bian, W., Wu, F.: Accelerated smoothing hard thresholding algorithms for $$l_0$$ regularized nonsmooth convex regression problem. J. Sci. Comput. 96(2), 1\u201330 (2023)","journal-title":"J. Sci. Comput."},{"key":"2955_CR6","first-page":"1369","volume":"9","author":"KW Chang","year":"2008","unstructured":"Chang, K.W., Hsieh, C.J., Lin, C.J.: Coordinate descent method for large-scale $$l_2$$-loss linear support vector machines. J. Mach. Learn. Res. 9, 1369\u20131398 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2955_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/110834524","volume":"22","author":"B Chen","year":"2012","unstructured":"Chen, B., He, S., Li, Z., Zhang, S.: Maximum block improvement and polynomial optimization. SIAM J. Optim. 22(1), 87\u2013107 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2955_CR8","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1109\/TBDATA.2022.3230335","volume":"9","author":"H Chen","year":"2023","unstructured":"Chen, H., Ye, Y., Xiao, M., Skoglund, M.: Asynchronous parallel incremental block-coordinate descent for decentralized machine learning. IEEE Trans. Big Data 9(4), 1252\u20131259 (2023)","journal-title":"IEEE Trans. Big Data"},{"issue":"1","key":"2955_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"X Chen","year":"2012","unstructured":"Chen, X.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134(1), 71\u201399 (2012)","journal-title":"Math. Program."},{"issue":"4","key":"2955_CR10","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1137\/080740167","volume":"3","author":"X Chen","year":"2010","unstructured":"Chen, X., Zhou, W.: Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization. SIAM J. Imaging Sci. 3(4), 765\u2013790 (2010)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"2955_CR11","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/21M1460375","volume":"33","author":"Z Chen","year":"2023","unstructured":"Chen, Z., Li, Y., Lu, J.: On the global convergence of randomized coordinate gradient descent for nonconvex optimization. SIAM J. Optim. 33(2), 713\u2013738 (2023)","journal-title":"SIAM J. Optim."},{"key":"2955_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"F Clarke","year":"1990","unstructured":"Clarke, F.: Optimization and Nonsmooth Analysis. SIAM, New York (1990)"},{"issue":"2","key":"2955_CR13","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/21M1411111","volume":"32","author":"F Curtis","year":"2022","unstructured":"Curtis, F., Dai, Y., Robinson, D.: A subspace acceleration method for minimization involving a group sparsity-inducing regularizer. SIAM J. Optim. 32(2), 545\u2013572 (2022)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"2955_CR14","doi-asserted-by":"publisher","first-page":"3042","DOI":"10.1109\/TSP.2010.2044837","volume":"58","author":"YC Eldar","year":"2010","unstructured":"Eldar, Y.C., Kuppinger, P., Bolcskei, H.: Block-sparse signals: uncertainty relations and efficient recovery. IEEE Trans. Signal Process. 58(6), 3042\u20133054 (2010)","journal-title":"IEEE Trans. Signal Process."},{"issue":"456","key":"2955_CR15","doi-asserted-by":"publisher","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. Amer. Statist. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Amer. Statist. Assoc."},{"issue":"1\u20132","key":"2955_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-016-1057-8","volume":"163","author":"M Hong","year":"2017","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 (2017)","journal-title":"Math. Program."},{"key":"2955_CR17","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10898-024-01441-w","volume":"91","author":"Y Hu","year":"2025","unstructured":"Hu, Y., Lu, J., Yang, X., Zhang, K.: Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application. J. Global Optim. 91, 511\u2013534 (2025)","journal-title":"J. Global Optim."},{"issue":"4","key":"2955_CR18","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1007\/s13246-019-00811-z","volume":"42","author":"Y Hu","year":"2019","unstructured":"Hu, Y., Wang, Z., Xie, L., Luo, L.: Ordered subsets non-local means constrained reconstruction for sparse view cone beam CT system. Australas Phys. Eng. S. 42(4), 1117\u20131128 (2019)","journal-title":"Australas Phys. Eng. S."},{"issue":"4","key":"2955_CR19","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1214\/12-STS392","volume":"27","author":"J Huang","year":"2012","unstructured":"Huang, J., Breheny, P., Ma, S.: A selective review of group selection in high-dimensional models. Stat. Sci. 27(4), 481\u2013499 (2012)","journal-title":"Stat. Sci."},{"key":"2955_CR20","doi-asserted-by":"crossref","unstructured":"Huang, J., Huang, X., Metaxas, D.: Learning with dynamic group sparsity. In Proc. IEEE 12th Int. Conf. Comput. Vis. pp. 64\u201371 (2009)","DOI":"10.1109\/ICCV.2009.5459202"},{"issue":"4","key":"2955_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.: Group sparse recovery via the $$l_0$$($$l_2$$) penalty: theory and algorithm. IEEE Trans. Signal Process. 65(4), 998\u20131012 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"10","key":"2955_CR22","doi-asserted-by":"publisher","first-page":"4050","DOI":"10.1109\/TAC.2019.2906924","volume":"64","author":"P Latafat","year":"2019","unstructured":"Latafat, P., Freris, N., Patrinos, P.: A new randomized block-coordinate primal-dual proximal algorithm for distributed optimization. IEEE Trans. Automat. Contr. 64(10), 4050\u20134065 (2019)","journal-title":"IEEE Trans. Automat. Contr."},{"issue":"3","key":"2955_CR23","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1137\/21M140376X","volume":"32","author":"P Latafat","year":"2022","unstructured":"Latafat, P., Themelis, A., Ahookhosh, M., Patrinos, P.: Bregman Finito\/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity. SIAM J. Optim. 32(3), 2230\u20132262 (2022)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2955_CR24","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/00949655.2015.1026822","volume":"86","author":"S Lee","year":"2016","unstructured":"Lee, S., Oh, M., Kim, Y.: Sparse optimization for nonconvex group penalized estimation. J. Stat. Comput. Sim. 86(3), 597\u2013610 (2016)","journal-title":"J. Stat. Comput. Sim."},{"issue":"3","key":"2955_CR25","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1137\/21M1443455","volume":"32","author":"W Li","year":"2022","unstructured":"Li, W., Bian, W., Toh, K.C.: Difference-of-convex algorithms for a class of sparse group $$l_0$$ regularized optimization problems. SIAM J. Optim. 32(3), 1614\u20131641 (2022)","journal-title":"SIAM J. Optim."},{"key":"2955_CR26","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11075-024-01965-y","volume":"100","author":"X Li","year":"2025","unstructured":"Li, X., Bian, W.: Smoothing randomized block-coordinate proximal gradient algorithms for nonsmooth nonconvex composite optimization. Numer. Algorithms 100, 395\u2013424 (2025)","journal-title":"Numer. Algorithms"},{"key":"2955_CR27","first-page":"1","volume":"18","author":"X Li","year":"2018","unstructured":"Li, X., Zhao, T., Arora, R., Liu, H., Hong, M.: On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization. J. Mach. Learn. Res. 18, 1\u201324 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"2955_CR28","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10898-024-01396-y","volume":"90","author":"S Liao","year":"2024","unstructured":"Liao, S., Han, C., Guo, T., Li, B.: Subspace Newton method for sparse group $$l_0$$ optimization problem. J. Global Optim. 90, 93\u2013125 (2024)","journal-title":"J. Global Optim."},{"issue":"1","key":"2955_CR29","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10107-015-0939-5","volume":"158","author":"Y Liu","year":"2016","unstructured":"Liu, Y., Ma, S., Dai, Y., Zhang, S.: A smoothing SQP framework for a class of composite $$l_q$$ minimization over polyhedron. Math. Program. 158(1), 467\u2013500 (2016)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2955_CR30","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-013-0714-4","volume":"147","author":"Z Lu","year":"2014","unstructured":"Lu, Z.: Iterative hard thresholding methods for $$l_0$$ regularized convex cone programming. Math. Program. 147(1\u20132), 125\u2013154 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"2955_CR31","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"B Natarajan","year":"1995","unstructured":"Natarajan, B.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"key":"2955_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer, New York (2004)"},{"issue":"1","key":"2955_CR33","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"2955_CR34","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2955_CR35","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/070692285","volume":"1","author":"M Nikolova","year":"2008","unstructured":"Nikolova, M., Ng, M., Zhang, S., Ching, W.K.: Efficient reconstruction of piecewise constant images using nonsmooth nonconvex minimization. SIAM J. Imaging Sci. 1(1), 2\u201325 (2008)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"2955_CR36","doi-asserted-by":"publisher","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":"2955_CR37","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/19M1291674","volume":"12","author":"C Pun","year":"2021","unstructured":"Pun, C.: A sparse learning approach to relative-volatility-managed portfolio selection. SIAM J. Financ. Math. 12(1), 410\u2013445 (2021)","journal-title":"SIAM J. Financ. Math."},{"key":"2955_CR38","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.jsv.2019.01.004","volume":"445","author":"B Qiao","year":"2019","unstructured":"Qiao, B., Mao, Z., Liu, J., Zhao, Z., Chen, X.: Group sparse regularization for impact force identification in time domain. J. Sound Vib. 445, 44\u201363 (2019)","journal-title":"J. Sound Vib."},{"issue":"1\u20132","key":"2955_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richtarik","year":"2014","unstructured":"Richtarik, P., Takac, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 144(1\u20132), 1\u201338 (2014)","journal-title":"Math. Program."},{"key":"2955_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R Rockafellar","year":"1998","unstructured":"Rockafellar, R., Wets, R.: Variational Analysis. Springer, Berlin (1998)"},{"issue":"1","key":"2955_CR41","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-020-01602-1","volume":"193","author":"S Salzo","year":"2022","unstructured":"Salzo, S., Villa, S.: Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis. Math. Program. 193(1), 225\u2013269 (2022)","journal-title":"Math. Program."},{"key":"2955_CR42","first-page":"1865","volume":"12","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Tewari, A.: Stochastic methods for $$l_1$$-regularized loss minimization. J. Mach. Learn. Res. 12, 1865\u20131892 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"2955_CR43","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14, 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2955_CR44","first-page":"1","volume":"29","author":"L Silva","year":"2019","unstructured":"Silva, L., de Andrade, L., Duque, C.: Sparse representation algorithm applied to power systems signal compression. Int. T. Electr. Energy. 29(1), 1\u201312 (2019)","journal-title":"Int. T. Electr. Energy."},{"key":"2955_CR45","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10107-019-01437-5","volume":"185","author":"R Sun","year":"2021","unstructured":"Sun, R., Ye, Y.: Worst-case complexity of cyclic coordinate descent: $$\\cal{O} (n^2)$$ gap with randomized version. Math. Program. 185, 487\u2013520 (2021)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2955_CR46","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1\u20132), 387\u2013423 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"2955_CR47","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E Van Den Berg","year":"2009","unstructured":"Van Den Berg, E., Friedlander, M.P.: Probing the pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31(2), 890\u2013912 (2009)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"2955_CR48","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-004-0526-7","volume":"101","author":"M Wagner","year":"2004","unstructured":"Wagner, M., Meller, J., Elber, R.: Large-scale linear programming techniques for the design of protein folding potentials. Math. Program. 101(2), 301\u2013318 (2004)","journal-title":"Math. Program."},{"issue":"1","key":"2955_CR49","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"S Wright","year":"2015","unstructured":"Wright, S.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015)","journal-title":"Math. Program."},{"key":"2955_CR50","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1090\/mcom\/3530","volume":"89","author":"S Wright","year":"2020","unstructured":"Wright, S., Ching-Pei, L.: Analyzing random permutations for cyclic coordinate descent. Math. Comput. 89, 2217\u20132248 (2020)","journal-title":"Math. Comput."},{"issue":"3","key":"2955_CR51","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imaging Sci. 6(3), 1758\u20131789 (2013)","journal-title":"SIAM J. Imaging Sci."},{"issue":"9","key":"2955_CR52","doi-asserted-by":"publisher","first-page":"2104","DOI":"10.1109\/TPAMI.2013.17","volume":"35","author":"L Yuan","year":"2013","unstructured":"Yuan, L., Liu, J., Ye, J.: Efficient methods for overlapping group lasso. IEEE Trans. Pattern Anal. Mach. Intell. 35(9), 2104\u20132116 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"2955_CR53","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10589-022-00419-2","volume":"83","author":"X Zhang","year":"2022","unstructured":"Zhang, X., Peng, D.: Solving constrained nonsmooth group sparse optimization via group capped-$$l_1$$ relaxation and group smoothing proximal gradient algorithm. Comput. Optim. Appl. 83(3), 801\u2013844 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"19","key":"2955_CR54","doi-asserted-by":"publisher","first-page":"2375","DOI":"10.1093\/bioinformatics\/btq448","volume":"26","author":"H Zhou","year":"2010","unstructured":"Zhou, H., Sehl, M., Sinsheimer, J., Lange, K.: Association screening of common and rare genetic variants by penalized regression. Bioinformatics 26(19), 2375\u20132382 (2010)","journal-title":"Bioinformatics"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-02955-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-02955-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-02955-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T17:03:08Z","timestamp":1773766988000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-02955-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,17]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["2955"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-02955-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,17]]},"assertion":[{"value":"10 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"14"}}