arXiv (All)
open access
Extragradient and Past Extragradient Methods for $(L_0,L_1)$-Lipschitz Variational Inequalities
Variational inequalities (VIs) capture a broad class of optimization problems central to modern machine learning, including min-max optimization and equilibrium computation in multiplayer games. Traditionally, algorithms for solving VIs, such as Extragradient (EG) and Past Extragradient (PEG), have
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
- Parameter-Free Adaptive Extragradient Methods for Generalized-Smooth Variational Inequalities#1325735
- Extragradient methods with complexity guarantees for hierarchical variational inequalities#925881
- An Adaptive Linesearch-free Method for Monotone Variational Inequalities under Local Lipschitz Continuity#1109966
- Bregman proximal gradient method for linear optimization under entropic constraints#177077
- Bregman proximal gradient method for linear optimization under entropic constraints#145048
Record · ID 1341768
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