A new faster iteration process applied to constrained minimization and feasibility problems

Abstract

We introduce a new iteration process and prove that it is faster than all of
\nPicard, Mann and Agarwal et al. processes. We support analytic proof by a numerical example.
\nOur process is independent of all three processes just mentioned. We also prove some weak and
\nstrong convergence theorems for two nonexpansive mappings. Moreover, we apply our results to
\nfind solutions of constrained minimization problems and feasibility problems.