A faster fixed point iterative algorithm and its application to optimization problems

Abstract

<p>In this paper, we studied the AA-iterative algorithm for finding fixed points of the class of nonlinear generalized $ (\alpha, \beta) $-nonexpansive mappings. First, we proved weak convergence and then proved several strong convergence results of the scheme in a ground setting of uniformly convex Banach spaces. We gave a few numerical examples of generalized $ (\alpha, \beta) $-nonexpansive mappings to illustrate the major outcomes. One example was constructed over a subset of a real line while the other one was on the two dimensional space with a taxicab norm. We considered both these examples in our numerical computations to show that our iterative algorithm was more effective in the rate of convergence corresponding to other fixed point algorithms of the literature. Some 2D and 3D graphs were obtained that supported graphically our results and claims. As applications of our major results, we solved a class of fractional differential equations, 2D Voltera differential equation, and a convex minimization problem. Our findings improved and extended the corresponding results of the current literature.</p>