English

Stability for Constrained Minimax Optimization

Optimization and Control 2021-11-11 v1

Abstract

Minimax optimization problems are an important class of optimization problems arising from both modern machine learning and from traditional research areas. We focus on the stability of constrained minimax optimization problems based on the notion of local minimax point by Dai and Zhang (2020). Firstly, we extend the classical Jacobian uniqueness conditions of nonlinear programming to the constrained minimax problem and prove that this set of properties is stable with respect to small C2C^2 perturbation. Secondly, we provide a set of conditions, called Property A, which does not require the strict complementarity condition for the upper level constraints. Finally, we prove that Property A is a sufficient condition for the strong regularity of the Kurash-Kuhn-Tucker (KKT) system at the KKT point, and it is also a sufficient condition for the local Lipschitzian homeomorphism of the Kojima mapping near the KKT point.

Keywords

Cite

@article{arxiv.2111.05680,
  title  = {Stability for Constrained Minimax Optimization},
  author = {Yu-Hong Dai and Liwei Zhang},
  journal= {arXiv preprint arXiv:2111.05680},
  year   = {2021}
}

Comments

22 pages, 0 figure. arXiv admin note: text overlap with arXiv:2004.09730

R2 v1 2026-06-24T07:33:40.314Z