{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T20:10:46Z","timestamp":1774383046054,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T00:00:00Z","timestamp":1692748800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T00:00:00Z","timestamp":1692748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-20-1-2088"],"award-info":[{"award-number":["N00014-20-1-2088"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS-2134107"],"award-info":[{"award-number":["DMS-2134107"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10589-023-00518-8","type":"journal-article","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T15:02:08Z","timestamp":1692802928000},"page":"181-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["From Halpern\u2019s fixed-point iterations to Nesterov\u2019s accelerated interpretations for root-finding problems"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1077-2579","authenticated-orcid":false,"given":"Quoc","family":"Tran-Dinh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,23]]},"reference":[{"issue":"1","key":"518_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10107-019-01412-0","volume":"184","author":"H Attouch","year":"2020","unstructured":"Attouch, H., Cabot, A.: Convergence of a relaxed inertial proximal algorithm for maximally monotone operators. Math. Program. 184(1), 243\u2013287 (2020)","journal-title":"Math. Program."},{"issue":"3","key":"518_CR2","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1137\/22M1474357","volume":"32","author":"H Attouch","year":"2022","unstructured":"Attouch, H., Fadili, J.: From the Ravine method to the Nesterov method and vice versa: A dynamical system perspective. SIAM J. Optim. 32(3), 2074\u20132101 (2022)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"518_CR3","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s accelerated forward-backward method is actually faster than $$\\cal{O} (1\/k^{2})$$. SIAM J. Optim. 26(3), 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"518_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-018-1252-x","volume":"174","author":"H Attouch","year":"2019","unstructured":"Attouch, H., Peypouquet, J.: Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators. Math. Program. 174(1\u20132), 391\u2013432 (2019)","journal-title":"Math. Program."},{"issue":"1","key":"518_CR5","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1006\/jmaa.1996.0308","volume":"202","author":"H Bauschke","year":"1996","unstructured":"Bauschke, H.: The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space. J. Math. Anal. Appl. 202(1), 150\u2013159 (1996)","journal-title":"J. Math. Anal. Appl."},{"key":"518_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex analysis and monotone operators theory in Hilbert spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.: Convex analysis and monotone operators theory in Hilbert spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"key":"518_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-020-01500-6","volume":"189","author":"HH Bauschke","year":"2021","unstructured":"Bauschke, H.H., Moursi, W.M., Wang, X.: Generalized monotone operators and their averaged resolvents. Math. Program. 189, 55\u201374 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"518_CR8","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."},{"key":"518_CR9","unstructured":"Bot, R.I., Csetnek, E.R., Nguyen, D.K.: Fast OGDA in continuous and discrete time. arXiv preprint arXiv:2203.10947, (2022)"},{"key":"518_CR10","doi-asserted-by":"crossref","unstructured":"Bot, R.I., Nguyen, D.K.: Fast Krasnosel\u015bkii-Mann algorithm with a convergence rate of the fixed point iteration of $$o(1\/k)$$. arXiv preprint arXiv:2206.09462 (2022)","DOI":"10.1137\/22M1504305"},{"key":"518_CR11","unstructured":"Bubeck, S., Lee, Y.T., Singh, M.: A geometric alternative to Nesterov\u2019s accelerated gradient descent. arXiv preprint arXiv:1506.08187 (2015)"},{"key":"518_CR12","volume-title":"Set-Valued Mappings and Enlargements of Monotone Operators","author":"RS Burachik","year":"2008","unstructured":"Burachik, R.S., Iusem, A.: Set-Valued Mappings and Enlargements of Monotone Operators. Springer, New York (2008)"},{"issue":"3","key":"518_CR13","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/s10957-015-0746-4","volume":"166","author":"A Chambolle","year":"2015","unstructured":"Chambolle, A., Dossal, C.: On the convergence of the iterates of the Fast iterative shrinkage\/thresholding algorithm. J. Optim. Theory Appl. 166(3), 968\u2013982 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"518_CR14","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 Model. Simul. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"4","key":"518_CR15","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Set-Valued Var. Anal. 25(4), 829\u2013858 (2017)","journal-title":"Set-Valued Var. Anal."},{"key":"518_CR16","unstructured":"Diakonikolas, J.: Halpern iteration for near-optimal and parameter-free monotone inclusion and strong solutions to variational inequalities. In: Conference on Learning Theory, pp. 1428\u20131451. PMLR (2020)"},{"key":"518_CR17","unstructured":"Diakonikolas, J., Daskalakis, C., Jordan, M.: Efficient methods for structured nonconvex-nonconcave min-max optimization. In: International Conference on Artificial Intelligence and Statistics, pp. 2746\u20132754. PMLR (2021)"},{"key":"518_CR18","doi-asserted-by":"crossref","unstructured":"d\u2019Aspremont, A., Scieur, D., Taylor, A.: Acceleration methods. Found. Trends\u00ae Optim. 5(1-2), 1\u2013245 (2021)","DOI":"10.1561\/2400000036"},{"key":"518_CR19","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. 1\u20132. Springer, Berlin (2003)"},{"issue":"6","key":"518_CR20","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1090\/S0002-9904-1967-11864-0","volume":"73","author":"B Halpern","year":"1967","unstructured":"Halpern, B.: Fixed points of nonexpanding maps. Bull. Am. Math. Soc. 73(6), 957\u2013961 (1967)","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"518_CR21","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10107-014-0805-x","volume":"153","author":"B He","year":"2015","unstructured":"He, B., Yuan, X.: On the convergence rate of Douglas-Rachford operator splitting method. Math. Program. 153(2), 715\u2013722 (2015)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"518_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-021-01643-0","volume":"190","author":"D Kim","year":"2021","unstructured":"Kim, D.: Accelerated proximal point method for maximally monotone operators. Math. Program. 190(1\u20132), 57\u201387 (2021)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"518_CR23","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10107-015-0949-3","volume":"159","author":"D Kim","year":"2016","unstructured":"Kim, D., Fessler, J.A.: Optimized first-order methods for smooth convex minimization. Math. Program. 159(1\u20132), 81\u2013107 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"518_CR24","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/j.jmaa.2015.03.020","volume":"428","author":"D K\u00f6rnlein","year":"2015","unstructured":"K\u00f6rnlein, D.: Quantitative results for Halpern iterations of nonexpansive mappings. J. Math. Anal. Appl. 428(2), 1161\u20131172 (2015)","journal-title":"J. Math. Anal. Appl."},{"issue":"4","key":"518_CR25","first-page":"747","volume":"12","author":"GM Korpelevic","year":"1976","unstructured":"Korpelevic, G.M.: An extragradient method for finding saddle-points and for other problems. \u00c8konom. i Mat. Metody. 12(4), 747\u2013756 (1976)","journal-title":"\u00c8konom. i Mat. Metody."},{"issue":"2","key":"518_CR26","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s11228-021-00593-1","volume":"30","author":"F Labarre","year":"2022","unstructured":"Labarre, F., Maing\u00e9, P.-E.: First-order frameworks for continuous Newton-like dynamics governed by maximally monotone operators. Set-Valued Var. Anal. 30(2), 425\u2013451 (2022)","journal-title":"Set-Valued Var. Anal."},{"key":"518_CR27","unstructured":"Lee, S., Kim, D.: Fast extra gradient methods for smooth structured nonconvex-nonconcave minimax problems. In: Thirty-fifth Conference on Neural Information Processing Systems (NeurIPs2021) Vol. 34, pp. 22588\u201322600 (2021)"},{"issue":"2","key":"518_CR28","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s11590-020-01617-9","volume":"15","author":"F Lieder","year":"2021","unstructured":"Lieder, F.: On the convergence rate of the halpern-iteration. Optim. Lett. 15(2), 405\u2013418 (2021)","journal-title":"Optim. Lett."},{"key":"518_CR29","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Num. Anal. 16, 964\u2013979 (1979)","journal-title":"SIAM J. Num. Anal."},{"issue":"2","key":"518_CR30","doi-asserted-by":"publisher","first-page":"2027","DOI":"10.1007\/s00245-021-09819-y","volume":"84","author":"P-E Maing\u00e9","year":"2021","unstructured":"Maing\u00e9, P.-E.: Accelerated proximal algorithms with a correction term for monotone inclusions. Appl. Math. Optim. 84(2), 2027\u20132061 (2021)","journal-title":"Appl. Math. Optim."},{"issue":"3","key":"518_CR31","first-page":"893","volume":"29","author":"PE Maing\u00e9","year":"2022","unstructured":"Maing\u00e9, P.E.: Fast convergence of generalized forward-backward algorithms for structured monotone inclusions. J. Convex Anal. 29(3), 893\u2013920 (2022)","journal-title":"J. Convex Anal."},{"issue":"1","key":"518_CR32","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/14097238X","volume":"25","author":"Y Malitsky","year":"2015","unstructured":"Malitsky, Y.: Projected reflected gradient methods for monotone variational inequalities. SIAM J. Optim. 25(1), 502\u2013520 (2015)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"518_CR33","doi-asserted-by":"publisher","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RDC Monteiro","year":"2010","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: On the complexity of the hybrid proximal extragradient method for the interates and the ergodic mean. SIAM J. Optim. 20(6), 2755\u20132787 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"518_CR34","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovskii","year":"2004","unstructured":"Nemirovskii, A.: Prox-method with rate of convergence $$\\cal{O} (1\/t)$$ for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"key":"518_CR35","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence $${\\cal{O}} (1\/k^2)$$. Doklady AN SSSR, 269, 543\u2013547 (1983). Translated as Soviet Math. Dokl"},{"key":"518_CR36","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization: A basic course, volume 87 of Applied Optimization. Kluwer Academic Publishers (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"issue":"1","key":"518_CR37","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":"1\u20132","key":"518_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01420-0","volume":"185","author":"Y Ouyang","year":"2021","unstructured":"Ouyang, Y., Xu, Y.: Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. Math. Program. 185(1\u20132), 1\u201335 (2021)","journal-title":"Math. Program."},{"key":"518_CR39","unstructured":"Park, J., Ryu, E.K.: Exact optimal accelerated complexity for fixed-point iterations. In: International Conference on Machine Learning $$($$ICML$$)$$, pp. 17420\u201317457. PMLR (2022)"},{"key":"518_CR40","volume-title":"Convex Functions, Monotone Operators and Differentiability","author":"RR Phelps","year":"2009","unstructured":"Phelps, R.R.: Convex Functions, Monotone Operators and Differentiability, vol. 1364. Springer, Berlin (2009)"},{"issue":"5","key":"518_CR41","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. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"5","key":"518_CR42","first-page":"845","volume":"28","author":"LD Popov","year":"1980","unstructured":"Popov, L.D.: A modification of the Arrow\u2013Hurwicz method for search of saddle points. Math. Notes Acad. Sci. USSR 28(5), 845\u2013848 (1980)","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"518_CR43","volume-title":"Variational Analysis","author":"R Rockafellar","year":"2004","unstructured":"Rockafellar, R., Wets, R.: Variational Analysis, vol. 317. Springer, Berlin (2004)"},{"key":"518_CR44","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control. Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control. Optim."},{"issue":"1","key":"518_CR45","first-page":"3","volume":"15","author":"EK Ryu","year":"2016","unstructured":"Ryu, E.K., Boyd, S.: Primer on monotone operator methods. Appl. Comput. Math 15(1), 3\u201343 (2016)","journal-title":"Appl. Comput. Math"},{"issue":"2","key":"518_CR46","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1137\/16M105592X","volume":"27","author":"S Sabach","year":"2017","unstructured":"Sabach, S., Shtern, S.: A first order method for solving convex bilevel optimization problems. SIAM J. Optim. 27(2), 640\u2013660 (2017)","journal-title":"SIAM J. Optim."},{"key":"518_CR47","doi-asserted-by":"crossref","unstructured":"Shi, B., Du, S.S., Jordan, M.I., Su, W.: Understanding the acceleration phenomenon via high-resolution differential equations. Math. Program., pp. 1\u201370 (2021)","DOI":"10.1007\/s10107-021-01681-8"},{"key":"518_CR48","unstructured":"Su, W., Boyd, S., Candes, E.: A differential equation for modeling Nesterov\u2019s accelerated gradient method: Theory and insights. In: Advances in Neural Information Processing Systems (NIPS), pp. 2510\u20132518 (2014)"},{"key":"518_CR49","unstructured":"Tran-Dinh, Q., Luo, Y.: Randomized block-coordinate optimistic gradient algorithms for root-finding problems. arXiv preprint arXiv:2301.03113, (2023)"},{"key":"518_CR50","unstructured":"Tran-Dinh, Q., Luo, Y.: Halpern-type accelerated and splitting algorithms for monotone inclusions. arXiv preprint arXiv:2110.08150 (2021)"},{"issue":"2","key":"518_CR51","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0363012998338806","volume":"38","author":"P Tseng","year":"2000","unstructured":"Tseng, P.: A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control and Optim. 38(2), 431\u2013446 (2000)","journal-title":"SIAM J. Control and Optim."},{"issue":"47","key":"518_CR52","doi-asserted-by":"publisher","first-page":"E7351","DOI":"10.1073\/pnas.1614734113","volume":"113","author":"A Wibisono","year":"2016","unstructured":"Wibisono, A., Wilson, A.C., Jordan, M.I.: A variational perspective on accelerated methods in optimization. Proc. Natl. Acad. Sci. 113(47), E7351\u2013E7358 (2016)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"5","key":"518_CR53","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/BF01190119","volume":"58","author":"R Wittmann","year":"1992","unstructured":"Wittmann, R.: Approximation of fixed points of nonexpansive mappings. Arch. Math. 58(5), 486\u2013491 (1992)","journal-title":"Arch. Math."},{"issue":"1","key":"518_CR54","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1112\/S0024610702003332","volume":"66","author":"H-K Xu","year":"2002","unstructured":"Xu, H.-K.: Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 66(1), 240\u2013256 (2002)","journal-title":"J. Lond. Math. Soc."},{"key":"518_CR55","unstructured":"Yoon, T., Ryu, E.K.: Accelerated algorithms for smooth convex-concave minimax problems with $${\\cal{O}} (1\/k^2)$$ rate on squared gradient norm. In: International Conference on Machine Learning $$($$ICML$$)$$, pp. 12098\u201312109. PMLR (2021)"},{"key":"518_CR56","unstructured":"Yoon, T., Ryu, E.K.: Accelerated minimax algorithms flock together. arXiv preprint arXiv:2205.11093, (2022)"}],"updated-by":[{"DOI":"10.1007\/s10589-025-00746-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000}}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00518-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00518-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00518-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T00:03:11Z","timestamp":1761782591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00518-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,23]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["518"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00518-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,23]]},"assertion":[{"value":"21 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2025","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10589-025-00746-0","URL":"https:\/\/doi.org\/10.1007\/s10589-025-00746-0","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that he has no conflict of interest of any kind.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest."}}]}}