arXiv · 2611.20296
Descending Everest, Part III: Oracle Complexity of Monotone Variational Inequalities with $(L_0,L_1)$-Lipschitz Operators
Abstract
We consider monotone variational inequalities in which the Jacobian norm of the operator $F:\mathbb{R}^d\to\mathbb{R}^d$ is bounded by an affine function of the norm of the operator itself: $\|DF(z)\|\le L_0+L_1\|F(z)\|$. The main case is the problem on the whole space, that is, finding a zero of $F$. We assume that a solution exists and that an upper bound $R$ on the distance from the starting point to the solution is known. Neither strong monotonicity nor cocoercivity is assumed. Global Lipschitz continuity is not assumed either: for $L_1>0$, the Jacobian norm may grow together with the norm of the operator. We obtain upper and lower bounds on the number of oracle calls sufficient to find a point $\hat z$ with $\|F(\hat z)\|\le\varepsilon$. For $L_0R/\varepsilon\ge1$, both bounds are, up to logarithmic factors in $L_1R$, of order $1+L_0R/\varepsilon+(L_1R)^{6/5}$. The upper bound is attained by a deterministic extragradient-type method, and the lower bound holds for arbitrary randomized methods. The same bounds are obtained for the Minty gap on the ball of radius $R$, where $L_0R/\varepsilon$ is replaced by $L_0R^2/η$. In addition, we show that for a variational inequality on a bounded set the numbers $L_0,L_1$ and the diameter of the set are not sufficient: a uniform complexity bound requires additional information, for example, an upper bound on the norm of the operator at the solution.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mikhail Rudomanov, Ivan Fomin, Alexander V. Gasnikov, Fedor S. Stonyakin. 2026-11-15. Descending Everest, Part III: Oracle Complexity of Monotone Variational Inequalities with $(L_0,L_1)$-Lipschitz Operators. https://searcharxiv.com/abs/2611.20296
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.