arXiv (All)
open access
AltGDA Achieves Global $O(1/T)$ Ergodic Convergence in Matrix Games
Alternating gradient descent-ascent (AltGDA) is a simple and practically effective method for solving finite two-player zero-sum matrix games. However, the theory of AltGDA remains limited: existing results either apply only to unconstrained settings or require restrictive assumptions on the equilib
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
- An Adaptive Augmented Lagrangian Method for Deterministic and Stochastic Nonconvex Optimization#780975
- An Adaptive Augmented Lagrangian Method for Deterministic and Stochastic Nonconvex Optimization#779600
- The Lanczos algorithm for matrix functions: a handbook for scientists#629744
- The Lanczos algorithm for matrix functions: a handbook for scientists#627882
- A Distributed Plug-and-Play MCMC Algorithm for High-Dimensional Inverse Problems#322571
Record · ID 1117707
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