{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T05:03:49Z","timestamp":1784869429489,"version":"3.55.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T00:00:00Z","timestamp":1782691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T00:00:00Z","timestamp":1782691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G081222N"],"award-info":[{"award-number":["G081222N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"name":"UA BOF DocPRO4 project","award":["46929"],"award-info":[{"award-number":["46929"]}]},{"name":"UA BOF DocPRO4 project","award":["48996"],"award-info":[{"award-number":["48996"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s10957-026-03047-6","type":"journal-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T06:22:59Z","timestamp":1782714179000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Fundamental Properties of High-Order Forward-Backward Envelope"],"prefix":"10.1007","volume":"210","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6554-6969","authenticated-orcid":false,"given":"Alireza","family":"Kabgani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4206-9789","authenticated-orcid":false,"given":"Masoud","family":"Ahookhosh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,29]]},"reference":[{"issue":"3","key":"3047_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00186-019-00674-w","volume":"89","author":"M Ahookhosh","year":"2019","unstructured":"Ahookhosh, M.: Accelerated first-order methods for large-scale convex optimization: Nearly optimal complexity under strong convexity. Math. Methods Oper. Res. 89(3), 319\u2013353 (2019)","journal-title":"Math. Methods Oper. Res."},{"key":"3047_CR2","doi-asserted-by":"crossref","unstructured":"Ahookhosh, M., Nesterov, Y.: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods with segment search, (2021). arXiv:2109.12303","DOI":"10.1137\/20M134705X"},{"key":"3047_CR3","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-023-02041-4","volume":"208","author":"M Ahookhosh","year":"2024","unstructured":"Ahookhosh, M., Nesterov, Y.: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods. Math. Program. 208, 365\u2013407 (2024)","journal-title":"Math. Program."},{"issue":"1","key":"3047_CR4","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/19M1264783","volume":"31","author":"M Ahookhosh","year":"2021","unstructured":"Ahookhosh, M., Themelis, A., Patrinos, P.: A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: Superlinear convergence to nonisolated local minima. SIAM J. Optim. 31(1), 653\u2013685 (2021)","journal-title":"SIAM J. Optim."},{"key":"3047_CR5","doi-asserted-by":"publisher","unstructured":"Ahookhosh, M., Iusem, A., Kabgani, A., Lara, F.: Asymptotic convergence analysis of high-order proximal-point methods beyond sublinear rates. https:\/\/doi.org\/10.48550\/arXiv.2505.20484arXiv:2505.20484 (2025)","DOI":"10.48550\/arXiv.2505.20484"},{"key":"3047_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10957-026-03034-x","volume":"210","author":"M Ahookhosh","year":"2026","unstructured":"Ahookhosh, M., Ghaderi, S., Kabgani, A., Rahimi, M.: Minimizing smooth Kurdyka-\u0141ojasiewicz functions via generalized descent methods: Convergence rate and complexity. J. Optim. Theory Appl. 210, 13 (2026)","journal-title":"J. Optim. Theory Appl."},{"key":"3047_CR7","doi-asserted-by":"crossref","unstructured":"Bauschke, H., Combettes, P.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, Springer International Publishing (2017). (2nd edn)","DOI":"10.1007\/978-3-319-48311-5"},{"key":"3047_CR8","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-Order Methods in Optimization. Society for Industrial and Applied Mathematics , (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"3047_CR9","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/100818327","volume":"22","author":"A Beck","year":"2012","unstructured":"Beck, A., Teboulle, M.: Smoothing and first order methods: A unified framework. SIAM J. Optim. 22, 557\u2013580 (2012)","journal-title":"SIAM J. Optim."},{"key":"3047_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Teboulle, M.: A smoothing technique for nondifferentiable optimization problems. In: Dolecki S (ed) Optimization: Proceedings of the Fifth French-German Conference held in Castel-Novel (Varetz), France, Oct. 3\u20138, 1988, Lecture Notes in Mathematics, No. 1405, Springer-Verlag, pp 1\u201311 (1989)","DOI":"10.1007\/BFb0083582"},{"key":"3047_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10957-020-01632-x","volume":"185","author":"GO Berger","year":"2020","unstructured":"Berger, G.O., Absil, P.A., Jungers, R.M., Nesterov, Y.: On the quality of first-order approximation of functions with H\u00f6lder continuous gradient. J. Optim. Theory Appl. 185, 17\u201333 (2020)","journal-title":"J. Optim. Theory Appl."},{"key":"3047_CR12","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont, MA (1999)","edition":"2"},{"key":"3047_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5802\/ojmo.24","volume":"4","author":"J Bolte","year":"2023","unstructured":"Bolte, J., Glaudin, L., Pauwels, E., Serrurier, M.: The backtrack H\u00f6lder gradient method with application to min-max and min-min problems. Open Journal of Mathematical Optimization 4, 1\u201317 (2023)","journal-title":"Open Journal of Mathematical Optimization"},{"issue":"2","key":"3047_CR14","doi-asserted-by":"publisher","first-page":"1314","DOI":"10.1137\/24M1675977","volume":"18","author":"S Bonettini","year":"2025","unstructured":"Bonettini, S., Franchini, G., Pezzi, D., Prato, M.: Linesearch-enhanced forward-backward methods for inexact nonconvex scenarios. SIAM J. Imag. Sci. 18(2), 1314\u20131343 (2025)","journal-title":"SIAM J. Imag. Sci."},{"key":"3047_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10915-020-01332-8","volume":"85","author":"RI Bo\u0163","year":"2020","unstructured":"Bo\u0163, R.I., B\u00f6hm, A.: Variable smoothing for convex optimization problems using stochastic gradients. J. Sci. Comput. 85, 33 (2020)","journal-title":"J. Sci. Comput."},{"key":"3047_CR16","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/s11750-014-0326-z","volume":"23","author":"RI Bo\u1e6d","year":"2015","unstructured":"Bo\u1e6d, R.I., Hendrich, C.: A variable smoothing algorithm for solving convex optimization problems. TOP 23, 124\u2013150 (2015)","journal-title":"TOP"},{"key":"3047_CR17","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/25\/1\/015005","volume":"25","author":"K Bredies","year":"2009","unstructured":"Bredies, K.: A forward\u2013backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space. Inverse Prob. 25, 015005 (2009)","journal-title":"Inverse Prob."},{"key":"3047_CR18","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1137\/120889812","volume":"23","author":"JV Burke","year":"2013","unstructured":"Burke, J.V., Hoheisel, T.: Epi-convergent smoothing with applications to convex composite functions. SIAM J. Optim. 23, 1457\u20131479 (2013)","journal-title":"SIAM J. Optim."},{"key":"3047_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11228-016-0362-y","volume":"25","author":"JV Burke","year":"2017","unstructured":"Burke, J.V., Hoheisel, T.: Epi-convergence properties of smoothing by infimal convolution. Set-Valued and Variational Analysis 25, 1\u201323 (2017)","journal-title":"Set-Valued and Variational Analysis"},{"key":"3047_CR20","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s11228-013-0235-6","volume":"21","author":"JV Burke","year":"2013","unstructured":"Burke, J.V., Hoheisel, T., Kanzow, C.: Gradient consistency for integral-convolution smoothing functions. Set-Valued and Variational Analysis 21, 359\u2013376 (2013)","journal-title":"Set-Valued and Variational Analysis"},{"key":"3047_CR21","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1080\/10556788.2016.1268136","volume":"32","author":"C Cartis","year":"2017","unstructured":"Cartis, C., Gould, N., Toint, P.: Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using H\u00f6lder continuous gradients. Optimization Methods and Software 32, 1273\u20131298 (2017)","journal-title":"Optimization Methods and Software"},{"key":"3047_CR22","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."},{"issue":"4","key":"3047_CR23","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Modeling & Simulation 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Modeling & Simulation"},{"key":"3047_CR24","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","volume":"178","author":"D Drusvyatskiy","year":"2019","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. 178, 503\u2013558 (2019)","journal-title":"Math. Program."},{"key":"3047_CR25","volume":"464","author":"S Ghaderi","year":"2024","unstructured":"Ghaderi, S., Ahookhosh, M., Arany, A., Skupin, A., Patrinos, P., Moreau, Y.: Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions. Appl. Math. Comput. 464, 128377 (2024)","journal-title":"Appl. Math. Comput."},{"key":"3047_CR26","unstructured":"Kabgani, A., Ahookhosh, M.: ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope. arXiv arxiv:2410.19928 (2024)"},{"key":"3047_CR27","doi-asserted-by":"publisher","unstructured":"Kabgani, A., Ahookhosh, M.: First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method. arXiv https:\/\/doi.org\/10.48550\/arXiv.2510.22231 (2025a)","DOI":"10.48550\/arXiv.2510.22231"},{"key":"3047_CR28","doi-asserted-by":"publisher","unstructured":"Kabgani, A., Ahookhosh, M.: ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization. arXiv https:\/\/doi.org\/10.48550\/arXiv.2501.02155 (2025b)","DOI":"10.48550\/arXiv.2501.02155"},{"key":"3047_CR29","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s11228-025-00785-z","volume":"33","author":"A Kabgani","year":"2025","unstructured":"Kabgani, A., Ahookhosh, M.: Moreau envelope and proximal-point methods under the lens of high-order regularization. Set-Valued and Variational Analysis 33, 47 (2025)","journal-title":"Set-Valued and Variational Analysis"},{"key":"3047_CR30","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.na.2015.06.015","volume":"127","author":"I Kecis","year":"2015","unstructured":"Kecis, I., Thibault, L.: Moreau envelopes of $$s$$-lower regular functions. Nonlinear Analysis: Theory, Methods & Applications 127, 157\u2013181 (2015)","journal-title":"Nonlinear Analysis: Theory, Methods & Applications"},{"key":"3047_CR31","doi-asserted-by":"crossref","unstructured":"Lange, K.: MM Optimization Algorithms. Society for Industrial and Applied Mathematics , (2016)","DOI":"10.1137\/1.9781611974409"},{"key":"3047_CR32","doi-asserted-by":"crossref","unstructured":"Mordukhovich, B.S.: Variational Analysis and Applications. Springer Cham (2018)","DOI":"10.1007\/978-3-319-92775-6"},{"key":"3047_CR33","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau, J.J.: Proximit\u00e9 et dualit\u00e9 dans un espace Hilbertien. Bull. Soc. Math. France 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. France"},{"key":"3047_CR34","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, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"3047_CR35","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152, 381\u2013404 (2015)","journal-title":"Math. Program."},{"key":"3047_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-021-01727-x","volume":"197","author":"Y Nesterov","year":"2023","unstructured":"Nesterov, Y.: Inexact accelerated high-order proximal-point methods. Math. Program. 197, 1\u201326 (2023)","journal-title":"Math. Program."},{"key":"3047_CR37","doi-asserted-by":"crossref","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Foundations and Trends\u00ae in Optimization 1, 127\u2013239 (2014)","DOI":"10.1561\/2400000003"},{"key":"3047_CR38","doi-asserted-by":"crossref","unstructured":"Patrinos, P., Bemporad, A.: Proximal Newton methods for convex composite optimization. In: 52nd IEEE Conference on Decision and Control, pp. 2358\u20132363. IEEE (2013)","DOI":"10.1109\/CDC.2013.6760233"},{"key":"3047_CR39","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1090\/S0002-9947-96-01544-9","volume":"348","author":"RA Poliquin","year":"1996","unstructured":"Poliquin, R.A., Rockafellar, R.T.: Prox-regular functions in variational analysis. Trans. Am. Math. Soc. 348, 1805\u20131838 (1996)","journal-title":"Trans. Am. Math. Soc."},{"key":"3047_CR40","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin, Heidelberg (2009)"},{"key":"3047_CR41","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10957-020-01653-6","volume":"185","author":"A Rodomanov","year":"2020","unstructured":"Rodomanov, A., Nesterov, Y.: Smoothness parameter of power of Euclidean norm. J. Optim. Theory Appl. 185, 303\u2013326 (2020)","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20132","key":"3047_CR42","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1007\/s10107-015-0952-8","volume":"159","author":"R Shefi","year":"2016","unstructured":"Shefi, R., Teboulle, M.: A dual method for minimizing a nonsmooth objective over one smooth inequality constraint. Math. Program. 159(1\u20132), 1370\u2013164 (2016)","journal-title":"Math. Program."},{"key":"3047_CR43","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-017-9912-y","volume":"67","author":"L Stella","year":"2017","unstructured":"Stella, L., Themelis, A., Patrinos, P.: Forward\u2013backward quasi-Newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67, 443\u2013487 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"3047_CR44","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/TSP.2016.2601299","volume":"65","author":"Y Sun","year":"2016","unstructured":"Sun, Y., Babu, P., Palomar, D.P.: Majorization-minimization algorithms in signal processing, communications, and machine learning. IEEE Trans. Signal Process. 65(3), 794\u2013816 (2016)","journal-title":"IEEE Trans. Signal Process."},{"key":"3047_CR45","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/18M1163993","volume":"30","author":"A Themelis","year":"2020","unstructured":"Themelis, A., Patrinos, P.: Douglas-Rachford splitting and ADMM for nonconvex optimization: Tight convergence results. SIAM J. Optim. 30, 149\u2013181 (2020)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"3047_CR46","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/16M1080240","volume":"28","author":"A Themelis","year":"2018","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward-backward envelope for the sum of two nonconvex functions: Further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28(3), 2274\u20132303 (2018)","journal-title":"SIAM J. Optim."},{"key":"3047_CR47","doi-asserted-by":"crossref","unstructured":"Themelis, A., Ahookhosh, M., Patrinos, P.: On the acceleration of forward-backward splitting via an inexact Newton method. In: Bauschke, H.H., Burachik, R.S., Luke, D.R. (eds.) Splitting Algorithms, Modern Operator Theory, and Applications, pp. 363\u2013412. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-25939-6_15"},{"key":"3047_CR48","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1007\/s11590-015-0936-x","volume":"10","author":"M Yashtini","year":"2016","unstructured":"Yashtini, M.: On the global convergence rate of the gradient descent method for functions with H\u00f6lder continuous gradients. Optimization Letters 10, 1361\u20131370 (2016)","journal-title":"Optimization Letters"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03047-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-03047-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03047-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T04:51:22Z","timestamp":1784868682000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-03047-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,29]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["3047"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-03047-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,29]]},"assertion":[{"value":"23 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"14"}}