Paperlane

no. 15 · Monday 16 November 2026

An Adaptive Linesearch-free Method for Monotone Variational Inequalities under Local Lipschitz Continuity

Hongjia Ou, Andreas Themelis and Puya Latafat

math.OC · v2

Abstract

The forward-reflected-backward (FRB) splitting solves monotone inclusions involving the sum of a maximally monotone operator and a monotone Lipschitz continuous operator. Each iteration performs one resolvent step and one evaluation of the Lipschitz operator, together with a reflection term with coefficient equal to one that reuses the operator value from the previous iteration. We consider the setting where the maximally monotone operator is the subdifferential of a proper, closed, convex function. We identify the admissible range of constant reflection coefficients, namely all values larger than one half for a sufficiently small stepsize. We then propose a linesearch-free adaptive variant of FRB for locally Lipschitz continuous operators, in which both the stepsize and the reflection coefficient change across iterations. The stepsize is computed in closed form from a simple local Lipschitz estimate, without knowledge of a global Lipschitz constant, while keeping the iteration cost of FRB. The analysis of both methods relies on a new Lyapunov function that combines the distance to a solution, a residual, and a gap-related term. Alongside nonasymptotic rates, we derive explicit lower bounds on the generated stepsizes, and report numerical experiments on minimax problems, equilibrium models, and regularized regression.

fields
Optimization and Control
pdf ↗ page arXiv:2609.15936 ↗