European Journal of Mathematical Analysis (Oct 2021)

New Iterative Algorithm for Solving Constrained Convex Minimization Problem and Split Feasibility Problem

  • Austine Efut Ofem,
  • Unwana Effiong Udofia,
  • Donatus Ikechi Igbokwe

DOI
https://doi.org/10.28924/ada/ma.1.106
Journal volume & issue
Vol. 1
pp. 106 – 132

Abstract

Read online

The purpose of this paper is to introduce a new iterative algorithm to approximate the fixed points of almost contraction mappings and generalized α-nonexpansive mappings. Also, we show that our proposed iterative algorithm converges weakly and strongly to the fixed points of almost contraction mappings and generalized α-nonexpansive mappings. Furthermore, it is proved analytically that our new iterative algorithm converges faster than one of the leading iterative algorithms in the literature for almost contraction mappings. Some numerical examples are also provided and used to show that our new iterative algorithm has better rate of convergence than all of S, Picard-S, Thakur and M iterative algorithms for almost contraction mappings and generalized α-nonexpansive mappings. Again, we show that the proposed iterative algorithm is stable with respect to T and data dependent for almost contraction mappings. Some applications of our main results and new iterative algorithm are considered. The results in this article are improvements, generalizations and extensions of several relevant results existing in the literature.

Keywords