{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T23:40:09Z","timestamp":1769730009077,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T00:00:00Z","timestamp":1762646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T00:00:00Z","timestamp":1762646400000},"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":["62176073"],"award-info":[{"award-number":["62176073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postdoctoral Fellowship Program of CPSF","award":["GZC20233475"],"award-info":[{"award-number":["GZC20233475"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10589-025-00732-6","type":"journal-article","created":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T04:37:56Z","timestamp":1762663076000},"page":"765-794","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extrapolated hard thresholding algorithms with finite length for composite $$\\ell _0$$ penalized problems"],"prefix":"10.1007","volume":"93","author":[{"given":"Fan","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jiazhen","family":"Wei","sequence":"additional","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":[[2025,11,9]]},"reference":[{"issue":"2","key":"732_CR1","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"732_CR2","unstructured":"Hu, W.H., Niu, G., Sato, I., Sugiyama, M.: Does distributionally robust supervised learning give robust classifiers ? In Proc. 35th Int. Conf. Mach. Learn. 80, 2029\u20132037 (2018)"},{"issue":"10","key":"732_CR3","doi-asserted-by":"publisher","first-page":"7253","DOI":"10.1109\/TPAMI.2021.3092177","volume":"44","author":"HJ Wang","year":"2022","unstructured":"Wang, H.J., Shao, Y.H., Zhou, S.L., Zhang, C., Xiu, N.H.: Support vector machine classifier via $${l}_{0\/1}$$ soft-margin loss. IEEE Trans. Pattern Anal. Mach. Intell. 44(10), 7253\u20137265 (2022)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"732_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-024-02123-x","author":"W Bian","year":"2024","unstructured":"Bian, W., Chen, X.: Nonsmooth convex-concave saddle point problems with cardinality penalties. Math. Program. (2024). https:\/\/doi.org\/10.1007\/s10107-024-02123-x","journal-title":"Math. Program."},{"issue":"3","key":"732_CR5","first-page":"793","volume":"30","author":"Y Cui","year":"2023","unstructured":"Cui, Y., Liu, J., Pang, J.S.: The minimization of piecewise functions: pseudo stationary. J. Convex Anal. 30(3), 793\u2013834 (2023)","journal-title":"J. Convex Anal."},{"issue":"1","key":"732_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/S0363012992238369","volume":"33","author":"YM Ermoliev","year":"1995","unstructured":"Ermoliev, Y.M., Norkin, V.I., Wets, R.J.B.: The minimization of semicontinuous functions-mollifier subgradients. SIAM J. Control. Optim. 33(1), 149\u2013167 (1995)","journal-title":"SIAM J. Control. Optim."},{"key":"732_CR7","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2023.0295","author":"SN Han","year":"2024","unstructured":"Han, S.N., Cui, Y., Pang, J.S.: Analysis of a class of minimization problems lacking lower semicontinuity. Math. Oper. Res. (2024). https:\/\/doi.org\/10.1287\/moor.2023.0295","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"732_CR8","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 $$\\ell _0$$ regularized convex cone programming. Math. Program. 147(1\u20132), 125\u2013154 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"732_CR9","doi-asserted-by":"publisher","first-page":"2602","DOI":"10.1287\/moor.2021.0320","volume":"49","author":"PH Zhang","year":"2024","unstructured":"Zhang, P.H., Xiu, N.H., Luo, Z.Y.: Zero-one composite optimization: Lyapunov exact penalty and a globally convergent inexact augmented Lagrangian method. Math. Oper. Res. 49(4), 2602\u20132625 (2024)","journal-title":"Math. Oper. Res."},{"issue":"456","key":"732_CR10","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. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"732_CR11","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1111\/rssb.12037","volume":"76","author":"ZM Zheng","year":"2014","unstructured":"Zheng, Z.M., Fan, Y.Y., Lv, J.C.: High dimensional thresholded regression and shrinkage effect. J. R. Stat. Soc. Ser. B-Stat. Methodol. 76(3), 627\u2013649 (2014)","journal-title":"J. R. Stat. Soc. Ser. B-Stat. Methodol."},{"issue":"2","key":"732_CR12","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.sigpro.2007.08.015","volume":"88","author":"D Peleg","year":"2008","unstructured":"Peleg, D., Meir, R.: A bilinear formulation for vector sparsity optimization. Signal Process. 88(2), 375\u2013389 (2008)","journal-title":"Signal Process."},{"issue":"1","key":"732_CR13","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":"12","key":"732_CR14","doi-asserted-by":"publisher","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G Gasso","year":"2009","unstructured":"Gasso, G., Rakotomamonjy, A., Canu, S.: Recovering sparse signals with a certain family of nonconvex penalties and dc programming. IEEE Trans. Signal Process. 57(12), 4686\u20134698 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"732_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11634-008-0030-7","volume":"2","author":"HAL Thi","year":"2008","unstructured":"Thi, H.A.L., Le, H.M., Nguyen, V.V., Dinh, T.P.: A DC programming approach for feature selection in support vector machines learning. Adv. Data Anal. Classif. 2(3), 259\u2013278 (2008)","journal-title":"Adv. Data Anal. Classif."},{"issue":"5\u20136","key":"732_CR16","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","volume":"14","author":"T Blumensath","year":"2008","unstructured":"Blumensath, T., Davies, M.: Iterative thresholding for sparse approximations. J. Fourier Anal. Appl. 14(5\u20136), 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"732_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"4","key":"732_CR18","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23(4), 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"732_CR19","doi-asserted-by":"publisher","first-page":"3184","DOI":"10.1137\/21M1409445","volume":"30","author":"SL Zhou","year":"2021","unstructured":"Zhou, S.L., Pan, L.L., Xiu, N.H., Qi, H.D.: Quadratic convergence of smoothing Newton\u2019s method for 0\/1 loss optimization. SIAM J. Optim. 30(4), 3184\u20133211 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"732_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1\u20132), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"732_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"5","key":"732_CR22","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"GY Li","year":"2018","unstructured":"Li, G.Y., Pong, T.K.: Calculus of the exponent of Kurdyka-\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18(5), 1199\u20131232 (2018)","journal-title":"Found. Comput. Math."},{"issue":"4","key":"732_CR23","doi-asserted-by":"publisher","first-page":"3038","DOI":"10.1137\/23M1548293","volume":"33","author":"XX Jia","year":"2023","unstructured":"Jia, X.X., Kanzow, C., Mehlitz, P.: Convergence analysis of the proximal gradient method in the presence of the Kurdyka-\u0141ojasiewicz property without global Lipschitz assumptions. SIAM J. Optim. 33(4), 3038\u20133056 (2023)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"732_CR24","doi-asserted-by":"publisher","first-page":"2557","DOI":"10.1137\/22M1532354","volume":"34","author":"LT Nguyen","year":"2024","unstructured":"Nguyen, L.T., Eberhard, A., Yu, X.H., Li, C.J.: Fast gradient algorithm with dry-like friction and nonmonotone line search for nonconvex optimization problems. SIAM J. Optim. 34(3), 2557\u20132587 (2024)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"732_CR25","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"732_CR26","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1137\/18M1190689","volume":"29","author":"RI Bo\u0163","year":"2019","unstructured":"Bo\u0163, R.I., Csetnek, E.R., Nguyen, D.K.: A proximal minimization algorithm for structured nonconvex and nonsmooth problems. SIAM J. Optim. 29(2), 1300\u20131328 (2019)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"732_CR27","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"732_CR28","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-020-01534-w","volume":"190","author":"SC L\u00e1szl\u00f3","year":"2021","unstructured":"L\u00e1szl\u00f3, S.C.: Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization. Math. Program. 190(1\u20132), 285\u2013329 (2021)","journal-title":"Math. Program."},{"issue":"3","key":"732_CR29","doi-asserted-by":"publisher","first-page":"2134","DOI":"10.1137\/19M1307779","volume":"30","author":"S Adly","year":"2020","unstructured":"Adly, S., Attouch, H.: Finite convergence of proximal-gradient inertial algorithms combining dry friction with Hessian-driven damping. SIAM J. Optim. 30(3), 2134\u20132162 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"732_CR30","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10107-020-01613-y","volume":"193","author":"S Adly","year":"2022","unstructured":"Adly, S., Attouch, H.: First-order inertial algorithms involving dry friction damping. Math. Program. 193(1), 405\u2013445 (2022)","journal-title":"Math. Program."},{"key":"732_CR31","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, 3rd edn. Springer, Berlin (2009)","edition":"3"},{"issue":"5","key":"732_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"Comput. Math. Math. Phys."},{"issue":"1","key":"732_CR33","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"732_CR34","doi-asserted-by":"publisher","first-page":"33","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 $$\\ell _0$$ regularized nonsmooth convex regression problem. J. Sci. Comput. 96(2), 33 (2023)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"732_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00732-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00732-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00732-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T12:01:46Z","timestamp":1769688106000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00732-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,9]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["732"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00732-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,9]]},"assertion":[{"value":"22 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}