math.OCNov 10, 2026

Dual-Space Preconditioning for Variational Inequalities and Root-Finding Problems

Authors: Jan Quan, Konstantinos Oikonomidis, Alexander Bodard, Panagiotis Patrinos

Organizations: KU Leuven (STADIUS)

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 (L0,L1)(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.

Figures & tables

Appendix figures & tables4 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization

    Aug 12, 2026TaeHo Yoon, Nicolas LoizouStochastic Approximation

  2. Adaptive Delayed-Update Cyclic Algorithm for Variational Inequalities

    Mar 31, 2026Yi Wei, Xufeng Cai, Jelena Diakonikolas

  3. Dual Space Preconditioning for Gradient Descent in the Overparameterized Regime

    Mar 11, 2026Reza Ghane, Danil Akhtiamov, Babak HassibiGradient DescentImplicit Bias