A new self-adaptive inertial CQ-algorithm for solving convex feasibility and monotone inclusion problems

Abstract

Abstract Using a dynamical step size technique, a new self-adaptive CQ-algorithm is proposed in the presence of an inertial term to find the solution of convex feasibility problem and monotone inclusion problem involving a finite number of maximal monotone set valued operators. To do this, in certain Banach spaces, we construct an algorithm which converges to the fixed point of right Bregman strongly nonexpansive mappings and coincidentally solves the convex feasibility and monotone inclusion problems. Strong convergence of the algorithm is achieved without computation of the associated operator norms. Interesting numerical examples which illustrate the implementation and efficiency of our scheme are also given. Results obtained via this work improve and extend on previous results of its kind, in the literature.