[1] Foivos Alimisis, Antonio Orvieto, Gary Becigneul, and Aurelien Lucchi. A continuous-time perspective for modeling acceleration in Riemannian optimization. In Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, pages 1297-1307, 2020.
[2] Hedy Attouch, Zaki Chbani, Juan Peypouquet, and Patrick Redont. Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Mathematical Programming, 168(1):123-175, 2018.
[3] Hedy Attouch, Zaki Chbani, and Hassan Riahi. Rate of convergence of the Nesterov accelerated gradient method in the subcritical case  $\alpha \leq 3$ . ESAIM: Control, Optimisation and Calculus of Variations, 25:2, 2019.
[4] Michael Betancourt, Michael I Jordan, and Ashia C Wilson. On symplectic optimization. arXiv preprint arXiv:1802.03653, 2018.
[5] Etienne De Klerk, François Glineur, and Adrien B Taylor. On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. Optimization Letters, 11:1185-1199, 2017.
[6] Jelena Diakonikolas and Michael I Jordan. Generalized momentum-based methods: A Hamiltonian perspective. SIAM Journal on Optimization, 31(1):915-944, 2021.
[7] Yoel Drori and Adrien B Taylor. Efficient first-order methods for convex minimization: A constructive approach. Mathematical Programming, 184(1-2):183-220, 2020.
[8] Yoel Drori and Marc Teboulle. Performance of first-order methods for smooth convex minimization: A novel approach. Mathematical Programming, 145(1):451-482, 2014.
[9] Mathieu Even, Raphael Berthier, Francis Bach, Nicolas Flammarion, Pierre Gaillard, Hadrien Hendrikx, Laurent Massoulie, and Adrien Taylor. Continuized accelerations of deterministic and stochastic gradient descents, and of gossip algorithms. In Advances in Neural Information Processing Systems, pages 28054-28066.
[10] Mahyar Fazlyab, Alejandro Ribeiro, Manfred Morari, and Victor M Preciado. Analysis of optimization algorithms via integral quadratic constraints: Nonstrongly convex problems. SIAM Journal on Optimization, 28(3):2654-2689, 2018.
[11] Guoyong Gu and Junfeng Yang. On the optimal ergodic sublinear convergence rate of the relaxed proximal point algorithm for variational inequalities. arXiv preprint arXiv:1905.06030, 2019.
[12] Guoyong Gu and Junfeng Yang. Optimal nonergodic sublinear convergence rate of proximal point algorithm for maximal monotone inclusion problems. arXiv preprint arXiv:1904.05495, 2019.
[13] Shuvomoy Das Gupta, Bart PG Van Parys, and Ernest K Ryu. Branch-and-bound performance estimation programming: A unified methodology for constructing optimal optimization methods. arXiv preprint arXiv:2203.07305, 2022.
[14] Bin Hu and Laurent Lessard. Dissipativity theory for Nesterov's accelerated method. In International Conference on Machine Learning, pages 1549-1557. PMLR, 2017.
[15] Bin Hu, Peter Seiler, and Anders Rantzer. A unified analysis of stochastic optimization methods using jump system theory and quadratic constraints. In Conference on Learning Theory, pages 1157-1189. PMLR, 2017.
[16] Donghwan Kim. Accelerated proximal point method for maximally monotone operators. Mathematical Programming, 190(1-2):57-87, 2021.
[17] Donghwan Kim and Jeffrey A Fessler. Optimized first-order methods for smooth convex minimization. Mathematical programming, 159(1):81-107, 2016.