Sign inGet started
Paper · arXiv

Adaptive Delayed-Update Cyclic Algorithm for Variational Inequalities

Cyclic block coordinate methods are a fundamental class of first-order algorithms, widely used in practice for their simplicity and strong empirical performance. Yet, their theoretical behavior remains challenging to explain, and setting their step sizes -- beyond classical coordinate descent for minimization -- typically requires careful tuning or line-search machinery. In this work, we develop $\texttt{ADUCA}$ (Adaptive Delayed-Update Cyclic Algorithm), a cyclic algorithm addressing a broad class of Minty variational inequalities with monotone Lipschitz operators. $\texttt{ADUCA}$ is parameter-free: it requires no global or block-wise Lipschitz constants and uses no per-epoch line searc...

AuthorsYi Wei, Xufeng Cai, Jelena Diakonikolas
Primary categorymath.OC
Published31 March 2026
Last updated at source31 March 2026
math.OCcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/dab3d707-b8c1-4e17-a3fd-6d52847472c8" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.