1 Introduction

Throughout this paper, we assume that H is a real Hilbert space with inner product , and norm . Let C be a nonempty closed convex subset of H. A self-mapping f:CC is said to be a contraction on C if there exists a constant α(0,1) such that f(x)f(y)αxy, x,yC. We denote by Π C the collection of mappings f verifying the above inequality and note that each f Π C has a unique fixed point in C.

A mapping T:CC is said to be λ-strictly pseudo-contractive if there exists a constant λ[0,1) such that

T x T y 2 x y 2 +λ ( I T ) x ( I T ) y 2 ,x,yC,
(1.1)

and we denote by F(T) the set of fixed points of the mapping T; that is, F(T)={xC:Tx=x}.

Note that T is the class of λ-strictly pseudo-contractive mappings including the class of nonexpansive mappings T on C (that is, TxTyxy, x,yC) as a subclass. That is, T is nonexpansive if and only if T is 0-strictly pseudo-contractive.

A mapping F:CC is called k-Lipschitzian if there exists a positive constant k such that

FxFykxy,x,yC.
(1.2)

F is said to be η-strongly monotone if there exists a positive constant η such that

FxFy,xyη x y 2 ,x,yC.
(1.3)

Definition 1.1 A bounded linear operator A is said to be , if there exists a constant γ ¯ >0 such that

Ax,x γ ¯ x 2 ,xH.

In 2006, Marino and Xu [1] introduced the following iterative scheme: for x 1 =xC,

x n + 1 = α n γf( x n )+(I α n A)T x n ,n1.
(1.4)

They proved that under appropriate conditions of the sequence { α n }, the sequence { x n } generated by (1.4) converges strongly to the unique solution of the variational inequality (γfA)q,pq0, pF(T), which is the optimality condition for the minimization problem

min x C 1 2 Ax,xh(x),

where h is a potential function for γf (i.e., h (x)=γf(x) for xH).

In 2010, Jung [2] extended the result of Marino and Xu [1] to the class of k-strictly pseudo-contractive mappings T:CH with F(T) and introduced the following iterative scheme: for x 1 =xC,

{ y n = β n x n + ( 1 β n ) P C S x n , x n + 1 = α n γ f ( x n ) + ( I α n A ) y n , n 1 ,
(1.5)

where S:CH is a mapping defined by Sx=kx+(1k)Tx. He proved that the sequence { x n } generated by (1.5) converges strongly to a fixed point q of T, which is the unique solution of the variational inequality

γ f ( q ) A q , p q 0,pF(T).

Later, Tian [3] considered the following iterative method for a nonexpansive mapping T:HH with F(T),

x n + 1 = α n γf( x n )+(Iμ α n F)T x n ,n1,
(1.6)

where F is a k-Lipschitzian and η-strongly monotone operator. He proved that the sequence { x n } generated by (1.6) converges to a fixed point q in F(T), which is the unique solution of the variational inequality

( γ f μ F ) q , p q 0,pF(T).

In 2010, Saeidi [4] introduced the following modified hybrid steepest-descent iterative algorithm for finding a common element of the set of solutions of a system of equilibrium problems for a family F={ F j :C×CR,j=1,2,,M} and the set of common fixed points for a family of infinitely nonexpansive mappings S={ S i :CC} with respect to W-mappings (see [5]):

{ y n = W n J r M , n F M J r 2 , n F 2 J r 1 , n F 1 x n , x n + 1 = β x n + ( 1 β ) ( I λ n B ) y n , n N ,
(1.7)

where B is a relaxed (γ,r)-cocoercive, k-Lipschitzian mapping such that r>γ k 2 . Then, under weaker hypotheses on coefficients, he proved the strongly convergence of the proposed iterative algorithm to the unique solution of the variational inequality.

Recently, Wang [6] extended and improved all the above results. He introduced a new iterative scheme: for x 1 =xC,

{ y n = β n x n + ( 1 β n ) W n x n , x n + 1 = α n γ f ( x n ) + ( I μ α n F ) y n , n 1 ,
(1.8)

where W n is a mapping defined by (2.3), and F is a k-Lipschitzian and η-strongly monotone operator with 0<μ<2η/ k 2 . He proved that the sequence { x n } generated by (1.7) converges strongly to a common fixed point of an infinite family of λ i -strictly pseudo-contractive mappings, which is a unique solution of the variational inequality

( γ f μ F ) q , p q 0,p i = 1 F( T i ).

Very recently, He, Liu and Cho [7] introduced an explicit scheme which was defined by the following suitable sequence:

z n + 1 = ϵ n γf( z n )+(I ϵ n A) W n S r 1 , n 1 S r 2 , n 2 S r K , n K z n ,nN.

They generated W n -mapping by { T i } and { λ n } where { T i } is a family of nonexpansive mappings from H into itself. They found that if { r k , n } k = 1 K , { ϵ n } and { λ n } satisfy appropriate conditions and F:=( k = 1 K SEP( G K ))( n N F( T n )), then { z n } converges strongly to x F, which satisfies the variational inequality (Aγf) x ,x x 0 for all xF.

In this paper, we introduce a new iterative scheme in a Hilbert space H which is a mixed iterative scheme of (1.7) and (1.8). We prove that the sequence converges strongly to a common element of the set of solutions of the system of equilibrium problems and the set of common fixed points of an infinite family of strictly pseudo-contractive mappings by using a viscosity hybrid steepest-descent method. The results obtained in this paper improved and extended the above mentioned results and many others. Finally, we give a simple numerical example to support and illustrate our main theorem in the last part.

2 Preliminaries

Let H be a real Hilbert space and C be a nonempty closed convex subset of H. We have

x y 2 = x 2 + y 2 2x,y,x,yH.
(2.1)

Recall that the nearest projection P C from H to C assigns to each xH the unique point P C xC satisfying the property

x P C x= min y C xy.

We recall some lemmas which will be needed in the rest of this paper.

Lemma 2.1 In a Hilbert space H, the following inequality holds:

x + y 2 x 2 +2y,x+y,x,yH.

Lemma 2.2 Let B be a k-Lipschitzian and η-strongly monotone operator on a Hilbert space H with k>0, η>0, 0<μ<2η/ k 2 and 0<t<1. Then S=(ItμB):HH is a contraction with a contractive coefficient 1tτ and τ= 1 2 μ(2ημ k 2 ).

Proof From (1.2), (1.3) and (2.1), we have

S x S y 2 = ( x y ) t μ ( B x B y ) 2 = x y 2 + t 2 μ 2 B x B y 2 2 μ t B x B y , x y x y 2 + t 2 μ 2 k 2 x y 2 2 μ t η x y 2 = [ 1 t μ ( 2 η μ k 2 ) ] x y 2 ( 1 t τ ) 2 x y 2 ,

where τ= 1 2 μ(2ημ k 2 ), and so, SxSy(1tτ)xy.

Hence, S is a contraction with a contractive coefficient 1tτ. □

Lemma 2.3 Let H be a Hilbert space. For a given zH and uC,

u= P C zuz,vu0,vC.

Lemma 2.4 Let H be a real Hilbert space. For q which solves the variational inequality (γfμB)q,pq0, f Π H , pF(T), the following statement is true:

( γ f μ B ) q , p q 0 P Θ (IμB+γf)q=q,
(2.2)

where Θ:=( i = 1 F( T i ))( j = 1 M SEP( F j )).

Proof From Lemma (2.3), it follows that

q = P Θ ( I μ B + γ f ) q q ( I μ B + γ f ) q , p q 0 , p Θ , ( μ B γ f ) q , p q 0 ( γ f μ B ) q , p q 0 .

 □

Lemma 2.5 [8]

Let C be a closed convex subset of a Hilbert space H and T:CC be a nonexpansive mapping with F(T); if the sequence { x n } weakly converges to x and (IT) x n converges strongly to y, then (IT)x=y.

Lemma 2.6 [9]

Let { x n } and { z n } be bounded sequences in a Banach space E and { γ n } be a sequence in [0,1] which satisfies the following condition:

0< lim inf n γ n lim sup n γ n <1.

Suppose that x n + 1 = γ n x n +(1 γ n ) z n , n0 and lim sup n ( z n + 1 z n x n + 1 x n )0. Then lim n z n x n =0.

Lemma 2.7 [10, 11]

Let { s n } be a sequence of non-negative real numbers satisfying

s n + 1 (1 λ n ) s n + λ n δ n + γ n ,n0,

where { λ n }, { δ n } and { γ n } satisfy the following conditions:

  1. (i)

    { λ n }[0,1] and n = 0 =;

  2. (ii)

    lim sup n δ n 0 or n = 0 λ n δ n <;

  3. (iii)

    γ n 0 (n0), n = 0 γ n <.

Then lim n s n =0.

Lemma 2.8 [12]

Let C be a nonempty closed convex subset of a real Hilbert space H and T:CC be a λ-strictly pseudo-contractive mapping. Define a mapping S:CC by Sx=αx+(1α)Tx for all xC and α[λ,1). Then S is a nonexpansive mapping such that F(S)=F(T).

In this work, we defined the mapping W n by

U n , n + 1 = I , U n , n = γ n T n U n , n + 1 + ( 1 γ n ) I , U n , n 1 = γ n 1 T n 1 U n , n + ( 1 γ n 1 ) I , U n , k = γ k T k U n , k + 1 + ( 1 γ k ) I , U n , k 1 = γ k 1 T k 1 U n , k + ( 1 γ k 1 ) I , U n , 2 = γ 2 T 2 U n , 3 + ( 1 γ 2 ) I , W n = U n , 1 = γ 1 T 1 U n , 2 + ( 1 γ 1 ) I ,
(2.3)

where γ 1 , γ 2 , are real numbers such that 0 γ n 1, T i = θ i I+(1 θ i ) T i where T i is a λ i -strictly pseudo-contractive mapping of C into itself and θ i [ λ i ,1). By Lemma 2.8, we know that T i is a nonexpansive mapping and F( T i )=F( T i ). As a result, it can be easily seen that W n is also a nonexpansive mapping.

Lemma 2.9 [5]

Let C be a nonempty closed convex subset of a strictly convex Banach space E. Let T 1 , T 2 , be nonexpansive mappings of C into itself such that i = 1 F( T i ) and γ 1 , γ 2 , be real numbers such that 0< γ i b<1 for each i=1,2,. Then for any xC and kN, the limit lim n U n , k x exists.

By using Lemma 2.8, one can define the mapping W of C into itself as follows:

Wx:= lim n W n x= lim n U n , 1 x,xC.
(2.4)

Such a mapping W is called the modified W-mapping generated by T 1 , T 2 , , γ 1 , γ 2 , and θ 1 , θ 2 , .

Lemma 2.10 [5]

Let C be a nonempty closed convex subset of a strictly convex Banach space E. Let T 1 , T 2 , be nonexpansive mappings of C into itself such that i = 1 F( T i ) and γ 1 , γ 2 , be real numbers such that 0< γ i b<1 for each i=1,2,. Then F(W)= i = 1 F( T i ).

Combining Lemmas 2.7-2.9, one can get that F(W)= i = 1 F( T i )= i = 1 F( T i ).

Lemma 2.11 [13]Let C be a nonempty closed convex subset of a Hilbert space H, { T i :CC} be a family of infinite nonexpansive mappings with i = 1 F( T i ), { γ i } be a real sequence such that 0< γ i b<1, for each i1. If K is any bounded subset of C, then

lim n sup x K Wx W n x=0.
(2.5)

For solving the equilibrium problem, let us give the following assumptions on a bifunction F:C×CR, which were imposed in [14]:

(A1) F(x,x)=0 for all xC;

(A2) F is monotone, i.e., F(x,y)+F(y,x)0 for all x,yC;

(A3) for each x,y,zC, lim t 0 F(tz+(1t)x,y)F(x,y);

(A4) for each xC, yF(x,y) is convex and lower semicontinuous.

Lemma 2.12 [14]

Let C be a nonempty closed convex subset of H, and let F be a bifunction of C×C intosatisfying (A1)-(A4). Then for r>0 and xH, there exists zC such that

F(z,y)+ 1 r yz,zx0.
(2.6)

Lemma 2.13 [15]

Let C be a nonempty closed convex subset of H, and let F be a bifunction of C×C intosatisfying (A1)-(A4). For r>0, define a mapping J r F :HC as follows:

J r F (x)= { z C : F ( z , y ) + 1 r y z , z x 0 , y C }
(2.7)

for all xH. Then the following conclusions hold:

  1. (1)

    J r F is single-valued;

  2. (2)

    J r F is firmly nonexpansive, i.e., for any x,yH,

    J r F ( x ) J r F ( y ) 2 J r F ( x ) J r F ( y ) , x y ;
  3. (3)

    F( J r F )=EP(F);

  4. (4)

    EP(F) is closed and convex.

Lemma 2.14 [5]

Let C be a nonempty closed convex subset of a real Hilbert space H. Let T= { T i } i = 1 N be an infinite family of nonexpanxive mappings with F(T)= i = 1 F( T i ) and { γ i } be a real sequence such that 0< γ i b<1 for each i1. Then:

  1. (1)

    W n is nonexpansive and F( W n )= i = 1 n F( T i ) for each n1;

  2. (2)

    for each xC and for each positive integer k, the limit lim n U n , k x exists;

  3. (3)

    the mapping W:CC defined by Wx= lim n W n x= lim n U n , 1 x is a nonexpansive mapping satisfying F(W)=F(T) and it is called the W-mapping generated by T 1 , T 2 , and γ 1 , γ 2 ,;

  4. (4)

    if K is any bounded subset of C, then lim n sup x K Wx W n x=0.

3 Main results

In this section, we will introduce an iterative scheme by using a viscosity hybrid steepest-descent method for finding a common element of the set of variational inequalities, fixed points for an infinite family of strictly pseudo-contractive mappings and the set of solutions of a system of equilibrium problems in a real Hilbert space.

Theorem 3.1 Let C be a nonempty closed convex subset of a real Hilbert space H, let T i :HH be a λ i -strictly pseudo-contractive mapping with i = 1 F( T i ), F={ F j :j=1,2,3,,M} be a finite family of bifunctions C×C intosatisfying (A1)-(A4) and γ i be a real sequence such that 0 γ i b1 for each i1. Let B be a k-Lipschitzian and η-strongly monotone operator on C with 0<μ<η/ k 2 and f Π H with 0<γ<μ(η μ k 2 2 )/α=τ/α and τ<1. Assume that Θ:=( i = 1 F( T i ))( j = 1 M SEP( F j )). Let the mapping W n be defined by (2.3). Let { x n } be the sequence generated by x 1 H and

{ u n = J r M , n F M J r M 1 , n F M 1 J r 2 , n F 2 J r 1 , N F 1 x n , y n = β n x n + ( 1 β n ) W n u n , x n + 1 = α n γ f ( x n ) + ( I α n μ B ) y n , n N and n 1 ,
(3.1)

where { α n } and { β n } are sequences in (0,1) which satisfy the following conditions:

(C1) lim n α n =0 and Σ n = 1 α n =;

(C2) 0< lim inf n β n < lim sup n β n a<1 for some constant a(0,1);

(C3) lim inf n r j , n >0, for each j=1,2,,M.

Then the sequence { x n } converges strongly to qΘ, where q= P Θ (IμB+γf)q, which is the unique solution of the variational inequality

( γ f μ B ) q , p q 0,pΘ,
(3.2)

or equivalently, q is the unique solution of the minimization problem

min x Θ 1 2 Ax,x+h(x),

where h is a potential function for γf.

Proof We will divide the proof of Theorem 3.1 into several steps.

Step 1. We show that { x n } is bounded. Let pΘ. Since for each k=1,2,3,,M, J r k , n F k is nonexpansive. Given n k = J r k , n F k J r k 1 , n F k 1 J r k 2 , n F k 2 J r 2 , n F 2 J r 1 , n F 1 for k{1,2,3,,M} and n 0 =I, for each nN, we have

n k x n p = n k x n n k p x n p.

Consider,

y n p = β n x n + ( 1 β n ) W n u n p = β n ( x n p ) + ( 1 β n ) ( W n u n p ) β n x n p + ( 1 β n ) ( W n u n p ) = β n x n p + ( 1 β n ) W n n M x n p β n x n p + ( 1 β n ) n M x n p β n x n p + ( 1 β n ) x n p = x n p .
(3.3)

From Lemma 2.2, (3.1) and (3.3), it follows that

x n + 1 p = α n γ f ( x n ) + ( I α n μ B ) y n p = α n ( γ f ( x n ) μ B p ) + ( I α n μ B ) y n ( I α n μ B ) p = ( I α n μ B ) ( y n p ) + α n ( γ f ( x n ) μ B p + γ f ( p ) γ f ( p ) ) ( I α n μ B ) ( y n p ) + α n γ f ( x n ) f ( p ) + α n γ f ( p ) μ B p ( 1 α n τ ) y n p + α n γ α x n p + α n γ f ( p ) μ B p ( 1 α n τ ) x n p + α n γ α x n p + α n γ f ( p ) μ B p = [ 1 α n ( τ γ α ) ] x n p + α n τ γ α τ γ α γ f ( p ) μ B p max { x n p , γ f ( p ) μ B p τ γ α } ; n 1 .
(3.4)

By mathematical induction, we have

x n pmax { x 1 p , γ f ( p ) μ B p τ γ α } ,n1,
(3.5)

and we obtain { x n } is bounded. So are { y n }, { W n n k ( x n )} and {f( x n )}.

Step 2. We claim that if { x n } is a bounded sequence in C, then

lim n n k x n n + 1 k x n =0
(3.6)

for every k{1,2,3,,M}. From Step 2 of the proof in [[16], Theorem 3.1], we have for k{1,2,3,,M},

lim n J r k , n + 1 F k x n J r k , n F k x n =0.
(3.7)

Note that for every k{1,2,3,,M}, we have

n k = J r k , n F k J r k 1 , n F k 1 J r k 2 , n F k 2 J r 2 , n F 2 J r 1 , n F 1 = J r k , n F k n k 1 .

So, we note that

n k x n n + 1 k x n = J r k , n F k n k 1 x n J r k , n + 1 F k n + 1 k 1 x n J r k , n F k n k 1 x n J r k , n + 1 F k n k 1 x n + J r k , n + 1 F k n k 1 x n J r k , n + 1 F k n + 1 k 1 x n J r k , n F k n k 1 x n J r k , n + 1 F k n k 1 x n + n k 1 x n n + 1 k 1 x n J r k , n F k n k 1 x n J r k , n + 1 F k n k 1 x n + J r k 1 , n F k 1 n k 2 x n J r k 1 , n + 1 F k 1 n k 2 x n + n k 2 x n n + 1 k 2 x n J r k , n F k n k 1 x n J r k , n + 1 F k n k 1 x n + J r k 1 , n F k 1 n k 2 x n J r k 1 , n + 1 F k 1 n k 2 x n + + J r 2 , n F 2 n 1 x n J r 2 , n + 1 F 2 n 1 x n + J r 1 , n F 1 x n J r 1 , n + 1 F 1 x n .
(3.8)

Now, applying (3.7) to (3.8), we conclude (3.6).

Step 3. We show that lim n x n + 1 x n =0.

We define a sequence { z n } by z n =( x n + 1 β n x n )/(1 β n ), so that x n + 1 = β n x n +(1 β n ) z n . We now observe that

z n + 1 z n = x n + 2 β n + 1 x n + 1 1 β n + 1 x n + 1 β n x n 1 β n = α n + 1 γ f ( x n + 1 ) + ( I μ α n + 1 B ) y n + 1 β n + 1 x n + 1 1 β n + 1 α n γ f ( x n ) + ( I μ α n B ) y n β n x n 1 β n = α n + 1 ( γ f ( x n + 1 ) μ B y n + 1 ) 1 β n + 1 α n ( γ f ( x n ) μ B y n ) 1 β n + W n + 1 u n + 1 W n u n .
(3.9)

It follows from (3.9) that

z n + 1 z n α n + 1 1 β n + 1 ( γ f ( x n + 1 ) + μ B y n + 1 ) + α n 1 β n ( γ f ( x n ) + μ B y n ) + W n + 1 u n + 1 W n u n .
(3.10)

We observe that

(3.11)

and compute

W n + 1 n k x n + 1 W n n k x n W n + 1 n k x n + 1 W n + 1 n k x n + W n + 1 n k x n W n n k x n x n + 1 x n + W n + 1 n k x n W n n k x n .
(3.12)

Consider,

W n + 1 n k x n W n n k x n = γ 1 T 1 U n + 1 , 2 n k x n γ 1 T 1 U n , 2 n k x n γ 1 U n + 1 , 2 n k x n U n , 2 n k x n = γ 1 γ 2 T 2 U n + 1 , 3 n k x n γ 2 T 2 U n , 3 n k x n γ 1 γ 2 γ n U n + 1 , n + 1 n k x n U n , n + 1 n k x n M 1 i = 1 n γ i ,
(3.13)

where M 1 0 is a constant such that U n + 1 , n + 1 u n U n , n + 1 u n M 1 for all n1.

Substituting (3.11) and (3.13) into (3.10), we can obtain

z n + 1 z n α n + 1 1 β n + 1 ( γ f ( x n + 1 ) + μ B y n + 1 ) + α n 1 β n ( γ f ( x n ) + μ B y n ) + W n + 1 n + 1 k x n + 1 W n + 1 n k x n + 1 + x n + 1 x n + M 1 i = 1 n γ i M 2 ( α n + 1 1 β n + 1 + α n 1 β n ) + W n + 1 n + 1 k x n + 1 W n + 1 n k x n + 1 + x n + 1 x n + M 1 i = 1 n γ i
(3.14)

where M 2 =sup{γf( x n )+μB y n ,n1}.

It follows from (3.14) that

z n + 1 z n M 2 ( α n + 1 1 β n + 1 + α n 1 β n ) + n + 1 k x n + 1 n k x n + 1 + x n + 1 x n + M 1 i = 1 n γ i .

Hence, we have

z n + 1 z n x n + 1 x n M 2 ( α n + 1 1 β n + 1 + α n 1 β n ) + n + 1 k x n + 1 n k x n + 1 + M 1 i = 1 n γ i .

From lim n n k x n n + 1 k x n =0 and the condition lim n α n =0 and 0< lim n inf β n < lim n sup β n a<1 for some a(0,1), it follows that

lim n sup ( z n + 1 z n x n + 1 x n ) 0.
(3.15)

By Lemma 2.5, we obtain

lim n z n x n =0.
(3.16)

From x n + 1 = β n x n +(1 β n ) z n and by (3.16), we get

x n + 1 x n =(1 β n ) z n x n .
(3.17)

Hence,

lim n x n + 1 x n = lim n (1 β n ) z n x n =0.

Step 4. We claim that lim n x n W n u n =0.

x n W n u n x n x n + 1 + x n + 1 W n u n = x n x n + 1 + α n γ f ( x n ) + ( I α n μ B ) y n W n u n = x n x n + 1 + α n γ f ( x n ) + y n α n μ B y n W n u n x n + 1 x n + α n γ f ( x n ) μ B y n + y n W n u n x n + 1 x n + α n γ f ( x n ) μ B y n + β n x n + ( 1 β n ) W n u n W n u n x n + 1 x n + α n γ f ( x n ) μ B y n + β n x n W n u n .

It follows that

x n W n u n 1 1 β n x n x n + 1 + α n 1 β n γ f ( x n ) μ B y n .

By the conditions (C1) and (C2), we obtain

lim n x n W n u n =0.
(3.18)

Step 5. We show that

lim n n k x n n k + 1 x n =0,k=1,2,,M1
(3.19)

for any pΘ and k=1,2,,M1. We note that J r k + 1 , n F k + 1 is firmly nonexpansive by Lemma 2.12, then we observe that

n k + 1 x n p = J r k + 1 , n F k + 1 n k x n J r k + 1 , n F k + 1 p J r k + 1 , n F k + 1 n k x n J r k + 1 , n F k + 1 p , n k x n p = n k + 1 x n p , n k x n p = 1 2 ( n k + 1 x n p 2 + n k x n p 2 n k + 1 x n n k x n 2 ) ,

and hence

n k + 1 x n p 2 n k x n p 2 n k + 1 x n n k x n 2 x n p 2 n k + 1 x n n k x n 2 .
(3.20)

It follows that

x n + 1 p 2 = α n ( γ f ( x n ) μ B p ) + ( I α n μ B ) ( y n p ) 2 = α n 2 ( γ f ( x n ) μ B p ) 2 + ( 1 α n τ ) 2 y n p 2 + 2 α n ( γ f ( x n ) μ B p ) , ( I α n μ B ) ( y n p ) α n 2 ( γ f ( x n ) μ B p ) 2 + ( 1 α n τ ) 2 [ β n x n p 2 + ( 1 β n ) n M x n p 2 ] + 2 α n ( γ f ( x n ) μ B p ) , ( I α n μ B ) ( y n p ) ( 1 α n τ ) 2 β n x n p 2 + ( 1 α n τ ) 2 ( 1 β n ) n M x n p 2 + c n = ( 1 α n τ ) 2 β n x n p 2 + ( 1 2 α n ( τ γ ) ) ( 1 β n ) n M x n p 2 + α n 2 τ 2 ( 1 β n ) n M x n p 2 2 α n γ ( 1 β n ) n M x n p 2 + c n ( 1 α n τ ) 2 β n x n p 2 + ( 1 2 α n ( τ γ ) ) ( 1 β n ) n M x n p 2 + α n 2 τ 2 ( 1 β n ) n M x n p 2 + c n = ( 1 2 α n ( τ γ ) ) β n x n p 2 + α n 2 τ 2 β n x n p 2 2 α n γ β n x n p 2 + ( 1 2 α n ( τ γ ) ) ( 1 β n ) n k + 1 x n p 2 + α n 2 τ 2 ( 1 β n ) n M x n p 2 + c n = ( 1 2 α n ( τ γ ) ) β n x n p 2 + α n 2 τ 2 β n x n p 2 2 α n γ β n x n p 2 + ( 1 2 α n ( τ γ ) ) ( 1 β n ) [ x n p 2 n k + 1 x n n k x n 2 ] + α n 2 τ 2 ( 1 β n ) n M x n p 2 + c n ( 1 2 α n ( τ γ ) ) x n p 2 + α n 2 τ 2 x n p 2 ( 1 2 α n ( τ γ ) ) ( 1 β n ) n k + 1 x n n k x n 2 + c n ,

where

c n =2 α n ( γ f ( x n ) μ B p ) , ( I α n μ B ) ( y n p ) .
(3.21)

It follows from the condition (C1) that

lim n c n =0.
(3.22)

So, we obtain

Using the condition (C1), (3.17) and (3.22), we obtain

lim n n k + 1 x n n k x n =0,k=1,2,,M1.
(3.23)

Step 6. We show that lim sup n (γfμB)q, x n q0, where q= P Θ (IμB+γf)q.

The Banach contraction principle guarantees that P Θ (IμB+γf) has a unique fixed point q which is the unique solution of (3.1). Let { x n k } be a subsequence of { x n } such that

lim k ( γ f μ B ) q , x n m q =lim sup n ( γ f μ B ) q , x n q .

Since { x n k } is bounded, then there exists a subsequence { x n k i } which converges weakly to zH. Without loss of generality, we can assume that x n k z. We claim that zΘ.

Next, we need to show that z j = 1 M SEP( F j ). First, by (A2) and given yC and k{1,2,,M1}, we have

1 r k + 1 , n y n k + 1 x n , n k + 1 x n n k x n F k + 1 ( y , n k + 1 x n ) .

Thus,

y n m k + 1 x n m , n m k + 1 x n m n m k x n m r k + 1 , n m F k + 1 ( y , n m k + 1 x n m ) .
(3.24)

From (A4), F(y,) is a lower semicontinuous and convex, and thus weakly semicontinuous. The condition (C3) and (3.23) imply that

n m k + 1 x n m n m k x n m r k + 1 , n m 0,
(3.25)

in norm. Therefore, letting m in (3.24) yields

F k + 1 (y,z) lim m F k + 1 ( y , n m k + 1 x n m ) 0,

for all yH and k{1,2,,M1}. Replacing y with y t =ty+(1t)z with t(0,1) and using (A1) and (A4), we obtain

0= F k + 1 ( y t , y t )t F k + 1 ( y t ,y)+(1t) F k + 1 ( y t ,z)t F k + 1 ( y t ,y).

Hence, F k + 1 (ty+(1t)z,y)0, for all t(0,1) and yH. Letting t 0 + and using (A3), we conclude that F k + 1 (z,y)0 for all yH and k{1,2,,M}. Therefore,

zEP( F j ),j=1,2,,M,
(3.26)

that is,

z j = 1 M SEP( F j ).
(3.27)

Next, we show that z i = 1 F( T i ). By Lemma 2.6, we have

W n m zWz,zC,
(3.28)

and F(W)= i = 1 F( T i ). Assume that zF(W), then zWz. Therefore, from the Opial property of a Hilbert space, (3.27), (3.28) and Step 4, we have

lim inf m x n m z < lim inf m x n m W z lim inf m { x n m W n m n m M x n m + W n m n m M x n m W n m n m M z + W n m n m M z W z } lim inf m { x n m z + W n m z W z } lim inf m x n m z .

It is a contradiction. Thus z belongs to F(W)= i = 1 F( T i ). Hence, zΘ.

Hence, by Lemma 2.4, we obtain

lim sup n ( γ f μ B ) q , x n q = lim sup m ( γ f μ B ) q , x n m q = ( γ f μ B ) q , z q 0 .

Step 7. We claim that x n converges strongly to q= P Θ (IμB+γf)q. We observe that

x n + 1 q 2 = α n γ f ( x n ) + ( I μ α n B ) y n q 2 = α n γ f ( x n ) + ( I μ α n B ) y n q + μ α n B q μ α n F q 2 ( I μ α n B ) y n ( I μ α n B ) q 2 + 2 α n γ f ( x n ) μ B q , x n + 1 q ( 1 α n τ ) 2 y n q 2 + 2 α n γ f ( x n ) γ f ( q ) , x n + 1 q + 2 α n γ f ( q ) μ B q , x n + 1 q ( 1 α n τ ) 2 x n q 2 + α n γ α ( x n q 2 + x n + 1 q 2 ) + 2 α n γ f ( q ) μ B q , x n + 1 q ( 1 α n τ ) 2 1 α n γ α x n q 2 + α n γ α 1 α n γ α x n q 2 + 2 α n 1 α n γ α γ f ( q ) μ B q , x n + 1 q = ( 1 2 α n ( τ γ α ) + α n 2 τ 2 1 α n γ α ) x n q 2 + 2 α n 1 α n γ α γ f ( q ) μ B q , x n + 1 q = ( 1 2 α n ( τ γ α ) 1 α n γ α ) x n q 2 + 2 α n ( τ γ α ) 1 α n γ α ( 1 ( τ γ α ) γ f ( q ) μ B q , x n + 1 q + α n τ 2 2 ( τ γ α ) x n q 2 ) = ( 1 2 α n ( τ γ α ) 1 α n γ α ) x n q 2 + 2 α n ( τ γ α ) 1 α n γ α ( 1 ( τ γ α ) γ f ( q ) μ B q , x n + 1 q + α n τ 2 2 ( τ γ α ) M 3 ) ,

where M 3 = sup n 1 x n q 2 . Put λ n = 2 α n ( τ γ α ) 1 α n γ α and δ n = 1 τ γ α γf(q)μBq, x n + 1 q. It follows that

x n + 1 q 2 (1 λ n ) x n q 2 + λ n δ n + γ n .

From (C1), (C2) and Step 5, it follows that n = 0 λ n = and lim sup n δ n 0. Hence, by Lemma 2.7, the sequence { x n } converges strongly to q. □

Using Theorem 3.1, we obtain the following corollaries.

Corollary 3.2 Let C be a nonempty closed convex subset of a real Hilbert space H. Let { T i } be an infinite family of nonexpansive mappings with i = 1 F( T i ), F={ F j :j=1,2,3,,M} be a finite family of bifunctions C×C intosatisfying (A1)-(A4) and γ i be a real sequence such that 0 γ i b1 for each i1. Let B be a k-Lipschitzian and η-strongly monotone operator on C with 0<μ<η/ k 2 and f Π H with 0<γ<μ(η μ k 2 2 )/α=τ/α and τ<1. Assume that Θ:=( i = 1 F( T i ))( j = 1 M SEP( F j )). Let the mapping W n be defined by (2.3). Let { x n } be the sequence generated by x 1 H and

{ y n = β n x n + ( 1 β n ) W n J r M , n F M J r M 1 , n F M 1 J r 2 , n F 2 J r 1 , N F 1 x n , x n + 1 = α n γ f ( x n ) + ( I α n μ B ) y n , n N and n 1 ,

where { α n } and { β n } are the sequences in (0,1) which satisfy the following conditions:

(C1) lim n α n =0 and Σ n = 1 α n =;

(C2) 0< lim inf n β n < lim sup n β n a<1 for some constant a(0,1);

(C3) lim inf n r j , n >0, for each j=1,2,,M.

Then the sequence { x n } converges strongly to qΘ where q= P Θ (IμB+γf)q, which is the unique solution of the variational inequality

( γ f μ B ) q , p q 0,pΘ.

Remark 3.3 Corollary 3.2 extends and improves Theorem 3.1 from f an infinite family of nonexpansive mappings to a family of strictly pseudo contractive mappings.

If M=1 in Theorem 3.1, we obtain the following corollary.

Corollary 3.4 Let C be a nonempty closed convex subset of a real Hilbert space H. Let { T i } be an infinite family of nonexpansive mappings with i = 1 F( T i ), F={ F j :j=1,2,3,,M} be a finite family of bifunctions C×C intosatisfying (A1)-(A4) and γ i be a real sequence such that 0 γ i b1 for each i1. Let B be a k-Lipschitzian and η-strongly monotone operator on C with 0<μ<η/ k 2 and f Π H with 0<γ<μ(η μ k 2 2 )/α=τ/α and τ<1. Assume that Θ:=( i = 1 F( T i ))( j = 1 M SEP( F j )). Let the mapping W n be defined by (2.3). Let { x n } be the sequence generated by x 1 H and

{ F ( u n , y ) + 1 r y u n , u n x n 0 , y C , y n = β n x n + ( 1 β n ) W n u n , x n + 1 = α n γ f ( x n ) + ( I α n μ B ) y n , n N and n 1 ,

where { α n } and { β n } are the sequences in (0,1) which satisfy the following conditions:

(C1) lim n α n =0 and Σ n = 1 α n =;

(C2) 0< lim inf n β n < lim sup n β n a<1 for some constant a(0,1);

(C3) lim inf n r j , n >0, for each j=1,2,,M.

Then the sequence { x n } converges strongly to qΘ, where q= P Θ (IμB+γf)q, which is the unique solution of the variational inequality

( γ f μ B ) q , p q 0,pΘ.

If M=1, W n =W, γ=1, A=I and μ=1 in Theorem 3.1, we obtain the following corollary:

Corollary 3.5 Let C be a nonempty closed convex subset of a real Hilbert space H. Let { T i } be an infinite family of nonexpansive mappings with i = 1 F( T i ), F={ F j :j=1,2,3,,M} be a finite family of bifunctions C×C intosatisfying (A1)-(A4) and γ i be a real sequence such that 0 γ i b1 for each i1. Let B be a k-Lipschitzian and η-strongly monotone operator on C with 0<μ<η/ k 2 and f Π H with 0<γ<μ(η μ k 2 2 )/α=τ/α and τ<1. Assume that Θ:=( i = 1 F( T i ))( j = 1 M SEP( F j )). Let the mapping W n be defined by (2.3). Let { x n } be the sequence generated by x 1 H and

{ y n = β n x n + ( 1 β n ) W J r M , n F M J r M 1 , n F M 1 J r 2 , n F 2 J r 1 , N F 1 x n , x n + 1 = α n f ( x n ) + ( I α n μ B ) y n , n N and n 1 ,

where { α n } and { β n } are the sequences in (0,1) which satisfy the following conditions:

(C1) lim n α n =0 and Σ n = 1 α n =;

(C2) 0< lim inf n β n < lim sup n β n a<1 for some constant a(0,1);

(C3) lim inf n r j , n >0, for each j=1,2,,M.

Then the sequence { x n } converges strongly to qΘ where q= P Θ (IμB+γf)q, which is the unique solution of the variational inequality

( γ f μ B ) q , p q 0,pΘ.

4 Numerical example

In this section, we give a real numerical example of Theorem 3.1 as follows.

Example 4.1 Let H=R, C=[0, 1 4 ], T n =I. F k (x,y)=0, x,yH, r k , n =1, k{1,2,3,,K}, B=I, f(x)= x 2 , β n = 1 2 , α n = 1 n for every nN and μ=1. Then { x n } is the sequence generated by

x n + 1 = x n 2 n + ( 1 1 n ) x n ,
(4.1)

and z0 as n, where 0 is the unique solution of the minimization problem

min x C x 3 3 + x 2 2 + C 1 ,
(4.2)

where C 1 is a constant.

Proof We divide the proof into four steps.

Step 1. Using the idea in [7], we can show that

J r k , n k x= P C x,xH,k{1,2,,K},
(4.3)

where

P C x={ x | x | , x H C , x , x C .
(4.4)

Since F k (x,y)=0, x,yC, k{1,2,,K}, with the definition of J r (x), xH in Lemma 2.13, we have

J r F (x)= { z C : F ( z , y ) + 1 r y z , z x 0 , y C } .
(4.5)

By the equivalent property of the nearest projection P C from H to C, we can conclude that if we take xC, J r k , n k x= P C x=Ix. By (3) in Lemma 2.13, we have

k = 1 K SEP( F k )=C.
(4.6)

Step 2. We show that

W n =I.
(4.7)

Since T i = θ i I+(1 θ i ) T i , where T i is a λ i -strictly pseudo-contractive mapping and θ i [ λ i ,1), it can be easily seen that T i is a nonexpansive mapping. By (2.3), we have

and we compute (2.3) in the same way as above, so we obtain

W n = U n , 1 = γ 1 γ 2 γ n T 1 T 2 T n + γ 1 γ 2 γ n 1 ( 1 γ n ) T 1 T 2 T n 1 + γ 1 γ 2 γ n 2 ( 1 γ n 1 ) T 1 T 2 T n 2 + + γ 1 ( 1 γ 2 ) T 1 + ( 1 γ 1 ) I .

Since T n =I, γ n =β, nN, hence,

W n = [ β n + β n 1 ( 1 β ) + + β ( 1 β ) + ( 1 β ) ] I=I.

Step 3. We prove

x n + 1 = x n 2 n + ( 1 1 n ) x n and x n 0as n,

where 0 is the unique solution of the minimization problem

min x C x 3 3 + x 2 2 + C 1 .

Since we let B=I, γ is a real number, so we choose γ=1. From (4.3), (4.4) and (4.7), we can obtain a special sequence { x n } of Theorem 3.1 as follows:

x n + 1 = x n 2 n + ( 1 1 n ) x n .

Since T n =I, nN, we have

n N F( T n )=H.

Combining it with (4.6), we obtain

Θ:= ( k = 1 K S E P ( F k ) ) ( n N F ( T n ) ) =C= [ 0 , 1 4 ] .

It is obvious that x n 0, 0 is the unique solution of the minimization problem min x C x 3 3 + x 2 2 + C 1 , where C 1 is a constant number.

Step 4. In this step, we give the numerical results that support our main theorem as shown by plotting graphs using Matlab 7.11.0. We choose two different initial values as x 1 =0.1 and x 1 =0.15 in Table 1, Figure 1, and Figure 2, respectively. From the example, we can see that { x n } converges to 0.  □

Figure 1
figure 1

The initial value x(1)=0.1 and iteration steps n=250 .

Figure 2
figure 2

The initial value x(1)=0.15 and iteration steps n=250 .

Table 1 The sequence values on each different iteration step