arxiv
PublishedSeptember 18, 2026 at 4:00 AM
—neutral
Near-Optimal Pure Single-Loop Extragradient Method for Strongly Convex--Strongly Concave Minimax Optimization
Publisher summary· verbatim
arXiv:2609.20327v1 Announce Type: cross Abstract: We study smooth strongly convex--strongly concave minimax optimization with general nonlinear coupling in the deterministic unconstrained setting. We propose a pure single-loop damped extragradient method with fixed parameters and two new full-gradie
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSequential Capacity of Quantum Processes with Finite Memory1darxivGraph Representation via Elements of Discrete Morse and Cobordism Theories1darxivAF-Muon: An AdamW-Free Muon Optimizer for Tied-Embedding Models1darxivDo Your Own Research: Learning to Forecast by Learning to Search1dThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗