Solving of a Variational Inequality Problem Under the Presence of Computational Errors
Mathematics · 13.02.2026 · 14 (4) · 664
DOI: 10.3390/math14040664 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 13.02.2026. Verfasst von Alexander J. Zaslavski. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 11 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Zaslavski, A. J. (2026). Solving of a Variational Inequality Problem Under the Presence of Computational Errors. Mathematics, 14(4), 664. https://doi.org/10.3390/math14040664
Vancouver
Zaslavski AJ. Solving of a Variational Inequality Problem Under the Presence of Computational Errors. Mathematics. 2026;14(4):664. doi:10.3390/math14040664
BibTeX
@article{Zaslavski2026,
author = {Zaslavski, Alexander J.},
title = {Solving of a Variational Inequality Problem Under the Presence of Computational Errors},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {4},
pages = {664},
doi = {10.3390/math14040664}
}
EUVIMED