English

The Popov's Algorithm with Optimal Bounded Stepsize for Generalized Monotone Variational Inequalities

Optimization and Control 2026-03-09 v1

Abstract

For solving constrained (pseudo)-monotone variational inequality, we prove that the upper bound of stepsize 12L\frac{1}{2L} established for the Popov's algorithm and the forward-reflected-backward algorithm is tight. For unconstrained case, we can enlarge the upper bound to 13L\frac{1}{\sqrt{3}L} and show that this upper bound is also tight. The convergence analysis is carried out by using a new Lyapunov-type function.

Keywords

Cite

@article{arxiv.2603.06442,
  title  = {The Popov's Algorithm with Optimal Bounded Stepsize for Generalized Monotone Variational Inequalities},
  author = {Nhung Hong Nguyen and Thanh Quoc Trinh and Phan Tu Vuong},
  journal= {arXiv preprint arXiv:2603.06442},
  year   = {2026}
}
R2 v1 2026-07-01T11:07:14.334Z