[18] J.-P. Dussault. Augmented non-quadratic penalty algorithms. Mathematical programming, 99 (3):467-486, 2004. (Cited on page 4.)
[19] P. Dvurechensky, A. Gasnikov, and A. Kroshnin. Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn's algorithm. In International Conference on Machine Learning, pages 1367–1376. PMLR, 2018. (Cited on page 19.)
[20] N. Echebest, M. D. Sánchez, and M. L. Schuverdt. Convergence results of an augmented Lagrangian method using the exponential penalty function. Journal of Optimization Theory and Applications, 168(1):92-108, 2016. (Cited on pages 4, 5, and 10.)
[21] R. Flamary, N. Courty, D. Tuia, and A. Rakotomamonjy. Optimal transport for domain adaptation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 39:1853-1865, 2016. (Cited on page 1.)
[22] N. Fournier and A. Guillin. On the rate of convergence in Wasserstein distance of the empirical measure. Probability Theory and Related Fields, 162(3):707-738, 2015. (Cited on page 1.)
[23] B. Gao, X. Liu, X. Chen, and Y. Yuan. A new first-order algorithmic framework for optimization problems with orthogonality constraints. SIAM Journal on Optimization, 28(1):302-332, 2018. (Cited on page 7.)
[24] B. Gao, X. Liu, and Y. Yuan. Parallelizable algorithms for optimization problems with orthogonality constraints. SIAM Journal on Scientific Computing, 41(3):A1949-A1983, 2019. (Cited on page 7.)
[25] J. Hu, A. Milzarek, Z. Wen, and Y. Yuan. Adaptive quadratically regularized Newton method for Riemannian optimization. SIAM Journal on Matrix Analysis and Applications, 39(3): 1181-1207, 2018. (Cited on page 7.)
[26] Y.-Q. Hu and Y.-H. Dai. Inexact Barzilai-Borwein method for saddle point problems. Numerical Linear Algebra with Applications, 14(4):299-317, 2007. (Cited on pages 6 and 8.)
[27] M. Huang, S. Ma, and L. Lai. Projection robust Wasserstein barycenters. In International Conference on Machine Learning, pages 4456-4465. PMLR, 2021. (Cited on page 10.)
[28] M. Huang, S. Ma, and L. Lai. A Riemannian block coordinate descent method for computing the projection robust Wasserstein distance. In International Conference on Machine Learning, pages 4446-4455. PMLR, 2021. (Cited on pages 2, 3, 4, 6, 7, 8, 14, 20, 21, and 22.)
[29] M. Huang, S. Ma, and L. Lai. A Riemannian block coordinate descent method for computing the projection robust Wasserstein distance. arXiv:2012.05199, v5, 2021. (Cited on pages 2, 3, 17, 18, and 19.)
[30] Y.-K. Huang, Y.-H. Dai, and X.-W. Liu. Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property. SIAM Journal on Optimization, 31(4):3068-3096, 2021. (Cited on page 7.)
[31] B. Iannazzo and M. Porcelli. The Riemannian Barzilai-Borwein method with nonmonotone line search and the matrix geometric mean computation. *IMA Journal of Numerical Analysis*, 38(1):495-517, 2018. (Cited on page 7.)
[32] B. Jiang and Y.-H. Dai. A framework of constraint preserving update schemes for optimization on Stiefel manifold. Mathematical Programming, 153(2):535-575, 2015. (Cited on page 7.)
[33] S. Kullback. A lower bound for discrimination information in terms of variation (corresp.). IEEE Transactions on Information Theory, 13(1):126-127, 1967. (Cited on page 18.)
[34] T. Lin, C. Fan, N. Ho, M. Cuturi, and M. Jordan. Projection robust Wasserstein distance and Riemannian optimization. Advances in Neural Information Processing Systems, 33:9383-9397, 2020. (Cited on pages 2, 3, 4, 6, 8, 14, 17, 21, and 22.)
[35] T. Lin, Z. Zheng, E. Chen, M. Cuturi, and M. I. Jordan. On projection robust optimal transport: Sample complexity and model misspecification. In International Conference on Artificial Intelligence and Statistics, pages 262-270. PMLR, 2021. (Cited on page 2.)
[36] T. Lin, N. Ho, and M. I. Jordan. On the efficiency of entropic regularized algorithms for optimal transport. Journal of Machine Learning Research, 23(137):1-42, 2022. (Cited on pages 3 and 19.)
[37] C. Liu and N. Boumal. Simple algorithms for optimization on Riemannian manifolds with constraints. Applied Mathematics & Optimization, 82:949-981, 2020. (Cited on page 6.)