arXiv (All)
open access
Primal Methods for Constrained Variational Inequalities: Optimal Rates, Feasibility Trade-offs, and Lower Bounds
Since Zhang et al. \cite{Zhang2025} introduced the first purely primal methods for monotone variational inequalities subject to convex functional constraints, the field has lacked a complete understanding of the complexity limits of this oracle class. We develop a theory that resolves the critical g
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
- Pointwise boundary observation in geometric optimization problems associated to variational inequalities#630405
- Matching Higher-Order Oracle Complexity for Smooth Monotone Variational Inequalities#1071248
- Strong Duality in Risk-Constrained Nonconvex Functional Programming#1014439
- Equivalence of variational inequality problems to unconstrained minimization#430006
- Basic Inequalities for First-Order Optimization with Applications to Statistical Risk Analysis#1084105
Record · ID 1117693
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