[20] R. Jiang, N. Abolfazli, A. Mokhtari, and E. Y. Hamedani, “A conditional gradient-based method for simple bilevel optimization with convex lower-level problem,” in Proceedings of International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 10305–10323, 2023.
[21] F. Huang, "On momentum-based gradient methods for bilevel optimization with nonconvex lower-level," arXiv preprint arXiv:2303.03944, 2023.
[22] R. Grazzi, L. Franceschi, M. Pontil, and S. Salzo, "On the iteration complexity of hypergradient computation," in Proceedings of International Conference on Machine Learning (ICML), pp. 3748-3758, 2020.
[23] M. Dagréou, P. Ablin, S. Vaiter, and T. Moreau, “A framework for bilevel optimization that enables stochastic and global variance reduction algorithms,” in Proceedings of Advances in Neural Information Processing Systems (NeurIPS), pp. 26698–26710, 2022.
[24] J. Li, B. Gu, and H. Huang, “A fully single loop algorithm for bilevel optimization without hessian inverse,” in Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), vol. 36, pp. 7426–7434, 2022.
[25] D. Sow, K. Ji, Z. Guan, and Y. Liang, "A constrained optimization approach to bilevel optimization with multiple inner minima," arXiv preprint arXiv:2203.01123, 2022.
[26] A. Mehra and J. Hamm, “Penalty method for inversion-free deep bilevel optimization,” in Proceedings of Asian Conference on Machine Learning (ACML), pp. 347–362, 2021.
[27] J. V. Outrata, “On the numerical solution of a class of stackelberg problems,” Zeitschrift für Operations Research, vol. 34, pp. 255–277, 1990.
[28] R. Liu, Y. Liu, W. Yao, S. Zeng, and J. Zhang, "Averaged method of multipliers for bi-level optimization without lower-level strong convexity," in Proceedings of International Conference on Machine Learning (ICML), pp. 21839-21866, 2023.
[29] S. Lu, "A single-loop gradient descent and perturbed ascent algorithm for nonconvex functional constrained optimization," in Proceedings of International Conference on Machine Learning (ICML), pp. 14315-14357, 2022.
[30] J. Zhang and Z.-Q. Luo, “A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization,” SIAM Journal on Optimization, vol. 32, no. 3, pp. 2319–2346, 2022.
[31] S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Eckstein, et al., "Distributed optimization and statistical learning via the alternating direction method of multipliers," Foundations and Trends in Machine learning, vol. 3, no. 1, pp. 1-122, 2011.
[32] J. Zhang and Z.-Q. Luo, "A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization," SIAM Journal on Optimization, vol. 30, no. 3, pp. 2272-2302, 2020.
[33] J. Zhang, W. Pu, and Z.-Q. Luo, “On the iteration complexity of smoothed proximal ALM for nonconvex optimization problem with convex constraints,” arXiv preprint arXiv:2207.06304, 2022.
[34] M. Nouiehed, M. Sanjabi, T. Huang, J. D. Lee, and M. Razaviyayn, "Solving a class of nonconvex min-max games using iterative first order methods," in Proceedings of Advances in Neural Information Processing Systems (NeurIPS), vol. 32, 2019.
[35] H. Karimi, J. Nutini, and M. Schmidt, "Linear convergence of gradient and proximal-gradient methods under the Polyak-lojasiewicz condition," in Proceedings of Machine Learning and Knowledge Discovery in Databases: European Conference (ECML PKDD), pp. 795–811, 2016.
[36] J. Zhang, P. Xiao, R. Sun, and Z. Luo, "A single-loop smoothed gradient descent-ascent algorithm for nonconvex-concave min-max problems," in Proceedings of Advances in Neural Information Processing Systems (NeurIPS), pp. 7377-7389, 2020.
[37] T. Lin, C. Jin, and M. Jordan, “On gradient descent ascent for nonconvex-concave minimax problems,” in Proceedings of International Conference on Machine Learning (ICML), pp. 6083–6093, 2020.