{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T23:40:15Z","timestamp":1769730015278,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T00:00:00Z","timestamp":1762732800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T00:00:00Z","timestamp":1762732800000},"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":["12288201"],"award-info":[{"award-number":["12288201"]}],"id":[{"id":"10.13039\/501100001809","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":[[2026,3]]},"DOI":"10.1007\/s10589-025-00728-2","type":"journal-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T19:00:27Z","timestamp":1762801227000},"page":"651-687","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Symplectic discretization approach for developing new proximal point algorithm"],"prefix":"10.1007","volume":"93","author":[{"given":"Ya-xiang","family":"Yuan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4481-4845","authenticated-orcid":false,"given":"Yi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"728_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-48311-5","edition":"2"},{"issue":"3","key":"728_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1215\/S0012-7094-62-02933-2","volume":"29","author":"GJ Minty","year":"1962","unstructured":"Minty, G.J.: Monotone (nonlinear) operators in Hilbert space. Duke Math. J. 29(3), 341\u2013346 (1962). https:\/\/doi.org\/10.1215\/S0012-7094-62-02933-2","journal-title":"Duke Math. J."},{"key":"728_CR3","series-title":"Lecture Notes in Pure and Applied Mathematics","first-page":"51","volume-title":"Theory and Applications of Nonlinear Operators of Accretive and Monotone Types","author":"JB Baillon","year":"1996","unstructured":"Baillon, J.B., Bruck, R.E.: The rate of asymptotic regularity is $${O}(1\/\\sqrt{n})$$. In: Kartsatos, A.G. (ed.) Theory and Applications of Nonlinear Operators of Accretive and Monotone Types. Lecture Notes in Pure and Applied Mathematics, vol. 178, pp. 51\u201381. Dekker, New York (1996)"},{"issue":"3","key":"728_CR4","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1137\/19M1299049","volume":"30","author":"G Gu","year":"2020","unstructured":"Gu, G., Yang, J.: Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems. SIAM J. Optim. 30(3), 1905\u20131921 (2020). https:\/\/doi.org\/10.1137\/19M1299049","journal-title":"SIAM J. Optim."},{"key":"728_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/9781009160865","volume-title":"Large-Scale Convex Optimization Via Monotone Operators","author":"EK Ryu","year":"2020","unstructured":"Ryu, E.K., Yin, W.: Large-Scale Convex Optimization Via Monotone Operators. Cambridge University Press, Cambridge (2020). https:\/\/doi.org\/10.1017\/9781009160865"},{"key":"728_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/B978-0-12-468660-1.50006-2","volume-title":"Nonlinear Programming","author":"RT Rockafellar","year":"1978","unstructured":"Rockafellar, R.T.: Monotone operators and augmented Lagrangian methods in nonlinear programming. In: Nonlinear Programming, vol. 3, pp. 1\u201325. Academic Press, New York (1978). https:\/\/doi.org\/10.1016\/B978-0-12-468660-1.50006-2"},{"key":"728_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992). https:\/\/doi.org\/10.1007\/BF01581204","journal-title":"Math. Program."},{"key":"728_CR8","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40, 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"issue":"1","key":"728_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal-dual algorithm. Math. Program. 159(1), 253\u2013287 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0957-3","journal-title":"Math. Program."},{"issue":"1","key":"728_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-018-1321-1","volume":"179","author":"D O\u2019Connor","year":"2020","unstructured":"O\u2019Connor, D., Vandenberghe, L.: On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting. Math. Program. 179(1), 85\u2013108 (2020). https:\/\/doi.org\/10.1007\/s10107-018-1321-1","journal-title":"Math. Program."},{"key":"728_CR11","unstructured":"Mokhtari, A., Ozdaglar, A., Pattathil, S.: A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach. In: International Conference on Artificial Intelligence and Statistics, pp. 1497\u20131507 (2020). PMLR"},{"issue":"2","key":"728_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s40305-021-00352-x","volume":"10","author":"X-J Cai","year":"2022","unstructured":"Cai, X.-J., Guo, K., Jiang, F., Wang, K., Wu, Z.-M., Han, D.-R.: The developments of proximal point algorithms. J. Oper. Res. Soc. China 10(2), 197\u2013239 (2022). https:\/\/doi.org\/10.1007\/s40305-021-00352-x","journal-title":"J. Oper. Res. Soc. China"},{"issue":"3","key":"728_CR13","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$o(1\/k^2)$$. Dokl. Akad. Nauk SSSR 269(3), 543 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"1","key":"728_CR14","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), 57\u201387 (2021). https:\/\/doi.org\/10.1007\/s10107-021-01643-0","journal-title":"Math. Program."},{"key":"728_CR15","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, 957\u2013961 (1967). https:\/\/doi.org\/10.1090\/S0002-9904-1967-11864-0","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"728_CR16","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."},{"issue":"15","key":"728_CR17","doi-asserted-by":"publisher","first-page":"1839","DOI":"10.1080\/01630563.2021.2001826","volume":"42","author":"H Qi","year":"2021","unstructured":"Qi, H., Xu, H.-K.: Convergence of Halpern\u2019s iteration method with applications in optimization. Numer. Funct. Anal. Optim. 42(15), 1839\u20131854 (2021). https:\/\/doi.org\/10.1080\/01630563.2021.2001826","journal-title":"Numer. Funct. Anal. Optim."},{"key":"728_CR18","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, 486\u2013491 (1992). https:\/\/doi.org\/10.1007\/BF01190119","journal-title":"Arch. Math."},{"issue":"1","key":"728_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10589-023-00518-8","volume":"87","author":"Q Tran-Dinh","year":"2024","unstructured":"Tran-Dinh, Q.: From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems. Comput. Optim. Appl. 87(1), 181\u2013218 (2024). https:\/\/doi.org\/10.1007\/s10589-023-00518-8","journal-title":"Comput. Optim. Appl."},{"key":"728_CR20","unstructured":"Zhang, G., Gu, Z., Yuan, Y., Sun, D.: HOT: an efficient Halpern accelerating algorithm for optimal transport problems (2024). https:\/\/arxiv.org\/abs\/2408.00598"},{"key":"728_CR21","doi-asserted-by":"crossref","unstructured":"Liang, L., Xu Z., Toh, K.-C., Zhu, J.-J.: An inexact Halpern iteration with application to distributionally robust optimization (2024). https:\/\/arxiv.org\/abs\/2402.06033","DOI":"10.1007\/s10957-025-02744-y"},{"key":"728_CR22","unstructured":"Cai, Y., Oikonomou, A., Zheng, W.: Accelerated algorithms for constrained nonconvex-nonconcave min-max optimization and comonotone inclusion. In: Forty-first International Conference on Machine Learning (2024)"},{"key":"728_CR23","unstructured":"Lee, S., Kim, D.: Fast extra gradient methods for smooth structured nonconvex-nonconcave minimax problems. In: Beygelzimer, A., Dauphin, Y., Liang, P., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems (2021)"},{"key":"728_CR24","unstructured":"Park, J., Ryu, E.K.: Exact optimal accelerated complexity for fixed-point iterations. In: Proceedings of the 39th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 162, pp. 17420\u201317457 (2022). PMLR"},{"key":"728_CR25","unstructured":"Tran-Dinh, Q., Luo, Y.: Halpern-type accelerated and splitting algorithms for monotone inclusions (2021). https:\/\/arxiv.org\/abs\/2110.08150"},{"key":"728_CR26","unstructured":"Yoon, T., Ryu, E.K.: Accelerated algorithms for smooth convex-concave minimax problems with $${O}(1\/k^2)$$ rate on squared gradient norm. In: International Conference on Machine Learning, pp. 12098\u201312109 (2021). PMLR"},{"issue":"153","key":"728_CR27","first-page":"1","volume":"17","author":"W Su","year":"2016","unstructured":"Su, W., Boyd, S., Cand\u00e8s, E.J.: A differential equation for modeling Nesterov\u2019s accelerated gradient method: Theory and insights. J. Mach. Learn. Res. 17(153), 1\u201343 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"728_CR28","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 $$1\/k^2$$. SIAM J. Optim. 26(3), 1824\u20131834 (2016). https:\/\/doi.org\/10.1137\/15M1046095","journal-title":"SIAM J. Optim."},{"key":"728_CR29","unstructured":"Chen, S., Shi, B., Yuan, Y.: On Underdamped Nesterov\u2019s Acceleration (2023). https:\/\/arxiv.org\/abs\/2304.14642"},{"key":"728_CR30","doi-asserted-by":"crossref","unstructured":"Li, B., Shi, B., Yuan, Y.: Proximal subgradient norm minimization of ISTA and FISTA (2022). https:\/\/arxiv.org\/abs\/2211.01610","DOI":"10.2139\/ssrn.4295674"},{"key":"728_CR31","unstructured":"Shi, B., Du, S.S., Su, W., Jordan, M.I.: Acceleration via symplectic discretization of high-resolution differential equations. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"728_CR32","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, 391\u2013432 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1252-x","journal-title":"Math. Program."},{"issue":"4","key":"728_CR33","doi-asserted-by":"publisher","first-page":"3252","DOI":"10.1137\/20M1333316","volume":"30","author":"H Attouch","year":"2020","unstructured":"Attouch, H., L\u00e1szl\u00f3, S.C.: Newton-like inertial dynamics and proximal algorithms governed by maximally monotone operators. SIAM J. Optim. 30(4), 3252\u20133283 (2020). https:\/\/doi.org\/10.1137\/20M1333316","journal-title":"SIAM J. Optim."},{"issue":"6","key":"728_CR34","doi-asserted-by":"publisher","first-page":"2813","DOI":"10.1137\/22M1504305","volume":"61","author":"RI Bo\u0163","year":"2023","unstructured":"Bo\u0163, R.I., Nguyen, D.-K.: Fast Krasnosel\u2019ski\u2013Mann algorithm with a convergence rate of the fixed point iteration of $$\\varvec {{ o} \\left(\\frac{1}{{ k}} \\right)}$$. SIAM J. Numer. Anal. 61(6), 2813\u20132843 (2023). https:\/\/doi.org\/10.1137\/22M1504305","journal-title":"SIAM J. Numer. Anal."},{"key":"728_CR35","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10208-023-09636-5","volume":"25","author":"RI Bo\u0163","year":"2023","unstructured":"Bo\u0163, R.I., Csetnek, E.R., Nguyen, D.-K.: Fast optimistic gradient descent ascent (OGDA) method in continuous and discrete time. Found. Comput. Math. 25, 163\u2013222 (2023). https:\/\/doi.org\/10.1007\/s10208-023-09636-5","journal-title":"Found. Comput. Math."},{"key":"728_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-024-00542-3","author":"Y Yuan","year":"2024","unstructured":"Yuan, Y., Zhang, Y.: Analyze accelerated mirror descent via high-resolution ODEs. J. Oper. Res. Soc. China (2024). https:\/\/doi.org\/10.1007\/s40305-024-00542-3","journal-title":"J. Oper. Res. Soc. China"},{"key":"728_CR37","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10107-021-01681-8","volume":"195","author":"B Shi","year":"2022","unstructured":"Shi, B., Du, S.S., Jordan, M.I., Su, W.J.: Understanding the acceleration phenomenon via high-resolution differential equations. Math. Program. 195, 79\u2013148 (2022). https:\/\/doi.org\/10.1007\/s10107-021-01681-8","journal-title":"Math. Program."},{"key":"728_CR38","volume-title":"Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations","author":"E Hairer","year":"2006","unstructured":"Hairer, E., Wanner, G., Lubich, C.: Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations, vol. 31, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"728_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01777-3","volume-title":"Symplectic Geometric Algorithms for Hamiltonian Systems","author":"MQ Kang Feng","year":"2010","unstructured":"Kang Feng, M.Q.: Symplectic Geometric Algorithms for Hamiltonian Systems. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-01777-3"},{"issue":"3","key":"728_CR40","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3), 167\u2013175 (2003). https:\/\/doi.org\/10.1016\/S0167-6377(02)00231-6","journal-title":"Oper. Res. Lett."},{"key":"728_CR41","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"AS Nemirovski","year":"1983","unstructured":"Nemirovski, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley, Chichester (1983)"},{"key":"728_CR42","doi-asserted-by":"publisher","unstructured":"Attouch, H., Chbani, Z., Riahi, H.: Rate of convergence of the Nesterov accelerated gradient method in the subcritical case $$\\alpha \\leqslant 3$$. ESAIM: COCV 25, 2 (2019) https:\/\/doi.org\/10.1051\/cocv\/2017083","DOI":"10.1051\/cocv\/2017083"},{"key":"728_CR43","unstructured":"Bao, C., Chen, L., Li, J.: The Global R-linear Convergence of Nesterov\u2019s accelerated gradient method with unknown strongly convex parameter (2023). https:\/\/arxiv.org\/abs\/2308.14080"},{"issue":"2","key":"728_CR44","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1137\/23M158111X","volume":"34","author":"B Li","year":"2024","unstructured":"Li, B., Shi, B., Yuan, Y.: Linear convergence of forward-backward accelerated algorithms without knowledge of the modulus of strong convexity. SIAM J. Optim. 34(2), 2150\u20132168 (2024). https:\/\/doi.org\/10.1137\/23M158111X","journal-title":"SIAM J. Optim."},{"issue":"318","key":"728_CR45","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1090\/mcom\/3388","volume":"88","author":"W Tian","year":"2019","unstructured":"Tian, W., Yuan, X.: An alternating direction method of multipliers with a worst-case $${O}(1\/n^2)$$ convergence rate. Math. Comput. 88(318), 1685\u20131713 (2019)","journal-title":"Math. Comput."},{"issue":"4","key":"728_CR46","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1090\/S0002-9904-1967-11761-0","volume":"73","author":"Z Opial","year":"1967","unstructured":"Opial, Z.: Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 73(4), 591\u2013597 (1967). https:\/\/doi.org\/10.1090\/S0002-9904-1967-11761-0","journal-title":"Bull. Am. Math. Soc."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00728-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00728-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00728-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T12:01:54Z","timestamp":1769688114000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00728-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["728"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00728-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"19 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 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":"There is no conflict of interest between the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}