arXiv (OAI Expanded)
open access
Optimal Deterministic First-Order Oracle Complexity for Nonconvex-Concave Minimax Optimization
We study the deterministic first-order oracle complexity of smooth nonconvex-concave minimax optimization over a bounded convex dual domain. Let $\ell$ denote the joint smoothness constant, $D_{\mathcal{Y}}$ the diameter of the dual domain, and $Δ$ the initial gap. We prove that every deterministic
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Near-Optimal Exact-Value Zeroth-Order Complexity for Smooth Strongly Convex Optimization#1012895
- On the Complexity of BFGS Method for Smooth Convex Optimization#617683
- On the Complexity of BFGS Method for Smooth Convex Optimization#617183
- An Inexact Augmented Lagrangian Method for $(L_0, L_1)$-Smooth Convex Optimization#819718
- An Inexact Augmented Lagrangian Method for $(L_0, L_1)$-Smooth Convex Optimization#809722
Record · ID 1083692
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive