Solving of a Variational Inequality Problem Under the Presence of Computational Errors
Abstract
W. Takahashi and M. Toyoda (2003) proved weak convergence of an iteration process of solving a variational inequality problem for an inverse strongly-monotone mapping. In our recent work we showed that, for the same iterative process, most of its exact iterates are approximate solutions of the variational inequality. In this paper, we show that the iteration process for solving a variational inequality problem for an inverse strongly monotone mapping generates an approximate solution in the presence of small computational errors. We also estimate a number of iterates needed in order to obtain such an approximate solution.
Fields of Study & Subjects
Optimization and Variational Analysis
Contact Mechanics and Variational Inequalities
Stochastic Gradient Optimization Techniques
Publication details
- Journal / source
- Mathematics
- Publisher
- MDPI AG
- Volume
- 14
- Issue
- 4
- Pages
- 664–664
- Publication date
- 13 February 2026
- Language
- EN