[1] Abraham, R. and Marsden, J. E. Foundations of mechanics. Number 364. American Mathematical Soc., 2008.
[2] Absil, P.-A., Mahony, R., and Sepulchre, R. Optimization Algorithms on Matrix Manifolds. Princeton University Press, 2008.
[3] Alvarez, F., Bolte, J., and Brahic, O. Hessian Riemannian gradient flows in convex programming. SIAM Journal on Control and Optimization, 43(2):477-501, 2004.
[4] Amari, S.-I. Natural gradient works efficiently in learning. Neural computation, 10(2):251-276, 1998.
[5] Antonakopoulos, K., Belmega, E. V., and Mertikopoulos, P. Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach. In *ICLR '20: Proceedings of the 2020 International Conference on Learning Representations*, 2020.
[6] Antonakopoulos, K., Mertikopoulos, P., Piliouras, G., and Wang, X. AdaGrad avoids saddle points. In ICML '22: Proceedings of the 39th International Conference on Machine Learning, 2022.
[7] Azizian, W., Iutzeler, F., Malick, J., and Mertikopoulos, P. On the rate of convergence of Bregman proximal methods in constrained variational inequalities. http://arxiv.org/abs/2211.08043, 2022.
[8] Bauschke, H. H., Bolte, J., and Teboulle, M. A descent lemma beyond Lipschitz gradient continuity: First-order methods revisited and applications. Mathematics of Operations Research, 42(2):330-348, May 2017.
[9] Beck, A. and Teboulle, M. Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31(3):167-175, 2003.
[10] Benaim, M. Dynamics of stochastic approximation algorithms. In Azéma, J., Émery, M., Ledoux, M., and Yor, M. (eds.), Séminaire de Probabilités XXXIII, volume 1709 of Lecture Notes in Mathematics, pp. 1-68. Springer Berlin Heidelberg, 1999.
[11] Benaim, M. and Hirsch, M. W. Dynamics of Morse-Smale urn processes. *Ergodic Theory and Dynamical Systems*, 15(6):1005–1030, December 1995.
[12] Benaim, M. and Hirsch, M. W. Asymptotic pseudotrajectories and chain recurrent flows, with applications. Journal of Dynamics and Differential Equations, 8(1):141-176, 1996.
[13] Benveniste, A., Métivier, M., and Priouret, P. Adaptive Algorithms and Stochastic Approximations. Springer, 1990.
[14] Bertsekas, D. P. and Tsitsiklis, J. N. Gradient convergence in gradient methods with errors. SIAM Journal on Optimization, 10(3):627-642, 2000.
[15] Bianchi, P., Hachem, W., and Schechtman, S. Stochastic subgradient descent escapes active strict saddles on weakly convex functions. arXiv preprint arXiv:2108.02072, 2021.
[16] Bomze, I. M., Mertikopoulos, P., Schachinger, W., and Staudigl, M. Hessian barrier algorithms for linearly constrained optimization problems. SIAM Journal on Optimization, 29(3):2100-2127, 2019.
[17] Bonnabel, S. Stochastic gradient descent on Riemannian manifolds. IEEE Trans. Autom. Control, 58(9): 2217-2229, September 2013.
[18] Borkar, V. S. Stochastic Approximation: A Dynamical Systems Viewpoint. Cambridge University Press and Hindustan Book Agency, 2008.
[19] Boumal, N. An introduction to optimization on smooth manifolds. https://www.nicolasboumal.net/book/, 2022.
[20] Brandière, O. and Duflo, M. Les algorithmes stochastiques contournents les pièges ? Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 32(3):395-427, 1996.
[21] Choromanska, A., Henaff, M., Mathieu, M., Ben Arous, G., and LeCun, Y. The loss surfaces of multilayer networks. In AISTATS '15: Proceedings of the 18th International Conference on Artificial Intelligence and Statistics, 2015.
[22] Criscitiello, C. and Boumal, N. Efficiently escaping saddle points on manifolds. Advances in Neural Information Processing Systems, 32, 2019.
[23] Davis, D., Drusvyatskiy, D., and Jiang, L. Subgradient methods near active manifolds: saddle point avoidance, local convergence, and asymptotic normality. arXiv preprint arXiv:2108.11832, 2021.
[24] Duistermaat, J. J. On Hessian Riemannian structures. Asian Journal of Mathematics, 5:79-91, 2001.
[25] Ferreira, O. and Oliveira, P. Proximal point algorithm on Riemannian manifolds. Optimization, 51(2): 257-270, 2002.
[26] Ge, R., Huang, F., Jin, C., and Yuan, Y. Escaping from saddle points - Online stochastic gradient for tensor decomposition. In COLT '15: Proceedings of the 28th Annual Conference on Learning Theory, 2015.
[27] Hirsch, M. W. Differential Topology. Springer-Verlag, Berlin, 1976.