Iterative algorithms and fixed point theorems for mean nonexpansive set-valued mappings in graphical convex metric spaces

Abstract

In this work, a series of fixed point results of the Ishikawa iterative algorithm and the SP iterative algorithm are presented in graphical convex metric spaces. First, we introduce the concepts of mean nonexpansive set-valued mappings in the above space. Furthermore, we study the existence and uniqueness of fixed points for mean nonexpansive set-valued mappings in graphical convex metric spaces. It is shown that the proposed two iterative sequences can both converge to a fixed point of the mean nonexpansive set-valued mapping. Meanwhile, we demonstrate the hypotheses of the existence theorem of fixed points for mean nonexpansive set-valued mappings by providing an example in G-complete graphical convex metric spaces are sufficient but not necessary.