Anchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems
math.OC, cs.LG, stat.ML
Submitted: 2026-09-24
Updated: 2026-09-24
Terminology
Sources
- Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities
- Moving Anchor Extragradient Methods For Smooth Structured Minimax Problems
- 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
- Higher-Order Derivatives Do Not Accelerate the Computation of Fixed Points
- Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
- Tensor methods for strongly convex strongly concave saddle point problems and strongly monotone variational inequalities
- ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems
- Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions
- A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
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