{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:59:52Z","timestamp":1787507992583,"version":"build-2736575974"},"reference-count":42,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["W 1260"],"award-info":[{"award-number":["W 1260"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 34922-N"],"award-info":[{"award-number":["P 34922-N"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2026,9,30]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>In this paper, we introduce a novel extragradient method with anchor term governed by general parameters. Our method is derived from an explicit discretization of a Tikhonov-regularized monotone flow in Hilbert space, which provides a theoretical foundation for analyzing its convergence properties. We establish strong convergence to specific points within the solution set, as well as convergence rates expressed in terms of the regularization parameters. Notably, our approach recovers the fast residual decay rate [Formula: see text] for standard parameter choices. Numerical experiments highlight the competitiveness of the method and demonstrate how its flexible design enhances practical performance.<\/jats:p>","DOI":"10.1137\/24m1703562","type":"journal-article","created":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T18:33:32Z","timestamp":1783535612000},"page":"1420-1445","source":"Crossref","is-referenced-by-count":1,"title":["Extragradient Method with Flexible Anchoring: Strong Convergence and Fast Residual Decay"],"prefix":"10.1137","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4469-314X","authenticated-orcid":true,"given":"Radu I.","family":"Bo\u0163","sequence":"first","affiliation":[{"name":"Faculty of Mathematics, University of Vienna, Oskar-Morgenstern-Platz 1, 1090 Vienna, Austria."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5848-8385","authenticated-orcid":true,"given":"Enis","family":"Chenchene","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, University of Vienna, Oskar-Morgenstern-Platz 1, 1090 Vienna, Austria."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2026,7,8]]},"reference":[{"key":"ref1","first-page":"17526","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Ahn K.","year":"2020"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.na.2010.06.070"},{"key":"ref3","unstructured":"W. Azizian, I. Mitliagkas, S. Lacoste-Julien, and G. Gidel, A tight and unified analysis of gradient-based methods for a whole spectrum of differentiable games, in Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, Proc. Mach. Learn. Res. 108, PMLR, 2020, pp. 2863\u20132873."},{"key":"ref4","first-page":"5","volume":"2","author":"Baillon J.-B.","year":"1976","journal-title":"Houston J. Math."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/22M1504305"},{"key":"ref7","doi-asserted-by":"crossref","unstructured":"R. I. Bo\u0163 and D.K. Nguyen, Tikhonov regularization of monotone operator flows not only ensures strong convergence of the Trajectories but also speeds up the vanishing of the residuals, 94 (2024), 102029, https:\/\/doi.org\/10.1016\/j.jco.2026.102029.","DOI":"10.1016\/j.jco.2026.102029"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/22M1535097"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1967-11820-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0022-1236(75)90027-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.52202\/068431-2457"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728716"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jde.2008.08.007"},{"key":"ref15","volume-title":"Advances in Neural Information Processing Systems","volume":"27","author":"Goodfellow I.","year":"2014"},{"key":"ref16","unstructured":"E. Gorbunov, N. Loizou, and G. Gidel, Extragradient method: \\({O}(1\/k)\\) last-iterate convergence for monotone variational inequalities and connections with cocoercivity, in Proceedings of the 25th International Conference on Artificial Intelligence and Statistics, Proc. Mach. Learn. Res. 151, PMLR, 2022, pp. 366\u2013402."},{"key":"ref17","volume-title":"Ordinary Differential Equations","author":"Hale J. K.","year":"2009"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1967-11864-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(81)90245-6"},{"key":"ref20","unstructured":"L. Jiang, X. Li, A. Milzarek, and J. Qiu, A Generalized Version of Chung\u2019s Lemma and Its Applications, https:\/\/arxiv.org\/abs\/2406.05637, 2024."},{"key":"ref21","first-page":"747","volume":"12","author":"Korpelevich G. M.","year":"1976","journal-title":"Ekon. Mat. Metody"},{"key":"ref22","unstructured":"S. Lee and D. Kim, Fast extra gradient methods for smooth structured nonconvex-nonconcave minimax problems, in Proceedings of the 35th International Conference on Neural Information Processing Systems, NIPS \u201921, Curran Associates, 2024."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-020-01617-9"},{"key":"ref24","first-page":"1357","volume":"284","author":"Lions P.-L.","year":"1977","journal-title":"C. R. Acad. Sci. S\u00e9r. A"},{"key":"ref25","volume-title":"Advances in Neural Information Processing Systems, Vol. 24","author":"Moulines E.","year":"2011"},{"key":"ref26","series-title":"Wiley-Interscience Ser. Discrete Math.","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovski A. S.","year":"1983"},{"key":"ref27","unstructured":"J. Park and E. K. Ryu, Exact optimal accelerated complexity for fixed-point iterations, in Proceedings of the 39th International Conference on Machine Learning, Proc. Mach. Learn. Res. 162, PMLR, 2022, pp. 17420\u201317457."},{"key":"ref28","volume-title":"Introduction to Optimization","author":"Polyak B. T.","year":"1987"},{"key":"ref29","first-page":"845","volume":"28","author":"Popov L. D.","year":"1980","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0362-546X(97)90001-8"},{"key":"ref31","first-page":"23","volume":"4","author":"Reich S.","year":"1994","journal-title":"PanAmer. Math. J."},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1090\/pspum\/018.1\/0285942"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01403-1"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/16M105592X"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.52202\/075280-1422"},{"key":"ref36","unstructured":"J. J. Suh, J. Park, and E. K. Ryu, Continuous-time analysis of anchor acceleration, in Proceedings of the 37th International Conference on Neural Information Processing Systems, NIPS \u201923, Curran Associates, 2024."},{"key":"ref37","unstructured":"Q. Tran-Dinh and Y. Luo, Halpern-Type Accelerated and Splitting Algorithms for Monotone Inclusions, https:\/\/arxiv.org\/abs\/2110.08150, 2021."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-025-02322-0"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01190119"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1112\/S0024610702003332"},{"key":"ref41","unstructured":"T. Yoon and E. K. Ryu, Accelerated algorithms for smooth convex-concave minimax problems with O(1\/\\(k^2\\)) rate on squared gradient norm, in Proceedings of the 38th International Conference on Machine Learning, Proc. Mach. Learn. Res. 139, PMLR, 2021, pp. 12098\u201312109."},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/22M1504597"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T18:33:38Z","timestamp":1783535618000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/24M1703562"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,8]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9,30]]}},"alternative-id":["10.1137\/24M1703562"],"URL":"https:\/\/doi.org\/10.1137\/24m1703562","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,8]]}}}