Optimal High-Order Methods for Solving Monotone Variational Inequalities
math.OC, cs.GT, stat.ML
Submitted: 2026-09-20
Updated: 2026-09-20
Comments: Improve our previous note in https://arxiv.org/abs/2608.08463 and achieve optimal complexity
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities
- Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(\epsilon^{-4/(3p+1)})$ $p$th-Order Oracle Complexity
- Halpern Iteration Achieves (epsilon-1/p) p th-Order Oracle Complexity for Monotone Variational Inequalities
- High-Order Reduced-Gradient Methods for Composite Variational Inequalities
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
- Online Control via Counterfactual Tracking
- Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
- Petrov-Galerkin operator inference with application to stability-encouraging identification