Monotone Inclusions, Acceleration and Closed-Loop Control
Not on the map. Why?
Abstract (arXiv)
We propose and analyze a new dynamical system with a closed-loop control law in a Hilbert space H, aiming to shed light on the acceleration phenomenon for textitmonotone inclusion problems, which unifies a broad class of optimization, saddle point and variational inequality (VI) problems under a single framework. Given A: H rightrightarrows H that is maximal monotone, we propose a closed-loop control system that is governed by the operator I - (I + λ(t)A)-1, where a feedback law λ(·) is tuned by the resolution of the algebraic equation λ(t)|(I + λ(t)A)-1x(t) - x(t)|p-1 = θ for some θ > 0. Our first contribution is to prove the existence and uniqueness of a global solution via the Cauchy-Lipschitz theorem. We present a simple Lyapunov function for establishing the weak convergence of trajectories via the Opial lemma and strong convergence results under additional conditions. We then prove a global ergodic convergence rate of O(t-(p+1)/2) in terms of a gap function and a global pointwise convergence rate of O(t-p/2) in terms of a residue function. Local linear convergence is established in terms of a distance function under an error bound condition. Further, we provide an algorithmic framework based on the implicit discretization of our system in a Euclidean setting, generalizing the large-step HPE framework. Although the discrete-time analysis is a simplification and generalization of existing analyses for a bounded domain, it is largely motivated by the above continuous-time analysis, illustrating the fundamental role that the closed-loop control plays in acceleration in monotone inclusion. A highlight of our analysis is a new result concerning pth-order tensor algorithms for monotone inclusion problems, complementing the recent analysis for saddle point and VI problems.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Nov 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 1; 2025: 0; 2026: 2.
5 papers.
- 2024Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimizationcited by 8
- 2022Perseus: A Simple and Optimal High-Order Method for Variational Inequalitiescited by 5
- 2022Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysiscited by 0
- 2026Halpern Iteration Achieves tildeO(ε-1/p) pth-Order Oracle Complexity for Monotone Variational Inequalitiescited by 0
- 2026Optimal High-Order Methods for Solving Monotone Variational Inequalitiescited by 0
- 2026Optimal High-Order Methods for Solving Monotone Variational Inequalities20 Sep 2026
- 2026Halpern Iteration Achieves tildeO(ε-1/p) pth-Order Oracle Complexity for Monotone Variational Inequalities9 Aug 2026
- 2024Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization4 Jun 2024
- 2022Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis23 Oct 2022
- 2022Perseus: A Simple and Optimal High-Order Method for Variational Inequalities6 May 2022