arXiv (All)
open access
Parameter-Free Adaptive Extragradient Methods for Generalized-Smooth Variational Inequalities
Variational inequalities (VIs) provide a unified framework for optimization, saddle-point, equilibrium, and learning problems, where operators need not be globally Lipschitz. The $α$-symmetric generalized-smoothness condition allows local operator variation to grow with the operator norm, but existi
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
- A Bregman inertial iteratively regularized extragradient method for bilevel variational inequality problems#1105457
- Extragradient and Past Extragradient Methods for $(L_0,L_1)$-Lipschitz Variational Inequalities#1341768
- An Adaptive Linesearch-free Method for Monotone Variational Inequalities under Local Lipschitz Continuity#1109966
- Extragradient methods with complexity guarantees for hierarchical variational inequalities#925881
- Bi-ZOL: Bilevel Zeroth-Order Learning with Nonsmooth Responses#985422
Record · ID 1325735
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