The dynamic string-averaging algorithm for a family of variational inequalities
Optimization Eruditorum, Volume 3, Issue 3, December 2026, Pages 172–182
Alexander J. Zaslavski
Department of Mathematics, The Technion - Israel Institute of Technology, 32000 Haifa, Israel
Abstract
In a Hilbert space, we study the convergence of the combination of the dynamic string-averaging algorithm and the subgradient method to a common solution of a finite family of variational inequalities and of a finite family of fixed point problems. We show that most exact iterates of our algorithm are approximate common solutions of the family of variational inequalities and approximate common fixed points for the family of mappings.
Cite this Article as
Alexander J. Zaslavski, The dynamic string-averaging algorithm for a family of variational inequalities, Optimization Eruditorum, 3(3), 172–182, 2026