“…In this paper, we will focus our attention on problem (1.1), which is very general in the sense that it includes, as special cases, convexly constrained linear inverse problems, split feasibility problem, convexly constrained minimization problems, fixed point problems, variational inequalities, Nash equilibrium problem in noncooperative games and others; see, for instance, [2,3,9,10,19] and the references therein. Because of their importance, forward-backward splitting methods, which were proposed by Passty [18], and, in a dual form for convex programming, by Han and Lou [13], for solving (1.1) have been studied extensively recently; see, for instance, [4,15,20,21,25] and the references therein.…”