Affiliation:
1. Department of Mathematics, Technion–Israel Institute of Technology, Haifa 3200003, Israel
Abstract
In this paper, we study a fixed-point problem with a set-valued mapping by using an algorithm based on unions of nonexpansive mappings. We show that an approximate solution is reached after a finite number of iterations in the presence of computational errors. This result is an extension of the results known in the literature.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference23 articles.
1. An unifying approach for some nonexpansiveness conditions on modular vector spaces;Bejenaru;Nonlinear Anal. Model. Control,2020
2. Goebel, K., and Kirk, W.A. (1990). Topics in Metric Fixed Point Theory, Cambridge University Press.
3. Goebel, K., and Reich, S. (1984). Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings, Marcel Dekker.
4. Kassab, W., and Turcanu, T. (2019). Numerical reckoning fixed points of (E)-type mappings in modular vector spaces. Mathematics, 7.
5. Khamsi, M.A., and Kozlowski, W.M. (2015). Fixed Point Theory in Modular Function Spaces, Birkhäser/Springer.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithms Based on Unions of Nonexpansive Maps;Springer Optimization and Its Applications;2023-12-22
2. Introduction;Springer Optimization and Its Applications;2023-12-22