Nesterov, Y. E. (1983). A method for solving the convex programming problem with convergence rate  $O(1 / k^2)$ . Dokl. Akad. Nauk SSSR, 269(3):543-547.
Polyak, B. T. (1963). Gradient methods for the minimisation of functionals. USSR Comput. Math. Math. Phys., 3(4):864-878.
Polyak, B. T. (1964). Some methods of speeding up the convergence of iterative methods. *USSR Comput. Math. Math. Phys.*, 4(5):1-17.
Quispel, G. R. W. and Capel, H. W. (1996). Solving ODE's numerically while preserving a first integral. Phys. Lett., 218A:223-228.
Quispel, G. R. W. and McLaren, D. I. (2008). A new class of energy-preserving numerical integration methods. J. Phys. A, 41(4):045206, 7.
Riis, E. S., Ehrhardt, M. J., Quispel, G. R. W., and Schonlieb, C.-B. (2022). A geometric integration approach to nonsmooth, nonconvex optimisation. Found. Comput. Math., 22(5):1351-1394.
Ringholm, T., Lazic, J., and Schonlieb, C.-B. (2018). Variational image regularization with Euler's elastica using a discrete gradient scheme. SIAM J. Imaging Sci., 11(4):2665-2691.
Shi, B., Du, S. S., Su, W., and Jordan, M. I. (2019). Acceleration via symplectic discretization of high-resolution differential equations. In Advances in Neural Information Processing Systems, volume 32.
Su, W., Boyd, S., and Candès, E. J. (2014). A differential equation for modeling nesterov's accelerated gradient method: theory and insights. Advances in neural information processing systems, 27.
Su, W., Boyd, S., and Candès, E. J. (2016). A differential equation for modeling Nesterov's accelerated gradient method: theory and insights. *J. Mach. Learn. Res.*, 17(153):1-43.
Suh, J. J., Roh, G., and Ryu, E. K. (2022). Continuous-time analysis of accelerated gradient methods via conservation laws in dilated coordinate systems. In Proceedings of the 39th International Conference on Machine Learning, pages 20640-20667.
Sun, B., George, J., and Kia, S. (2020). High-resolution modeling of the fastest first-order optimization method for strongly convex functions. In 2020 59th IEEE Conference on Decision and Control (CDC), pages 4237-4242.
Taylor, A. and Drori, Y. (2022a). An optimal gradient method for smooth strongly convex minimization. Math. Program., pages 1-38.
Taylor, A. and Drori, Y. (2022b). An optimal gradient method for smooth strongly convex minimization. Mathematical Programming, pages 1-38.
Taylor, A., Van Scoy, B., and Lessard, L. (2018). Lyapunov functions for first-order methods: Tight automated convergence guarantees. In International Conference on Machine Learning, pages 4897-4906.
Ushiyama, K., Sato, S., and Matsuo, T. (2022a). Deriving efficient optimization methods based on stable explicit numerical methods. JSIAM Lett., 14:29-32.
Ushiyama, K., Sato, S., and Matsuo, T. (2022b). Essential convergence rate of ordinary differential equations appearing in optimization. JSIAM Lett., 14:119-122.
Van Scoy, B., Freeman, R. A., and Lynch, K. M. (2018). The fastest known globally convergent first-order method for minimizing strongly convex functions. IEEE Control Syst. Lett., 2(1):49-54.
Wilson, A. (2018). Lyapunov arguments in optimization. University of California, Berkeley.
Wilson, A. C., Recht, B., and Jordan, M. I. (2021). A Lyapunov analysis of accelerated methods in optimization. J. Mach. Learn. Res., 22(113):1-34.
Zhang, J., Mokhtari, A., Sra, S., and Jabbabaie, A. (2018). Direct runge-kutta discretization achieves acceleration. In Advances in Neural Information Processing Systems, volume 31.