{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T12:59:50Z","timestamp":1782737990815,"version":"3.54.5"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002367","name":"Chinese Academy of Sciences","doi-asserted-by":"crossref","award":["YSBR-034"],"award-info":[{"award-number":["YSBR-034"]}],"id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"crossref","award":["Grant No. 12288201"],"award-info":[{"award-number":["Grant No. 12288201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100019795","name":"National Center for Mathematics and Interdisciplinary Sciences, Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["Startup Fund"],"award-info":[{"award-number":["Startup Fund"]}],"id":[{"id":"10.13039\/501100019795","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s10898-025-01543-z","type":"journal-article","created":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T05:32:56Z","timestamp":1759123976000},"page":"551-569","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Revisiting Nesterov\u2019s acceleration via high-resolution differential equations"],"prefix":"10.1007","volume":"93","author":[{"given":"Shuo","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8616-6180","authenticated-orcid":false,"given":"Bin","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ya-xiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,29]]},"reference":[{"issue":"1","key":"1543_CR1","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(1), 79\u2013148 (2022)","journal-title":"Math. Program."},{"key":"1543_CR2","unstructured":"Chen, S., Shi, B., Yuan, Y.-X.: Gradient norm minimization of Nesterov acceleration: $$ o (1\/k^{3}) $$. arXiv preprint arXiv:2209.08862 (2022)"},{"issue":"5","key":"1543_CR3","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."},{"key":"1543_CR4","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer, New York, NY (1998)"},{"key":"1543_CR5","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate $${o}(1\/k^2)$$. Dokl. Akad. Nauk SSSR 269, 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"1543_CR6","doi-asserted-by":"crossref","unstructured":"Li, B., Shi, B., Yuan, Y.-X.: Proximal subgradient norm minimization of ISTA and FISTA. arXiv preprint arXiv:2211.01610 (2022)","DOI":"10.2139\/ssrn.4295674"},{"issue":"2","key":"1543_CR7","first-page":"295","volume":"137","author":"IM Gelfand","year":"1961","unstructured":"Gelfand, I.M., Tsetlin, M.L.: Principle of the nonlocal search in the systems of automatic optimization. Dokl. Akad. Nauk SSSR 137(2), 295\u2013298 (1961)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"3","key":"1543_CR8","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."},{"key":"1543_CR9","doi-asserted-by":"crossref","unstructured":"Jordan, M.I.: Dynamical, symplectic and stochastic perspectives on gradient-based optimization. In: Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018, pp. 523\u2013549 (2018). World Scientific","DOI":"10.1142\/9789813272880_0022"},{"issue":"113","key":"1543_CR10","first-page":"1","volume":"22","author":"AC Wilson","year":"2021","unstructured":"Wilson, A.C., Recht, B., Jordan, M.I.: A lyapunov analysis of accelerated methods in optimization. J. Mach. Learn. Res. 22(113), 1\u201334 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"1543_CR11","first-page":"1","volume":"195","author":"H Luo","year":"2021","unstructured":"Luo, H., Chen, L.: From differential equation solvers to accelerated first-order methods for convex optimization. Math. Program. 195, 1\u201347 (2021)","journal-title":"Math. Program."},{"key":"1543_CR12","unstructured":"Zhang, P., Orvieto, A., Daneshmand, H., Hofmann, T., Smith, R.S.: Revisiting the role of euler numerical integration on acceleration and stability in convex optimization. In: International Conference on Artificial Intelligence and Statistics, pp. 3979\u20133987 (2021). PMLR"},{"key":"1543_CR13","first-page":"1","volume":"193","author":"H Attouch","year":"2020","unstructured":"Attouch, H., Chbani, Z., Fadili, J., Riahi, H.: First-order optimization algorithms via inertial systems with hessian driven damping. Math. Program. 193, 1\u201343 (2020)","journal-title":"Math. Program."},{"issue":"1","key":"1543_CR14","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1137\/130910294","volume":"24","author":"H Attouch","year":"2014","unstructured":"Attouch, H., Peypouquet, J., Redont, P.: A dynamical approach to an inertial forward-backward algorithm for convex minimization. SIAM J. Optim. 24(1), 232\u2013256 (2014)","journal-title":"SIAM J. Optim."},{"key":"1543_CR15","unstructured":"Muehlebach, M., Jordan, M.: A dynamical systems perspective on Nesterov acceleration. In: International Conference on Machine Learning, pp. 4656\u20134662 (2019). PMLR"},{"key":"1543_CR16","unstructured":"Shi, B.: On the hyperparameters in stochastic gradient descent with momentum. arXiv preprint arXiv:2108.03947 (2021)"},{"key":"1543_CR17","first-page":"18646","volume":"34","author":"H Xia","year":"2021","unstructured":"Xia, H., Suliafu, V., Ji, H., Nguyen, T., Bertozzi, A., Osher, S., Wang, B.: Heavy ball neural ordinary differential equations. Adv. Neural. Inf. Process. Syst. 34, 18646\u201318659 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1543_CR18","doi-asserted-by":"crossref","unstructured":"Sun, B., George, J., Kia, S.: High-resolution modeling of the fastest first-order optimization method for strongly convex functions. In: 2020 59th IEEE Conference on Decision and Control (CDC), pp. 4237\u20134242 (2020). IEEE","DOI":"10.1109\/CDC42340.2020.9304444"},{"issue":"1","key":"1543_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/LCSYS.2017.2722406","volume":"2","author":"B Van Scoy","year":"2017","unstructured":"Van Scoy, B., Freeman, R.A., Lynch, K.M.: The fastest known globally convergent first-order method for minimizing strongly convex functions. IEEE Control Systems Letters 2(1), 49\u201354 (2017)","journal-title":"IEEE Control Systems Letters"},{"key":"1543_CR20","doi-asserted-by":"crossref","unstructured":"Cyrus, S., Hu, B., Van\u00a0Scoy, B., Lessard, L.: A robust accelerated optimization algorithm for strongly convex functions. In: 2018 Annual American Control Conference (ACC), pp. 1376\u20131381 (2018). IEEE","DOI":"10.23919\/ACC.2018.8430824"},{"key":"1543_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2021.101590","volume":"68","author":"Y Drori","year":"2022","unstructured":"Drori, Y., Taylor, A.: On the oracle complexity of smooth strongly convex minimization. J. Complex. 68, 101590 (2022)","journal-title":"J. Complex."},{"key":"1543_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-order Methods in Optimization. SIAM, Philadelphia, PA (2017)"},{"key":"1543_CR23","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. Unpublished note (2008)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01543-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-025-01543-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01543-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T09:49:59Z","timestamp":1761904199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-025-01543-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,29]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1543"],"URL":"https:\/\/doi.org\/10.1007\/s10898-025-01543-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,29]]},"assertion":[{"value":"23 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 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":"(check journal-specific guidelines for which heading to use): The authors have no relevant financial or non-financial interests to disclose. No data and code sets were used in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest\/Competing interests"}}]}}