Improved upper bound of Õ(ε^{-4/(3p+1)}) p-th order oracle complexity for convex-concave minimax problems via Monteiro-Svaiter acceleration, with matching lower bound Ω(ε^{-2/(3p-1)}).
Solving convex-concave problems with O(ϵ−4/7)second-order oracle complexity
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
-
Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(\epsilon^{-4/(3p+1)})$ $p$th-Order Oracle Complexity
Improved upper bound of Õ(ε^{-4/(3p+1)}) p-th order oracle complexity for convex-concave minimax problems via Monteiro-Svaiter acceleration, with matching lower bound Ω(ε^{-2/(3p-1)}).