Search

In this work, two inertial algorithms for approximating common elements of the sets of solutions of three important problems are constructed. The first problem is a generalized mixed equilibrium one involving relaxed monotone mapping, the second is a zero problem of inverse strongly monotone mappings, while the third one is a fixed point problem of a family of relatively nonexpansive mappings. The first algorithm is a shrinking projection type for a common solution of all the three problems. The second is a generalized Alber projection free method for the second and the third problems. Each of the devised algorithms uses the conjugate gradient-like direction, which allows it to accelerate its iterates toward a solution of the problems. The strong convergence theorem for each of the algorithms is formulated and proved in a real 2 - uniformly convex and uniformly smooth Banach space. Additionally, the applications of our algorithms to convex optimization problems and image recovery problems are studied. The advantages and computational efficiency of our methods are analyzed based on their numerical performance in comparison to some of the existing and recently proposed methods using numerical example. [ABSTRACT FROM AUTHOR]