1 Introduction

Let H be a real Hilbert space with inner product , and norm , respectively. Let K be a nonempty closed convex subset of H. Let A:KH be a nonlinear mapping and F:K×KR be a bi-function, where R denotes the set of real numbers. We consider the following generalized equilibrium problem: Find xK such that

F(x,y)+Ax,yx0,yK.
(1.1)

We use EP(F,A) to denote the solution set of the problem (1.1). If A0, the zero mapping, then the problem (1.1) is reduced to the normal equilibrium problem: Find xK such that

F(x,y)0,yK.
(1.2)

We use EP(F) to denote the solution set of the problem (1.2). If F0, then the problem (1.1) is reduced to the classical variational inequality problem: Find xK such that

Ax,yx0,yK.

The generalized equilibrium problem (1.1) is very general in the sense that it includes, as special cases, optimization problems, variational inequalities, mini-max problems, the Nash equilibrium problem in noncooperative games and others (see, e.g., [13]).

Recall that a nonself mapping T:KH is called a k-strict pseudo-contraction if there exists a constant k[0,1) such that

T x T y 2 x y 2 +k ( I T ) x ( I T ) y 2 ,x,yK.
(1.3)

We use F(T) to denote the fixed point set of T, i.e., F(T):={xK:Tx=x}. As k=0, T is said to be nonexpansive, i.e.,

TxTyxy,x,yK.

T is said to be pseudo-contractive if k=1, and is also said to be strongly pseudo-contractive if there exists a positive constant λ(0,1) such that T+λI is pseudo-contractive. Clearly, the class of k-strict pseudo-contractions falls into the one between classes of nonexpansive mappings and pseudo-contractions. We remark also that the class of strongly pseudo-contractive mappings is independent of the class of k-strict pseudo-contractions (see, e.g., [4, 5]).

Iterative methods for equilibrium problems and fixed point problems of nonexpansive mappings have been extensively investigated. However, iterative schemes for strict pseudo-contractions are far less developed than those for nonexpansive mappings though Browder and Petryshyn [5] initiated their work in 1967; the reason is probably that the second term appearing in the right-hand side of (1.3) impedes the convergence analysis for iterative algorithms used to find a fixed point of the strict pseudo-contraction. On the other hand, strict pseudo-contractions have more powerful applications than nonexpansive mappings do in solving inverse problems; see, e.g., [618, 2027] and the references therein. Therefore it is interesting to develop the effective iterative methods for equilibrium problems and fixed point problems of strict pseudo-contractions.

In 2006, Marino and Xu [8] introduced a general iterative method and proved that for a given x 0 H, the sequence { x n } generated by

x n + 1 = α n γf( x n )+(I α n B)T x n ,nN,

where T is a self-nonexpansive mapping on H, f is a contraction of H into itself and { α n }(0,1) satisfies certain conditions, B is a strongly positive bounded linear operator on H, converges strongly to x F(T), which is the unique solution of the following variational inequality:

( B γ f ) x , x x 0,xF(T),

and is also the optimality condition for some minimization problem.

Recently, Takahashi and Takahashi [12] considered the equilibrium problem and nonexpansive mapping by viscosity approximation methods. To be more precise, they proved the following theorem.

Theorem of TT Let K be a nonempty closed convex subset of H. Let F be a bi-function from K×K to R satisfying (A 1)-(A 4) and let T:KH be a nonexpansive mapping such that F(T)EP(F)ϕ. Let f:HH be a contraction and let { x n } and { y n } be sequences generated by x 1 H and

{ F ( y n , z ) + 1 r n z y n , y n x n 0 , z K , x n + 1 = α n f ( x n ) + ( 1 α n ) T y n , n 1 ,

where { α n }[0,1] and { r n } satisfy

Then { x n } and { y n } converge strongly to qF(T)EP(F), where q= P F ( T ) EP ( F ) f(q).

In 2009, Ceng et al. [15] further studied the equilibrium problem and fixed point problems of strict pseudo-contraction mappings T by an iterative scheme for finding an element of EP(F)F(T). Very recently, by using the general iterative method Liu [16] proposed the implicit and explicit iterative processes for finding an element of EP(F)F(T) and then obtained some strong convergence theorems, respectively. On the other hand, Takahashi and Takahashi [18] considered the generalized equilibrium problem and nonexpansive mapping in a Hilbert space. Moreover, they constructed an iterative scheme for finding an element of EP(F,A)F(T) and then proved a strong convergence of the iterative sequence under some suitable conditions.

In this paper, inspired and motivated by research going on in this area, we introduce a general iterative method for generalized equilibrium problems and strict pseudo-contractive nonself mappings, which is defined in the following way:

{ F ( u n , y ) + A x n , y u n + 1 r n y u n , u n x n 0 , y K , y n = β n u n + ( 1 β n ) i = 1 N η i ( n ) T i u n , x n + 1 = α n γ f ( x n ) + ( I α n B ) y n , n 1 ,
(1.4)

where constant γ>0, f is a contraction and A, B are two operators, { T i } i = i N :KH is a finite family of k i -strict pseudo-contractions, { η i ( n ) } i = 1 N is a finite sequence of positive numbers, { α n }, { β n } and { r n } are some sequences with certain conditions.

Our purpose is not only to modify the general iterative method to the case of a finite family of k i -strictly pseudo-contractive nonself mappings, but also to establish strong convergence theorems for a generalized equilibrium problem and k i -strict pseudo-contractions in a real Hilbert space, which also solves some variation inequality problems. Our theorems presented in this paper improve and extend the corresponding results of [12, 15, 16, 18, 20, 21, 25].

2 Preliminaries

Let K be a nonempty closed convex subset of a real Hilbert H space with inner product , and norm , respectively. Recall that a mapping f:KK is a contraction, if there exists a constant ρ(0,1) such that

f ( x ) f ( y ) ρxy,x,yK.

We use Π K to denote the collection of all contractions on K. The operator A:KH is said to be monotone if

AxAy,xy0,x,yK.

A:KH is said to be r-strongly monotone if there exists a constant r>0 such that

AxAy,xyr x y 2 ,x,yK.

A:KH is said to be α-inverse strongly monotone if there exists a constant α>0 such that

AxAy,xyα A x A y 2 ,x,yK.

Recall that an operator B is strongly positive if there exists a constant γ ¯ >0 with the property

Bx,x γ ¯ x 2 ,xH.

To study the generalized equilibrium problem (1.1), we may assume that the bi-function F:K×KR satisfies the following conditions:

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

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

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

(A4) for each xK, yF(x,y) is convex and lower semi-continuous.

In order to prove our main results, we need the following lemmas and propositions.

Lemma 2.1 [1, 3]

Let F:K×KR be a bi-function satisfying (A 1)-(A 4). Then, for any r>0 and xH, there exists zK such that

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

Further, if T r x={zK:F(z,y)+ 1 r yz,zx0,yK}, then the following hold:

  1. (1)

    T r is single-valued;

  2. (2)

    T r is firmly nonexpansive, i.e, T r x T r y 2 T r x T r y,xy for all x,yH;

  3. (3)

    F( T r )=EP(F);

  4. (4)

    EP(F) is closed and convex.

Lemma 2.2 [8]

In the Hilbert space H, there hold the following identities:

  1. (i)

    x + y 2 = x 2 +2x,y+ y 2 x 2 +2y,(x+y), x,yH;

  2. (ii)

    t x + ( 1 t ) y 2 =t x 2 +(1t) y 2 t(1t) x y 2 , t[0,1], x,yH.

Lemma 2.3 [8]

Assume that B is a strongly positive linear bounded operator on the Hilbert space H with a coefficient γ ¯ >0 and 0<ϱ< B 1 . Then IϱB1ϱ γ ¯ .

Lemma 2.4 [10]

If T:KH is a k-strict pseudo-contraction, then the fixed point set F(T) is closed convex so that the projection P F ( T ) is well defined.

Lemma 2.5 [2, 10]

Let T:KH be a k-strict pseudo-contraction. For λ[k,1), define S:KH by Sx=λx+(1λ)Tx for each xK. Then S is a nonexpansive mapping such that F(S)=F(T).

Lemma 2.6 [19]

Assume { a n } is a sequence of nonnegative real numbers such that

a n + 1 (1 γ n ) a n + γ n δ n ,n0,

where { γ n } is a sequence in (0,1) and { δ n } is a real sequence such that

  1. (i)

    n = 1 γ n =;

  2. (ii)

    lim sup n δ n 0 or n = 1 | γ n δ n |<.

Then lim n a n =0.

Proposition 2.1 (See, e.g., Acedo and Xu [20])

Let K be a nonempty closed convex subset of the Hilbert space H. Given an integer N1, assume that { T i } i = 1 N :KH is a finite family of k i -strict pseudo-contractions. Suppose that { λ i } i = 1 N is a positive sequence such that i = 1 N λ i =1. Then i = 1 N λ i T i is a k-strict pseudo-contraction with k=max{ k i :1iN}.

Proposition 2.2 (See, e.g., Acedo and Xu [20])

Let { T i } i = 1 N and { λ i } i = 1 N be given as in Proposition 2.1 above. Then F( i = 1 N λ i T i )= i = 1 N F( T i ).

3 Main results

Theorem 3.1 Let K be a nonempty closed convex subset of the Hilbert space H and F:K×KR be a bi-function satisfying (A 1)-(A 4). Let A be an α-inverse strongly monotone mapping and B be a strongly positive bounded linear operator on H with γ ¯ >0. Assume that { T i } i = 1 N :KH be a finite family of k i -strict pseudo-contractions such that F= i = 1 N F( T i )EP(F,A)ϕ. Suppose f Π K with a coefficient ρ(0,1) and { η i ( n ) } i = 1 N are finite sequences of positive numbers such that i = 1 N η i ( n ) =1 for all n0, for a given point x 0 K, α n , β n (0,1), r n (0,2α) and 0<γ< γ ¯ ρ , the following control conditions are satisfied:

  1. (i)

    lim n α n =0, n = 1 α n = and n = 1 | α n α n 1 |<;

  2. (ii)

    k i β n λ<1, lim n β n =λ and n = 1 | β n β n 1 |<;

  3. (iii)

    n = 1 i = 1 N | η i ( n ) η i ( n 1 ) |<;

  4. (iv)

    lim inf n r n >0 and n = 1 | r n r n 1 |<.

Then the sequence { x n } generated by (1.4) converges strongly to qF, which solves the variational inequality

( B γ f ) q , q p 0,pF.

Proof Putting W n = i = 1 N η i ( n ) T i , we have W n :KH is a k-strict pseudo-contraction and F( W n )= i = 1 N F( T i ) by Proposition 2.1 and 2.2, where k=max{ k i :1iN}.

First, we show that the mapping I r n A is nonexpansive. Indeed, for each x,yK, we have

( I r n A ) x ( I r n A ) y 2 = x y 2 2 r n x y , A x A y + r n 2 A x A y 2 x y 2 2 α r n A x A y 2 + r n 2 A x A y 2 = x y 2 r n ( 2 α r n ) A x A y 2 .

It follows from the condition r n (0,2α) that the mapping I r n A is nonexpansive. From Lemma 2.1, we see that EP(F,A)=F( T r n (I r n A)). Note that u n can be rewritten as u n = T r n (I r n A) x n and p= T r n (I r n A)p for each n1 as pF.

From (1.4), condition (ii) and Lemma 2.2, we have

y n p 2 = β n ( u n p ) + ( 1 β n ) ( W n u n p ) 2 = β n u n p 2 + ( 1 β n ) W n u n p 2 β n ( 1 β n ) u n W n u n 2 β n u n p 2 + ( 1 β n ) [ u n p 2 + k u n W n u n 2 ] β n ( 1 β n ) u n W n u n 2 = u n p 2 ( 1 β n ) ( β n k ) u n W n u n 2 u n p 2 .
(3.1)

By u n = T r n (I r n A) x n , we obtain

u n p= T r n ( I r n A ) x n p x n p.

This together with (3.1), we see that

y n p u n p x n p.
(3.2)

Furthermore, by Lemma 2.3, we have

x n + 1 p = α n [ γ f ( x n ) B p ] + ( I α n B ) ( y n p ) ( 1 α n γ ¯ ) y n p + α n γ f ( x n ) B p ( 1 α n γ ¯ ) y n p + α n [ γ f ( x n ) γ f ( p ) + γ f ( p ) B p ] [ 1 ( γ ¯ γ ρ ) α n ] x n p + α n γ f ( p ) B p .

It follows from induction that

x n pmax { x 0 p , 1 γ ¯ γ ρ γ f ( p ) B p } ,n1,
(3.3)

which gives that sequence { x n } is bounded, and so are { u n } and { y n }.

Define a mapping S n x:= β n x+(1 β n ) W n x for each xK. Then S n :KH is nonexpansive. Indeed, by using (1.3), Lemma 2.2 and condition (ii), we have for all x,yK that

S n x S n y 2 = β n ( x y ) + ( 1 β n ) ( W n x W n y ) 2 = β n x y 2 + ( 1 β n ) W n x W n y 2 β n ( 1 β n ) x W n x ( y W n y ) 2 β n x y 2 + ( 1 β n ) [ x y 2 + k x W n x ( y W n y ) 2 ] β n ( 1 β n ) x W n x ( y W n y ) 2 = x y 2 ( 1 β n ) ( β n k ) x W n x ( y W n y ) 2 x y 2 ,

which shows that S n :KH is nonexpansive.

Next, we show that lim n x n + 1 x n =0. From (1.4) and Lemma 2.3, we have

x n + 1 x n = α n γ f ( x n ) + ( I α n B ) y n [ α n 1 γ f ( x n 1 ) + ( I α n 1 B ) y n 1 ] α n γ f ( x n ) f ( x n 1 ) + | α n α n 1 | [ γ f ( x n 1 ) + B y n 1 ] + ( I α n B ) ( y n y n 1 ) α n γ ρ x n x n 1 + | α n α n 1 | M 1 + ( 1 α n γ ¯ ) y n y n 1 ,
(3.4)

where M 1 = sup n 1 {γf( x n )+B y n }<. Moreover, we note that y n = S n u n and

y n y n 1 S n u n S n u n 1 + S n u n 1 S n 1 u n 1 u n u n 1 + β n u n 1 + ( 1 β n ) W n u n 1 [ β n 1 u n 1 + ( 1 β n 1 ) W n 1 u n 1 ] u n u n 1 + | β n β n 1 | u n 1 W n 1 u n 1 + ( 1 β n ) W n u n 1 W n 1 u n 1 u n u n 1 + | β n β n 1 | M 2 + ( 1 β n ) i = 1 N | η i ( n ) η i ( n 1 ) | T i u n 1 ,
(3.5)

where M 2 = sup n 1 { u n 1 W n 1 u n 1 }. On the other hand, we note that

{ F ( u n , y ) + A x n , y u n + 1 r n y u n , u n x n 0 , F ( u n 1 , y ) + A x n 1 , y u n 1 + 1 r n 1 y u n 1 , u n 1 x n 1 0 .
(3.6)

Putting y= u n 1 and y= u n in (3.6) respectively, we have

{ F ( u n , u n 1 ) + A x n , u n 1 u n + 1 r n u n 1 u n , u n x n 0 , F ( u n 1 , u n ) + A x n 1 , u n u n 1 + 1 r n 1 u n u n 1 , u n 1 x n 1 0 .
(3.7)

It follows from (A2) that

u n u n 1 , u n 1 ( I r n 1 A ) x n 1 r n 1 u n ( I r n A ) x n r n 0,

and hence

u n u n 1 , u n 1 u n + u n ( I r n 1 A ) x n 1 r n 1 r n [ u n ( I r n A ) x n ] 0.

Since lim n r n >0, we assume that there exists a real number μ such that r n >μ>0 for all nN. Consequently, we have

u n u n 1 2 u n u n 1 , ( I r n A ) x n ( I r n 1 A ) x n 1 + ( 1 r n 1 r n ) [ u n ( I r n A ) x n ] u n u n 1 [ x n x n 1 + | r n r n 1 | A x n 1 + r n r n 1 r n u n ( I r n A ) x n ] ,

and hence

u n u n 1 x n x n 1 + | r n r n 1 | A x n 1 + r n r n 1 r n u n ( I r n A ) x n x n x n 1 + | r n r n 1 | [ A x n 1 + 1 μ u n ( I r n A ) x n ] x n x n 1 + | r n r n 1 | M 3 ,
(3.8)

where M 3 =sup{A x n 1 + 1 μ u n (I r n A) x n ,nN}. Combining (3.4), (3.5) and (3.8), we have

x n + 1 x n α n γ ρ x n x n 1 + | α n α n 1 | M 1 + ( 1 α n γ ¯ ) [ x n x n 1 + | β n β n 1 | M 2 + | r n r n 1 | M 3 + ( 1 β n ) i = 1 N | η i ( n ) η i ( n 1 ) | T i u n 1 ] [ 1 ( γ ¯ γ ρ ) α n ] x n x n 1 + | α n α n 1 | M 1 + | β n β n 1 | M 2 + | r n r n 1 | M 3 + i = 1 N | η i ( n ) η i ( n 1 ) | T i u n 1 .

It follows from 0<γ< γ ¯ ρ and Lemma 2.6 that

lim n x n + 1 x n =0.
(3.9)

Moreover, we observe that

x n y n x n x n + 1 + x n + 1 y n x n x n + 1 + α n γ f ( x n ) B y n .

It follows from lim n α n =0 and (3.9) that

lim n x n y n =0.
(3.10)

For pF( S n )EP(F,A), we note that u n = T r n (I r n A) x n and

u n p 2 = T r n ( I r n A ) x n T r n ( I r n A ) p 2 x n p , u n p = 1 2 ( x n p 2 + u n p 2 x n u n 2 ) ,

which implies that

u n p 2 x n p 2 x n u n 2 .
(3.11)

From (1.4), (3.2) and (3.11), we have

x n + 1 p 2 = α n [ γ f ( x n ) B p ] + ( I α n B ) ( y n p ) 2 ( 1 α n γ ¯ ) 2 y n p 2 + α n 2 γ f ( x n ) B p 2 + 2 α n ( 1 α n γ ¯ ) γ f ( x n ) B p y n p u n p 2 + α n 2 γ f ( x n ) B p 2 + 2 α n γ f ( x n ) B p y n p x n p 2 x n u n 2 + α n 2 γ f ( x n ) B p 2 + 2 α n γ f ( x n ) B p y n p .

Using lim n α n =0 and (3.9) again, we obtain

lim n x n u n = lim n x n T r n ( I r n A ) x n =0.
(3.12)

By the nonexpansion of S n , we have

x n S n x n x n x n + 1 + x n + 1 S n x n x n x n + 1 + α n γ f ( x n ) + ( I α n B ) y n S n x n x n x n + 1 + α n [ γ f ( x n ) + B y n ] + S n u n S n x n x n x n + 1 + α n [ γ f ( x n ) + B y n ] + u n x n .

This together with (3.9) and (3.12), we obtain

lim n x n S n x n =0.
(3.13)

Furthermore, we note that

x n S n x n =(1 β n ) x n W n x n .

It follows from condition (ii) that

lim n x n W n x n =0.
(3.14)

On the other hand, by condition (iii), we may assume that η i ( n ) η i as n for every 1iN. It is easily seen that each η i >0 and i = 1 N η i =1. Define W= i = 1 N η i T i , then W:KH is a k-strict pseudo-contraction such that F(W)=F( W n )= i = 1 N F( T i ) by Proposition 2.1 and 2.2. Consequently,

x n W x n x n W n x n + W n x n W x n x n W n x n + i = 1 N | η i ( n ) η i | T i x n ,

which implies that

lim n x n W x n =0.
(3.15)

Combining (3.14) and (3.15), we obtain

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

Define S:KH by Sx=λx+(1λ)Wx. By condition (ii) again, we have lim n β n =λ[k,1). Then, S is nonexpansive with F(S)=F(W) by Lemma 2.5. Notice that

x n S x n x n S n x n + S n x n S x n = x n S n x n + β n x n + ( 1 β n ) W n x n λ x n ( 1 λ ) W x n x n S n x n + | β n λ | x n W x n + ( 1 β n ) W n x n W x n .

It follows from (3.13), (3.15) and (3.16) that

lim n x n S x n =0.
(3.17)

Now we claim that lim sup n (Bγf)q,q x n 0, where q= lim t 0 x t with x t being the fixed point of the contraction Ψ n on H defined by

Ψ n x=tγf(x)+(ItB) S n T r n (I r n A)x,xH,nN,

where t(0,1). Indeed, by Lemma 2.1 and 2.3, we have

Ψ n x Ψ n y t γ f ( x ) f ( y ) + ( 1 t γ ¯ ) S n T r n ( I r n A ) x S n T r n ( I r n A ) y t γ ρ x y + ( 1 t γ ¯ ) T r n ( I r n A ) x T r n ( I r n A ) y t γ ρ x y + ( 1 t γ ¯ ) x y = [ 1 ( γ ¯ γ ρ ) t ] x y ,

for all x,yH. Since 0<1( γ ¯ γρ)t<1, it follows that Ψ n is a contraction. Therefore, by the Banach contraction principle, Ψ n has a unique fixed point x t H such that

x t =tγf( x t )+(ItB) S n T r n (I r n A) x t .

By Lemma 2.2 and (3.10), we have

x t x n 2 = ( I t B ) [ S n T r n ( I r n A ) x t x n ] + t [ γ f ( x t ) B x n ] 2 ( 1 γ ¯ t ) 2 S n T r n ( I r n A ) x t x n 2 + 2 t γ f ( x t ) B x n , x t x n = ( 1 γ ¯ t ) 2 S n T r n ( I r n A ) x t S n T r n ( I r n A ) x n + S n T r n ( I r n A ) x n x n 2 + 2 t γ f ( x t ) B x n , x t x n ( 1 γ ¯ t ) 2 [ x t x n + y n x n ] 2 + 2 t γ f ( x t ) B x n , x t x n ( 1 γ ¯ t ) 2 x t x n 2 + ψ n ( t ) + 2 t γ f ( x t ) B x t , x t x n + 2 t B x t B x n , x t x n ,
(3.18)

where ψ n (t)= ( 1 γ ¯ t ) 2 (2 x t x n + y n x n ) y n x n 0 as n. Observe B is strongly positive, we obtain

B x t B x n , x t x n = B ( x t x n ) , x t x n γ ¯ x t x n 2 .
(3.19)

Combining (3.18) and (3.19), we have

2 t B x t γ f ( x t ) , x t x n ( γ ¯ 2 t 2 2 γ ¯ t ) x t x n 2 + ψ n ( t ) + 2 t B x t B x n , x t x n ( γ ¯ t 2 2 t ) B ( x t x n ) , x t x n + ψ n ( t ) + 2 t B x t B x n , x t x n = γ ¯ t 2 B x t B x n , x t x n + ψ n ( t ) .

It follows that

B x t γ f ( x t ) , x t x n γ ¯ t 2 B x t B x n , x t x n + 1 2 t ψ n (t).
(3.20)

Let n in (3.20) and note that ψ n (t)0 as n yields

lim sup n B x t γ f ( x t ) , x t x n t 2 M 4 ,
(3.21)

where M 4 is an appropriate positive constant such that M 4 γ ¯ B x t B x n , x t x n for all t(0,1) and n1. Taking t0 from (3.21), we have

lim sup t 0 lim sup n B x t γ f ( x t ) , x t x n 0.
(3.22)

On the other hand, we have

γ f ( q ) B q , x n q = γ f ( q ) B q , x n q γ f ( q ) B q , x n x t + γ f ( q ) B q , x n x t γ f ( q ) B x t , x n x t + γ f ( q ) B x t , x n x t γ f ( x t ) B x t , x n x t + γ f ( x t ) B x t , x n x t .

It follows that

Therefore, from (3.22) and lim t 0 x t =q, we have

lim sup n γ f ( q ) B q , x n q = lim sup t 0 lim sup n γ f ( q ) B q , x n q lim sup t 0 γ f ( q ) B q x t q + lim sup t 0 B x t q lim n x n x t + lim sup t 0 γ ρ x t q lim n x n x t + lim sup t 0 lim sup n γ f ( x t ) B x t , x n x t 0 .
(3.23)

Finally, we prove that x n q as n. From (1.4) and (3.2) again, we have

x n + 1 q 2 = α n γ f ( x n ) + ( I α n B ) y n q , x n + 1 q = α n γ f ( x n ) B q , x n + 1 q + ( I α n B ) ( y n q ) , x n + 1 q α n γ f ( x n ) f ( q ) , x n + 1 q + α n γ f ( q ) B q , x n + 1 q + ( 1 α n γ ¯ ) y n q x n + 1 q α n γ ρ x n q x n + 1 q + α n γ f ( q ) B q , x n + 1 q + ( 1 α n γ ¯ ) x n q x n + 1 q = [ 1 ( γ ¯ γ ρ ) α n ] x n q x n + 1 q + α n γ f ( q ) B q , x n + 1 q 1 ( γ ¯ γ ρ ) α n 2 ( x n q 2 + x n + 1 q 2 ) + α n γ f ( q ) B q , x n + 1 q 1 ( γ ¯ γ ρ ) α n 2 x n q 2 + 1 2 x n + 1 q 2 + α n γ f ( q ) B q , x n + 1 q .

It follows that

x n + 1 q 2 [ 1 ( γ ¯ γ ρ ) α n ] x n q 2 +2 α n γ f ( q ) B q , x n + 1 q .
(3.24)

From 0<γ< γ ¯ ρ , condition (i) and (3.23), we can arrive at the desired conclusion lim n x n q=0 by Lemma 2.6. This completes the proof. □

Theorem 3.2 Let K be a nonempty closed convex subset of the Hilbert space H and F:K×KR be a bi-function satisfying (A 1)-(A 4). Let A be an α-inverse strongly monotone mapping, f Π K with a coefficient ρ(0,1) and B be a strongly positive bounded linear operator on H with γ ¯ >0 and 0<γ< γ ¯ ρ . Let T:KH be a k-strict pseudo-contraction such that F=F(T)EP(F,A)ϕ. Let { x n } be a sequence generated by x 0 K in the following manner:

{ F ( u n , y ) + A x n , y u n + 1 r y u n , u n x n 0 , y K , y n = β n u n + ( 1 β n ) T u n , x n + 1 = α n γ f ( x n ) + ( I α n B ) y n , n 1 ,

where { α n } and { β n } are two sequences in (0,1), constant r(0,2α). If the following control conditions are satisfied:

  1. (i)

    lim n α n =0, n = 1 α n = and n = 1 | α n α n 1 |<;

  2. (ii)

    k β n λ<1, lim n β n =λ and n = 1 | β n β n 1 |<.

Then the sequence { x n } converges strongly to qF, which solves the variational inequality

( B γ f ) q , q p 0,pF.

Proof Putting r n =r and N=1, i.e., W n =T, the desired conclusion follows immediately from Theorem 3.1. This completes the proof. □

Theorem 3.3 Let K be a nonempty closed convex subset of the Hilbert space H and F:K×KR be a bi-function satisfying (A 1)-(A 4). Let f Π K with a coefficient ρ(0,1) and B be a strongly positive bounded linear operator on H with γ ¯ >0 and 0<γ< γ ¯ ρ . Let T:KH be a k-strict pseudo-contraction such that F=F(T)EP(F)ϕ. Let { x n } be a sequence generated by x 0 K in the following manner:

{ F ( u n , y ) + 1 r n y u n , u n x n 0 , y K , y n = β n u n + ( 1 β n ) T u n , x n + 1 = α n γ f ( x n ) + ( I α n B ) y n , n 1 ,

where { α n } and { β n } are two sequences in (0,1), sequence { r n }(0,2α). If the following control conditions are satisfied:

  1. (i)

    lim n α n =0, n = 1 α n = and n = 1 | α n α n 1 |<;

  2. (ii)

    k β n λ<1, lim n β n =λ and n = 1 | β n β n 1 |<;

  3. (iii)

    lim inf n r n >0 and n = 1 | r n r n 1 |<.

Then the sequence { x n } converges strongly to qF, which solves the variational inequality

( B γ f ) q , q p 0,pF.

Proof Putting N=1 and A=0, i.e., the generalized equilibrium problem (1.1) reduces to the normal equilibrium problem (1.2), the desired conclusion follows immediately from Theorem 3.1. This completes the proof. □

Remark 3.1 Theorem 3.1 and 3.2 improve and extend the main results of Takahashi and Takahashi [18] and Qin et al. [21] in different directions.

Remark 3.2 Theorem 3.3 is mainly due to Liu [16], which improves and extends the main results of Takahashi and Takahashi [12].

Remark 3.3 If F=A=0 and u n = x n , then the algorithm (1.4) reduces to approximate the fixed point of k-strict pseudo-contractions, which includes the general iterative method of Marino and Xu [8] and the parallel algorithm of Acedo and Xu [20] as special cases.