Forward-backward splitting algorithm with self-adaptive method for finite family of split minimization and fixed point problems in Hilbert spaces

In this paper, we introduce an inertial forward-backward splitting method together with a Halpern iterative algorithm for approximating a common solution of a finite family of split minimization problem involving two proper, lower semicontinuous and convex functions and fixed point problem of a nonexpansive mapping in real Hilbert spaces. Under suitable conditions, we proved that the sequence generated by our algorithm converges strongly to a solution of the aforementioned problems. The stepsizes studied in this paper are designed in such a way that they do not require the Lipschitz continuity condition on the gradient and prior knowledge of operator norm. Finally, we illustrate a numerical experiment to show the performance of the proposed method. The result discussed in this paper extends and complements many related results in literature.