{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T05:26:37Z","timestamp":1787289997132,"version":"build-2736575974"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T00:00:00Z","timestamp":1784246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T00:00:00Z","timestamp":1784246400000},"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":["11991024"],"award-info":[{"award-number":["11991024"]}],"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":["12431010"],"award-info":[{"award-number":["12431010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"crossref","award":["cstc2019jcyj-zdxmX0016"],"award-info":[{"award-number":["cstc2019jcyj-zdxmX0016"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"crossref","award":["cstc2018jcyj-yszxX0009"],"award-info":[{"award-number":["cstc2018jcyj-yszxX0009"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"crossref","award":["CSTB2025NSCQ-GPX1317, CSTB2023NSCQ-LZX0075"],"award-info":[{"award-number":["CSTB2025NSCQ-GPX1317, CSTB2023NSCQ-LZX0075"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Science and Technology Research Program of the Chongqing Municipal Education Commission","award":["Grant No. KJQN202500609"],"award-info":[{"award-number":["Grant No. KJQN202500609"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s10957-026-03057-4","type":"journal-article","created":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T05:38:47Z","timestamp":1784266727000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["General Inertial Smoothing Bregman Proximal Gradient Algorithms for Group Capped-$$\\ell _1$$ Regularized Minimization"],"prefix":"10.1007","volume":"210","author":[{"given":"Jie","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinmin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,17]]},"reference":[{"key":"3057_CR1","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"3057_CR2","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42, 330\u2013348 (2017)","journal-title":"Math. Oper. Res."},{"key":"3057_CR3","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1360\/SSM-2020-0181","volume":"50","author":"W Bian","year":"2020","unstructured":"Bian, W.: Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems. Sci. Sin. Math. 50, 1651\u20131666 (2020). ((in Chinese))","journal-title":"Sci. Sin. Math."},{"issue":"1","key":"3057_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."},{"key":"3057_CR5","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.: Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors. Stat. Comput. 25, 173\u2013187 (2015)","journal-title":"Stat. Comput."},{"issue":"3","key":"3057_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BF00940051","volume":"73","author":"Y Censor","year":"1992","unstructured":"Censor, Y., Zenios, S.A.: Proximal minimization algorithm with D-functions. J. Optim. Theory Appl. 73(3), 451\u2013464 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"3057_CR7","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, 71\u201399 (2012)","journal-title":"Math. Program."},{"key":"3057_CR8","doi-asserted-by":"publisher","first-page":"4634","DOI":"10.1109\/TSP.2006.881263","volume":"54","author":"J Chen","year":"2006","unstructured":"Chen, J., Huo, X.: Theoretical results on sparse representations of multiple-measurement vectors. IEEE Trans. Signal Process. 54, 4634\u20134643 (2006)","journal-title":"IEEE Trans. Signal Process."},{"key":"3057_CR9","doi-asserted-by":"publisher","first-page":"4053","DOI":"10.1109\/TSP.2011.2161982","volume":"59","author":"MF Duarte","year":"2011","unstructured":"Duarte, M.F., Eldar, Y.C.: Structured compressed sensing: from theory to applications. IEEE Trans. Signal Process. 59, 4053\u20134085 (2011)","journal-title":"IEEE Trans. Signal Process."},{"key":"3057_CR10","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E Van den Berg","year":"2008","unstructured":"Van den Berg, E., Friedlander, M.P.: Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31, 890\u2013912 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"3057_CR11","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10589-021-00273-8","volume":"79","author":"F Hanzely","year":"2021","unstructured":"Hanzely, F., Richtarik, P., Xiao, L.: Accelerated Bregman proximal gradient methods for relatively smooth convex optimization. Comput. Optim. Appl. 79, 405\u2013440 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"3057_CR12","first-page":"1","volume":"18","author":"Y Hu","year":"2017","unstructured":"Hu, Y., Li, C., Meng, K., Qin, J., Yang, X.: Group sparse optimization via $$L_{p, q}$$ regularization. J. Mach. Learn. Res. 18, 1\u201352 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"3057_CR13","doi-asserted-by":"publisher","first-page":"1978","DOI":"10.1214\/09-AOS778","volume":"38","author":"J Huang","year":"2010","unstructured":"Huang, J., Zhang, T.: The benefit of group sparsity. Ann. Statist. 38, 1978\u20132004 (2010)","journal-title":"Ann. Statist."},{"issue":"4","key":"3057_CR14","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 $$\\ell _0-\\ell _2$$ penalty: theory and algorithm. IEEE Trans. Signal Process. 65(4), 998\u20131012 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"3057_CR15","unstructured":"Le, H., Gillis, N., Patrinos, P.: Inertial block proximal methods for non-convex non-smooth optimization. In: Proc. Int. Conf. Mach. Learn., PMLR, pp. 5671\u20135681. (2020)"},{"key":"3057_CR16","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. Simul. 86, 597\u2013610 (2016)","journal-title":"J. Stat. Comput. Simul."},{"key":"3057_CR17","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: Adv. Neural Inf. Process. Syst. 28, (2015)"},{"issue":"3","key":"3057_CR18","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 $$\\ell _0$$ regularized optimization problems. SIAM J. Optim. 32(3), 1614\u20131641 (2022)","journal-title":"SIAM J. Optim."},{"key":"3057_CR19","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1109\/TIM.2016.2615449","volume":"66","author":"PR Muduli","year":"2017","unstructured":"Muduli, P.R., Mukherjee, A.: A subspace projection-based joint sparse recovery method for structured biomedical signals. IEEE Trans. Instrum. Meas. 66, 234\u2013242 (2017)","journal-title":"IEEE Trans. Instrum. Meas."},{"issue":"3","key":"3057_CR20","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/19M1298007","volume":"2","author":"MC Mukkamala","year":"2020","unstructured":"Mukkamala, M.C., Ochs, P., Pock, T., Sabach, S.: Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization. SIAM J. Math. Data Sci. 2(3), 658\u2013682 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"2","key":"3057_CR21","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., Pock, T.: iPiano: inertial proximal algorithm for nonconvex optimization. SIAM J. Imaging Sci. 7(2), 1388\u20131419 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"3057_CR22","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 image recovery using capped folded concave functions. SIAM J. Imaging Sci. 14(1), 1\u201325 (2021)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"3057_CR23","doi-asserted-by":"publisher","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":"18","key":"3057_CR24","first-page":"1","volume":"24","author":"DN Phan","year":"2023","unstructured":"Phan, D.N., Gillis, N.: An inertial block majorization minimization framework for nonsmooth nonconvex optimization. J. Mach. Learn. Res. 24(18), 1\u201341 (2023)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"3057_CR25","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1080\/02331934.2018.1543295","volume":"68","author":"D Reem","year":"2019","unstructured":"Reem, D., Reich, S., De Pierro, A.R.: Re-examination of Bregman functions and new properties of their divergences. Optimization 68(1), 279\u2013348 (2019)","journal-title":"Optimization"},{"issue":"2","key":"3057_CR26","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10915-023-02249-8","volume":"96","author":"F Wu","year":"2023","unstructured":"Wu, F., Bian, W.: Accelerated smoothing hard thresholding algorithms for $$\\ell _0$$ regularized nonsmooth convex regression problem. J. Sci. Comput. 96(2), 33 (2023)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"3057_CR27","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10957-023-02176-6","volume":"197","author":"F Wu","year":"2023","unstructured":"Wu, F., Bian, W.: Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability. J. Optim. Theory Appl. 197(2), 539\u2013572 (2023)","journal-title":"J. Optim. Theory Appl."},{"key":"3057_CR28","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10898-020-00943-7","volume":"79","author":"Z Wu","year":"2021","unstructured":"Wu, Z., Li, C., Li, M., Lim, A.: Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems. J. Glob. Optim. 79, 617\u2013644 (2021)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"3057_CR29","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s10957-023-02348-4","volume":"200","author":"L Yang","year":"2024","unstructured":"Yang, L.: Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems. J. Optim. Theory Appl. 200(1), 68\u2013103 (2024)","journal-title":"J. Optim. Theory Appl."},{"key":"3057_CR30","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10589-021-00337-9","volume":"81","author":"Q Yu","year":"2022","unstructured":"Yu, Q., Zhang, X.: A smoothing proximal gradient algorithm for matrix rank minimization problem. Comput. Optim. Appl. 81, 519\u2013538 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"3057_CR31","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-$$\\ell _1$$ relaxation and group smoothing proximal gradient algorithm. Comput. Optim. Appl. 83(3), 801\u2013844 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"3057_CR32","doi-asserted-by":"publisher","first-page":"126515","DOI":"10.1109\/ACCESS.2019.2937005","volume":"7","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Barrio, R., Martinez, M.A., Jiang, H., Cheng, L.: Bregman proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. IEEE Access 7, 126515\u2013126529 (2019)","journal-title":"IEEE Access"},{"issue":"3","key":"3057_CR33","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s10589-022-00446-z","volume":"84","author":"J Zhang","year":"2023","unstructured":"Zhang, J., Yang, X.M., Li, G., Zhang, K.: A smoothing proximal gradient algorithm with extrapolation for the relaxation of $$\\ell _0$$ regularization problem. Comput. Optim. Appl. 84(3), 737\u2013760 (2023)","journal-title":"Comput. Optim. Appl."},{"key":"3057_CR34","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.apnum.2023.05.003","volume":"190","author":"J Zhang","year":"2023","unstructured":"Zhang, J., Yang, X.M.: Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem. Appl. Numer. Math. 190, 303\u2013320 (2023)","journal-title":"Appl. Numer. Math."},{"key":"3057_CR35","doi-asserted-by":"publisher","first-page":"2375","DOI":"10.1093\/bioinformatics\/btq448","volume":"26","author":"H Zhou","year":"2010","unstructured":"Zhou, H., Sehl, M.E., Sinsheimer, J.S., Lange, K.: Association screening of common and rare genetic variants by penalized regression. Bioinformatics 26, 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-03057-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-03057-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03057-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T05:08:54Z","timestamp":1787288934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-03057-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,17]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["3057"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-03057-4","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,17]]},"assertion":[{"value":"22 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"29"}}