An inertial based forward–backward algorithm for monotone inclusion problems and split mixed equilibrium problems in Hilbert spaces

Iterative algorithms are widely applied to solve convex optimization problems under a suitable set of constraints. In this paper, we develop an iterative algorithm whose architecture comprises a modified version of the forward-backward splitting algorithm and the hybrid shrinking projection algorithm. We provide theoretical results concerning weak and strong convergence of the proposed algorithm towards a common solution of the monotone inclusion problem and the split mixed equilibrium problem in Hilbert spaces. Moreover, numerical experiments compare favorably the efficiency of the proposed algorithm with the existing algorithms. As a consequence, our results improve various existing results in the current literature.