Papers › Moving Anchor Extragradient Methods For Smooth Structured Minimax Problems
Moving Anchor Extragradient Methods For Smooth Structured Minimax Problems
James K. Alcala, Yat Tin Chow, Mahesh Sunkula
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This work introduces a moving anchor acceleration technique to extragradient algorithms for smooth structured minimax problems. The moving anchor is introduced as a generalization of the original algorithmic anchoring framework, i.e. the EAG method introduced in [32], in hope of further acceleration. We show that the optimal order of convergence in terms of worst-case complexity on the squared gradient, O(1/k2), is achieved by our new method (where k is the number of iterations). We have also extended our algorithm to a more general nonconvex-nonconcave class of saddle point problems using the framework of [14], which slightly generalizes [32]. We obtain similar order-optimal complexity results in this extended case. In both problem settings, numerical results illustrate the efficacy of our moving anchor algorithm variants, in particular by attaining the theoretical optimal convergence rate for first order methods, as well as suggesting a better optimized constant in the big O notation which surpasses the traditional fixed anchor methods in many cases. A proximal-point preconditioned version of our algorithms is also introduced and analyzed to match optimal theoretical convergence rates.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections