K. Ahn and S. Sra. Understanding nesterov's acceleration via proximal point method. In Symposium on Simplicity in Algorithms (SOSA), pages 117-130. SIAM, 2022.
H. Attouch, Z. Chbani, J. Fadili, and H. Riahi. First-order optimization algorithms via inertial systems with hessian driven damping. Mathematical Programming, pages 1-43, 2020.
H. Attouch, Z. Chbani, J. Fadili, and H. Riahi. Convergence of iterates for first-order optimization algorithms with inertia and hessian driven damping. Optimization, pages 1-40, 2021.
L. Bottou. Large-scale machine learning with stochastic gradient descent. In Proceedings of COMP-STAT'2010: 19th International Conference on Computational Statistics Paris France, August 22-27, 2010 Keynote, Invited and Contributed Papers, pages 177-186. Springer, 2010.
C. M. Campos, A. Mahillo, and D. M. de Diego. A discrete variational derivation of accelerated methods in optimization. arXiv preprint arXiv:2106.02700, 2021.
S. Chen, B. Shi, and Y.-x. Yuan. Gradient norm minimization of nesterov acceleration:  $o(1 / k^3)$ . arXiv preprint arXiv:2209.08862, 2022.
A. Defazio, F. Bach, and S. Lacoste-Julien. Saga: A fast incremental gradient method with support for non-strongly convex composite objectives. Advances in neural information processing systems, 27, 2014.
M. Fazlyab, A. Koppel, V. M. Preciado, and A. Ribeiro. A variational approach to dual methods for constrained convex optimization. In 2017 American Control Conference (ACC), pages 5269-5275, 2017. doi: 10.23919/ACC.2017.7963773.
M. Fazlyab, A. Ribeiro, M. Morari, and V. M. Preciado. Analysis of optimization algorithms via integral quadratic constraints: Nonstrongly convex problems. SIAM Journal on Optimization, 28(3):2654-2689, 2018. doi: 10.1137/17M1136845. URL https://doi.org/10.1137/17M1136845.
B. Hu and L. Lessard. Dissipativity theory for nesterov's accelerated method. In International Conference on Machine Learning, pages 1549-1557. PMLR, 2017.
R. Johnson and T. Zhang. Accelerating stochastic gradient descent using predictive variance reduction. Advances in neural information processing systems, 26, 2013.
H. K. Khalil. Nonlinear systems third edition. Patience Hall, 115, 2002.
A. Krizhevsky, G. Hinton, et al. Learning multiple layers of features from tiny images. Toronto, ON, Canada, 2009.
M. Laborde and A. Oberman. A lyapunov analysis for accelerated gradient methods: from deterministic to stochastic case. In S. Chiappa and R. Calandra, editors, Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, volume 108 of Proceedings of Machine Learning Research, pages 602-612. PMLR, 26-28 Aug 2020. URL https://proceedings.mlr.press/v108/laborde20a.html.
L. Lessard, B. Recht, and A. Packard. Analysis and design of optimization algorithms via integral quadratic constraints. SIAM J. Optim., 26:57-95, 2016.
M. Muehlebach and M. Jordan. A dynamical systems perspective on nesterov acceleration. In International Conference on Machine Learning, pages 4656-4662. PMLR, 2019.
M. Muehlebach and M. I. Jordan. On constraints in first-order optimization: A view from nonsmooth dynamical systems. Journal of Machine Learning Research, 23(256):1-47, 2022.
M. Muehlebach and M. I. Jordan. Accelerated first-order optimization under nonlinear constraints. arXiv preprint arXiv:2302.00316, 2023.
Y. Nesterov. A method for solving the convex programming problem with convergence rate  $o(1 / k^2)$ . Proceedings of the USSR Academy of Sciences, 269:543-547, 1983.