[KPT+17] Soheil Kolouri, Se Rim Park, Matthew Thorpe, Dejan Slepcev, and Gustavo K Rohde. Optimal mass transport: signal processing and machine-learning applications. IEEE Signal Processing Magazine, 34(4):43-59, 2017.
[KV05] Adam Tauman Kalai and Santosh S. Vempala. Efficient algorithms for online decision problems. J. Comput. Syst. Sci., 71(3):291-307, 2005.
[LFN18] Haihao Lu, Robert M. Freund, and Yurii E. Nesterov. Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim., 28(1):333-354, 2018.
[LHJ19] Tianyi Lin, Nhat Ho, and Michael I. Jordan. On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms. In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, volume 97 of Proceedings of Machine Learning Research, pages 3982-3991. PMLR, 2019.
[LHJ22] Tianyi Lin, Nhat Ho, and Michael I. Jordan. On the efficiency of entropic regularized algorithms for optimal transport. Journal of Machine Learning Research, 23(137):1-42, 2022.
[LMR19] Nathaniel Lahn, Deepika Mulchandani, and Sharath Raghevendra. A graph theoretic additive approximation of optimal transport. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, pages 13813–13823, 2019.
[LS15] Yin Tat Lee and Aaron Sidford. Efficient inverse maintenance and faster algorithms for linear programming. In Venkatesan Guruswami, editor, IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, pages 230-249. IEEE Computer Society, 2015.
[LS17] Yin Tat Lee and He Sun. An sdp-based algorithm for linear-sized spectral sparsification. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pages 678-687. ACM, 2017.
[Nem04] Arkadi Nemirovski. Prox-method with rate of convergence  $\mathrm{o}(1 / t)$  for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM Journal on Optimization, 15(1):229-251, 2004.
[Nes05] Yurii Nesterov. Smooth minimization of non-smooth functions. Math. Program., 103(1):127-152, 2005.
[Nes07] Yurii Nesterov. Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Program., 109(2-3):319-344, 2007.
[PC19] Gabriel Peyre and Marco Cuturi. Computational optimal transport. Found. Trends Mach. Learn., 11(5-6):355–607, 2019.
[PTZ16] Richard Peng, Kanat Tangwongsan, and Peng Zhang. Faster and simpler width-independent parallel algorithms for positive semidefinite programming. CoRR, abs/1201.5135, 2016.
[Qua20] Kent Quanrud. Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. In 3rd Symposium on Simplicity in Algorithms, SOSA 2020, pages 69-80. SIAM, 2020.
[She17] Jonah Sherman. Area-convexity,  $\ell_{\infty}$  regularization, and undirected multicommodity flow. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pages 452-460. ACM, 2017.
[ST18] Aaron Sidford and Kevin Tian. Coordinate methods for accelerating  $\ell_{\infty}$  regression and faster approximate maximum flow. In Mikkel Thorup, editor, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, pages 922-933. IEEE Computer Society, 2018.