[38] H. Liu, A. M.-C. So, and W. Wu. Quadratic optimization with orthogonality constraint: Explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods. Mathematical Programming, 178(1):215-262, 2019. (Cited on page 19.)
[39] Y.-F. Liu, X. Liu, and S. Ma. On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming. Mathematics of Operations Research, 44(2):632-650, 2019. (Cited on pages 6 and 8.)
[40] J. Niles-Weed and P. Rigollet. Estimation of Wasserstein distances in the spiked transport model. Bernoulli, 28(4):2663–2688, 2022. (Cited on pages 1 and 2.)
[41] F.-P. Paty and M. Cuturi. Subspace robust Wasserstein distances. In International Conference on Machine Learning, pages 5072-5081. PMLR, 2019. (Cited on pages 1, 2, and 22.)
[42] G. Peyre and M. Cuturi. Computational optimal transport: With applications to data science. Foundations and Trends® in Machine Learning, 11(5-6):355–607, 2019. (Cited on page 1.)
[43] J. Rabin, G. Peyre, J. Delon, and M. Bernot. Wasserstein barycenter and its application to texture mixing. In International Conference on Scale Space and Variational Methods in Computer Vision, pages 435-446. Springer, 2011. (Cited on page 1.)
[44] E. W. Sachs and S. M. Sachs. Nonmonotone line searches for optimization algorithms. Control and Cybernetics, 40(4):1059-1075, 2011. (Cited on page 20.)
[45] S. Samadi, U. Tantipongpipat, J. H. Morgenstern, M. Singh, and S. Vempala. The price of fair PCA: One extra dimension. Advances in Neural Information Processing Systems, 31: 10999–11010, 2018. (Cited on page 10.)
[46] M. Schmidt, N. Roux, and F. Bach. Convergence rates of inexact proximal-gradient methods for convex optimization. Advances in Neural Information Processing Systems, 24:1458-1466, 2011. (Cited on pages 6 and 8.)
[47] P. Tseng and D. P. Bertsekas. On the convergence of the exponential multiplier method for convex programming. Mathematical Programming, 60(1):1-19, 1993. (Cited on pages 4 and 5.)
[48] J.-P. Vial. Strong and weak convexity of sets and functions. Mathematics of Operations Research, 8(2):231-259, 1983. (Cited on page 14.)
[49] J. Weed and F. Bach. Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance. Bernoulli, 25(4A):2620-2648, 2019. (Cited on page 1.)
[50] Z. Wen and W. Yin. A feasible method for optimization with orthogonality constraints. Mathematical Programming, 142(1):397-434, 2013. (Cited on page 7.)
[51] Y. Xie, X. Wang, R. Wang, and H. Zha. A fast proximal point method for computing exact Wasserstein distance. In Uncertainty in Artificial Intelligence, pages 433-453. PMLR, 2020. (Cited on page 5.)
[52] L. Yang and K.-C. Toh. Bregman proximal point algorithm revisited: A new inexact version and its variant. SIAM Journal on Optimization, 32(3):1523-1554, 2022. (Cited on pages 4, 5, 6, and 8.)
[53] W. H. Yang, L.-H. Zhang, and R. Song. Optimality conditions for the nonlinear programming problems on Riemannian manifolds. Pacific Journal of Optimization, 10(2):415-434, 2014. (Cited on page 14.)
[54] H. Zhang and W. W. Hager. A nonmonotone line search technique and its application to unconstrained optimization. SIAM Journal on Optimization, 14(4):1043-1056, 2004. (Cited on pages 7 and 20.)
[55] Y. Zhou, C. Bao, C. Ding, and J. Zhu. A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds. Mathematical Programming, 201: 1-61, 2023. (Cited on page 6.)