Answers are grounded in this paper and cite their sources.
Demonstrates approximate solutions for variational inequality problems affected by computational errors.
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.
No takes yet. Share an insight, caveat, or question.
Alexander J. Zaslavski (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: