[1] T. Abrishami, N. Guillen, P. Rule, Z. Schutzman, J. Solomon, T. Weighill, and S. Wu. Geometry of graph partitions via optimal transport. SIAM Journal on Scientific Computing, 42(5):A3340-A3366, 2020. (Cited on page 1.)
[2] P.-A. Absil, R. Mahony, and R. Sepulchre. Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton, 2008. (Cited on pages 3 and 6.)
[3] J. Altschuler, J. Niles-Weed, and P. Rigollet. Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. Advances in Neural Information Processing Systems, 30:1961–1971, 2017. (Cited on pages 4, 5, and 21.)
[4] R. Andreani, E. G. Birgin, J. M. Martínez, and M. L. Schuverdt. On augmented Lagrangian methods with general lower-level constraints. SIAM Journal on Optimization, 18(4):1286-1309, 2008. (Cited on page 5.)
[5] M. Arjovsky, S. Chintala, and L. Bottou. Wasserstein generative adversarial networks. In International Conference on Machine Learning, pages 214–223. PMLR, 2017. (Cited on page 1.)
[6] J.-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré. Iterative Bregman projections for regularized transportation problems. SIAM Journal on Scientific Computing, 37(2):A1111-A1138, 2015. (Cited on page 9.)
[7] A. S. Berahas, L. Cao, and K. Scheinberg. Global convergence rate analysis of a generic line search algorithm with noise. SIAM Journal on Optimization, 31(2):1489-1518, 2021. (Cited on pages 6 and 8.)
[8] D. P. Bertsekas. Constrained Optimization and Lagrange Multiplier Methods. Academic Press, 1982. (Cited on page 4.)
[9] N. Boumal. An Introduction to Optimization on Smooth Manifolds. Cambridge University Press, 2023. (Cited on page 3.)
[10] N. Boumal, P.-A. Absil, and C. Cartis. Global rates of convergence for nonconvex optimization on manifolds. IMA Journal of Numerical Analysis, 39(1):1-33, 2019. (Cited on page 19.)
[11] R. G. Carter. On the global convergence of trust region algorithms using inexact gradient information. SIAM Journal on Numerical Analysis, 28(1):251-265, 1991. (Cited on pages 6 and 8.)
[12] A. Chambolle and J. P. Contreras. Accelerated Bregman primal-dual methods applied to optimal transport and Wasserstein barycenter problems. SIAM Journal on Mathematics of Data Science, 4(4):1369-1395, 2022. (Cited on page 14.)
[13] X. Chen, L. Guo, Z. Lu, and J. J. Ye. An augmented Lagrangian method for non-Lipschitz nonconvex programming. SIAM Journal on Numerical Analysis, 55(1):168-193, 2017. (Cited on page 15.)
[14] A. Cherian and S. Aeron. Representation learning via adversarially-contrastive optimal transport. In International Conference on Machine Learning, pages 1820–1830. PMLR, 2020. (Cited on page 1.)
[15] M. Cuturi. Sinkhorn distances: Lightspeed computation of optimal transport. Advances in Neural Information Processing Systems, 26:2292-2300, 2013. (Cited on pages 7 and 9.)
[16] I. Deshpande, Y.-T. Hu, R. Sun, A. Pyrros, N. Siddiqui, S. Koyejo, Z. Zhao, D. Forsyth, and A. G. Schwing. Max-sliced Wasserstein distance and its use for GANs. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 10648-10656, 2019. (Cited on pages 1 and 2.)
[17] O. Devolder, F. Glineur, and Y. Nesterov. First-order methods of smooth convex optimization with inexact oracle. Mathematical Programming, 146(1):37-75, 2014. (Cited on pages 6 and 8.)