arXiv (All)
open access
On the Convergence of Proximal Algorithms for Weakly-convex Min-max Optimization
We study alternating first-order algorithms with no inner loops for solving nonconvex-strongly concave min-max problems. We show the convergence of the alternating gradient descent-ascent algorithm by proposing a substantially simplified proof compared to previous ones. It allows us to enlarge the s
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
- Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method#629792
- Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method#627930
- Nonlinear rescaling and proximal-like methods in convex optimization#429965
- DIFFRACT: Neuralized Utility Maximization for Wireless Networks by Differentiable Programming#266136
- Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems#451646
Record · ID 1104997
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