A new iteration technique for nonlinear operators as concerns convex programming and feasibility problems.

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]