PICARD TYPE ITERATIVE METHOD WITH APPLICATIONS TO MINIMIZATION PROBLEMS AND SPLIT FEASIBILITY PROBLEMS

Abstract

In this paper, we study convergence analysis of a Picard type iterative algorithm for finding fixed points of nonexpansive mappings in the setting of Hilbert spaces. As an application of our result, we propose a new gradient projection algorithm for solving convex minimization problems and derive weak convergence result of such algorithm. An example is presented to illustrate our algorithm and result. As another application of our result, we present an algorithm for solving split feasibility problems and discuss the weak convergence of the algorithm.