An algorithm based on a set-valued nonexpansive mapping
Communications in Optimization Theory · 2022
In this paper, we generalize a recent convergence result of Tam (2018) which was proved for iterates of a set-valued operator such that its values can be expressed as a finite union of values of single-valued paracontracting operators.It is shown that this convergence result is true for a general set-valued mapping such that its values are not necessarily finite unions of values of single-valued operators.