arXiv (All)
open access
Extragradient methods with complexity guarantees for hierarchical variational inequalities
In the framework of a real Hilbert space we consider the problem of approaching solutions to a class of hierarchical variational inequality problems, subsuming several other problem classes including certain mathematical programs under equilibrium constraints, constrained min-max problems, hierarchi
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
- Averaged proximal reflected gradient method for monotone variational inequalities#973988
- An Adaptive Linesearch-free Method for Monotone Variational Inequalities under Local Lipschitz Continuity#1109966
- Optimal High-Order Methods for Solving Monotone Variational Inequalities#1049296
- Convergence of implicit schemes for Hamilton-Jacobi-Bellman quasi-variational inequalities#984773
- Positive Quasimodular Forms and Linear Programming Bounds#634772
Record · ID 925881
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