A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition
math.OC, cs.GT, cs.LG
Submitted: 2025-04-04
Updated: 2026-10-02
Terminology
Sources
- Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities
- Improved Hardness Results for Min-Max Optimization with Coupled Constraints
- An Approximation-Based Regularized Extra-Gradient Method for Monotone Variational Inequalities
- Beyond Monotone Variational Inequalities: Solution Methods and Iteration Complexities
- Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
- The Computational Complexity of Variational Inequalities and Applications in Game Theory
- Deviation Ratings: A General, Clone-Invariant Rating Method
- Expected Variational Inequalities
- First-order (coarse) correlated equilibria in non-concave games
Related papers
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
- Incremental Learning in Mirror Flows
- Second-Order Optimization with Asynchronous Curvature
- Online Control via Counterfactual Tracking
- Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability