Search

The aim of this work is to develop an S-iteration technique for finding common fixed points for nonself quasi-nonexpansive mappings in the framework of a uniformly convex Banach space. Convergence properties of the proposed algorithm are analyzed in the setting of uniformly convex Banach spaces. To prove the usability of our results, some novel applications are provided, focused on zeros of accretive operators, convex programming, and feasibility problems. Some numerical experiments with real datasets for Lasso problems are provided. [ABSTRACT FROM AUTHOR]

The Mann iterates behave well for nonexpansive mappings for any initial guess in the domain. Our aim in this article is to extend this method to a broad class of inexact fixed point algorithms generated by nearly nonexpansive sequences in Banach spaces and to locate the weak limit of the iterates by its initial guesses. Due to the inexactness, our algorithms become efficiently applicable for a wider class of problems. As applications, we give convergence theorems for finding solutions of variational inclusion problems and constrained multiple-sets split feasibility problems. Our results are significant refinements and improvements of the corresponding results in the literature. [ABSTRACT FROM AUTHOR]