Approximate Solutions of a Fixed-Point Problem with an Algorithm Based on Unions of Nonexpansive Mappings
Alexander J. Zaslavski · Mathematics · 2023
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.