Dual-space preconditioning improves solving variational inequalities and roots
Dual-Space Preconditioning for Variational Inequalities and Root-Finding Problems
Machine Learning
Summary
Finding solutions to certain math problems, like where a function equals zero or satisfies some inequality, often uses assumptions that limit how those problems behave. The authors introduce a new way to relax these assumptions, making algorithms work under broader conditions. They show that their methods converge reliably and can be seen as improved versions of known approaches with adaptable step sizes. Additionally, they link these methods to continuous processes and control theory to better understand their behavior.
What this means in practice
- •For optimization algorithm developers: Design iterative methods that converge reliably under less restrictive conditions and with flexible stepsizes for solving complex variational inequalities and root-finding problems.
- •For control system engineers: Use the variational and optimal control interpretations to analyze and design control systems governed by non-standard operator conditions.
Authors
Jan Quan, Konstantinos Oikonomidis, Alexander Bodard, Panagiotis Patrinos
Abstract
This paper develops a dual-space preconditioning framework for variational inequalities and root-finding problems beyond classical cocoercivity and Lipschitz continuity assumptions. To this end, we introduce both a novel cocoercivity-type condition and a relaxed Lipschitz continuity condition, and derive convergence of deterministic and stochastic methods under these generalized conditions. For isotropic preconditioners, the resulting algorithms can be interpreted as variable-stepsize variants of classical methods, extending recent analyses based on $(L_0, L_1)$-type growth conditions while allowing simpler proofs and larger stepsize ranges. We also show that the framework naturally handles variational inequalities through weak Minty-type arguments. Finally, we study the associated continuous-time dynamics and derive a variational and optimal control interpretation of the preconditioned flow. Overall, the results show that dual-space preconditioning provides a flexible mechanism for designing and analyzing operator methods beyond the standard Euclidean Lipschitz setting.