The iterative method for inverse strongly-monotone mappings
Fixed Point Methods and Optimization, Volume 3, Issue 2, August 2026, Pages 76–97
ALEXANDER J. ZASLAVSKI
Department of Mathematics, The Technion – Israel Institute of Technology, 32000 Haifa, Israel
Abstract
In this paper we study the iteration process introduced by Takahashi and M. Toyoda (2003) for solving a a variational inequality problem generated by inverse strongly-monotone mapping. We obtain an approximate common solution of a finite family of variational inequalities and of a finite family of fixed point problems under the presence of computational errors. Our results are established under summable and nonsummable computational errors. We show that the method generates a good approximate solution, if the sequence of computational errors is bounded from above by a constant.
Cite this Article as
Alexander J. Zaslavski, The iterative method for inverse strongly-monotone mappings, Fixed Point Methods and Optimization, 3(2), 76–97, 2026