We present a Lyapunov analysis of Korpelevich's extragradient method andestablish an $\mathcal{O}(1/k)$ last-iterate convergence rate. Building onthis, we propose flexible extensions that combine extragradient steps withuser-specified directions, guided by a line-search procedure derived from thesame Lyapunov analysis. These methods retain global convergence under practicalassumptions and can achieve superlinear rates when directions are chosenappropriately. Numerical experiments highlight the simplicity and efficiency ofthis approach.
A Lyapunov analysis of Korpelevich's extragradient method with fast and flexible extensions
Latafat Puya;
2025
Abstract
We present a Lyapunov analysis of Korpelevich's extragradient method andestablish an $\mathcal{O}(1/k)$ last-iterate convergence rate. Building onthis, we propose flexible extensions that combine extragradient steps withuser-specified directions, guided by a line-search procedure derived from thesame Lyapunov analysis. These methods retain global convergence under practicalassumptions and can achieve superlinear rates when directions are chosenappropriately. Numerical experiments highlight the simplicity and efficiency ofthis approach.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2502.00119v1.pdf
accesso aperto
Descrizione: A Lyapunov analysis of Korpelevich’s extragradient method with fast and flexible extensions
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
1 MB
Formato
Adobe PDF
|
1 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

