[92] Rahul Singh, Abhishek Gupta, and Ness B Shroff. Learning in constrained Markov decision processes. IEEE Transactions on Control of Network Systems, 10(1):441-453, 2022.
[93] Honghao Wei, Arnob Ghosh, Ness Shroff, Lei Ying, and Xingyu Zhou. Provably efficient model-free algorithms for non-stationary CMDPs. In Proceedings of the International Conference on Artificial Intelligence and Statistics, pages 6527-6570, 2023.
[94] Jacopo Germano, Francesco Emanuele Stradi, Gianmarco Genalti, Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti. A best-of-both-worlds algorithm for constrained MDPs with long-term constraints. arXiv preprint arXiv:2304.14326, 2023.
[95] Krishna C Kalagarla, Rahul Jain, and Pierluigi Nuzzo. Safe posterior sampling for constrained MDPs with bounded constraint violation. arXiv preprint arXiv:2301.11547, 2023.
[96] Soumyajit Guin and Shalabh Bhatnagar. A policy gradient approach for finite horizon constrained Markov decision processes. arXiv preprint arXiv:2210.04527, 2022.
[97] Santiago Paternain, Luiz Chamon, Miguel Calvo-Fullana, and Alejandro Ribeiro. Constrained reinforcement learning has zero duality gap. In Proceedings of the Advances in Neural Information Processing Systems, 2019.
[98] Wenhao Zhan, Shicong Cen, Baihe Huang, Yuxin Chen, Jason D Lee, and Yuejie Chi. Policy mirror descent for regularized reinforcement learning: A generalized framework with linear convergence. SIAM Journal on Optimization, 33(2):1061-1091, 2023.
[99] Guanghui Lan. Policy mirror descent for reinforcement learning: Linear convergence, new sampling complexity, and generalized problem classes. Mathematical Programming, 198(1):1059-1106, 2023.
[100] Paul Tseng. On linear convergence of iterative methods for the variational inequality problem. Journal of Computational and Applied Mathematics, 60(1-2):237-252, 1995.
[101] Yu Malitsky. Projected reflected gradient methods for monotone variational inequalities. SIAM Journal on Optimization, 25(1):502-520, 2015.
[102] Jacob Abernethy, Kevin A Lai, and Andre Wibisono. Last-iterate convergence rates for minmax optimization: Convergence of Hamiltonian gradient descent and consensus optimization. In Proceedings of the Algorithmic Learning Theory, pages 3–47, 2021.
[103] Yang Cai, Argyris Oikonomou, and Weiqiang Zheng. Accelerated algorithms for monotone inclusions and constrained nonconvex-nonconcave min-max optimization. arXiv preprint arXiv:2206.05248, 2022.
[104] Quoc Tran-Dinh. Extragradients-type methods with  $\mathrm{O}(1 / k)$ -convergence rates for cohypomonotone inclusions. arXiv preprint arXiv:2302.04099, 2023.
[105] Stephen J Wright. Primal-dual interior-point methods. SIAM, 1997.
[106] Michele Benzi, Gene H Golub, and Jörg Liesen. Numerical solution of saddle point problems. Acta Numerica, 14:1-137, 2005.
[107] Kenneth J Arrow and Leonid Hurwicz. Reduction of constrained maxima to saddle-point problems. In *Traces and Emergence of Nonlinear Programming*, pages 61-80. 2013.
[108] Kazufumi Ito and Karl Kunisch. Lagrange multiplier approach to variational problems and applications. SIAM, 2008.
[109] Bingsheng He and Xiaoming Yuan. On the acceleration of augmented Lagrangian method for linearly constrained optimization. Optimization Online, 3, 2010.