[68] Fedor S. Stonyakin and Alexander A. Titov. One mirror descent algorithm for convex constrained optimization problems with non-standard growth properties. arXiv preprint arXiv:1803.01329, 2018.
[69] Arnesh Sujanani and Renato D.C. Monteiro. An adaptive superfast inexact proximal augmented lagrangian method for smooth nonconvex composite optimization problems. Journal of Scientific Computing, 97(2):34, 2023.
[70] Lai Tian and Anthony Man-Cho So. Computing goldstein  $(\epsilon, \delta)$ -stationary points of Lipschitz functions in  $\widetilde{O}(\epsilon^{-3}\delta^{-1})$  iterations via random conic perturbation. arXiv preprint arXiv:2112.09002, 2021.
[71] Lai Tian, Kaiwen Zhou, and Anthony Man-Cho So. On the finite-time complexity and practical computation of approximate stationarity concepts of lipschitz functions. In International Conference on Machine Learning, pages 21360-21379. PMLR, 2022.
[72] Alexander A. Titov, Fedor S. Stonyakin, Mohammad S. Alkousa, Seydamet S. Ablaev, and Alexander V. Gasnikov. Analogues of switching subgradient schemes for relatively lipschitz-continuous convex programming problems. In International Conference on Mathematical Optimization Theory and Operations Research, pages 133–149. Springer, 2020.
[73] Alexander A. Titov, Fedor S. Stonyakin, Alexander V. Gasnikov, and Mohammad S. Alkousa. Mirror descent and constrained online optimization problems. In International Conference on Optimization and Applications, pages 64-78. Springer, 2019.
[74] Robin Vogel, Aurélien Bellet, and Stéphan Clémenton. Learning fair scoring functions: Bipartite ranking under roc-based fairness constraints. In International Conference on Artificial Intelligence and Statistics, pages 784-792. PMLR, 2021.
[75] Yu Wang, Wotao Yin, and Jinshan Zeng. Global convergence of admm in nonconvex nonsmooth optimization. Journal of Scientific Computing, 78(1):29-63, 2019.
[76] Tianbao Yang and Qihang Lin. RSG: Beating subgradient method without smoothness and strong convexity. Journal of Machine Learning Research, 19(1):236-268, 2018.
[77] Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez-Rodriguez, and Krishna P. Gummadi. Fairness constraints: A flexible approach for fair classification. Journal of Machine Learning Research, 20(1):2737-2778, 2019.
[78] Jinshan Zeng, Wotao Yin, and Ding-Xuan Zhou. Moreau envelope augmented lagrangian method for nonconvex optimization with linear constraints. Journal of Scientific Computing, 91(2):61, 2022.
[79] Jiawei Zhang and Zhi-Quan Luo. A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization. SIAM Journal on Optimization, 30(3):2272-2302, 2020.
[80] Jiawei Zhang and Zhi-Quan Luo. A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization. SIAM Journal on Optimization, 32(3):2319-2346, 2022.
[81] Jiawei Zhang, Wenqiang Pu, and Zhi-Quan Luo. On the iteration complexity of smoothed proximal alm for nonconvex optimization problem with convex constraints. arXiv preprint arXiv:2207.06304, 2022.
[82] Jingzhao Zhang, Hongzhou Lin, Stefanie Jegelka, Suvrit Sra, and Ali Jadbabaie. Complexity of finding stationary points of nonconvex nonsmooth functions. In International Conference on Machine Learning, pages 11173-11182. PMLR, 2020.
[83] Siqi Zhang and Niao He. On the convergence rate of stochastic mirror descent for nonsmooth nonconvex optimization. arXiv preprint arXiv:1806.04781, 2018.