Abstract
In this paper, we study a feasibility problem with infinitely many sets in a metric space. We present a novel algorithm and analyze its convergence. The algorithms used for the feasibility problem in the literature work for finite collections of sets and cannot be applied if the collection of sets is infinite. The main feature of these algorithms is that, for iterative steps, we need to calculate the values of all the operators belonging to our family of maps and even their sums with weighted coefficients. This is impossible if the family of maps is not finite. In the present paper, we introduce a new algorithm for solving feasibility problems with infinite families of sets and study its convergence. It turns out that our results hold for feasibility problems in a general metric space.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
