PALM achieves Õ(ε^{-1}) first-order complexity for ε-KKT points in convex-strongly-concave minimax problems with functional constraints and Õ(ε^{-3/2}) for the dual in the convex-concave case.
Preprint, arXiv:2308.06470 , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
First-Order Methods for Solving Convex (Strongly) Concave Minimax Problems with Functional Constraints
PALM achieves Õ(ε^{-1}) first-order complexity for ε-KKT points in convex-strongly-concave minimax problems with functional constraints and Õ(ε^{-3/2}) for the dual in the convex-concave case.