1. Introduction

The theory of variational inequalities represents, in fact, a very natural generalization of the theory of boundary value problems and allows us to consider new problems arising from many fields of applied mathematics, such as mechanics, physics, engineering, the theory of convex programming, and the theory of control. While the variational theory of boundary value problems has its starting point in the method of orthogonal projection, the theory of variational inequalities has its starting point in the projection on a convex set.

Let C be a nonempty closed and convex subset of a real Hilbert space H. The classical variational inequality problem is to find a uC such that 〈v-u, Au〉 ≥ 0 for all vC, where A is a nonlinear mapping. The set of solutions of the variational inequality is denoted by VI(C, A). The variational inequality problem has been extensively studied in the literature, see [15] and the reference therein. In the context of the variational inequality problem, this implies that uVI(C, A) ⇔ u = P C (u - λAu), ∀λ > 0, where P C is a metric projection of H into C.

Let A be a mapping from C to H, then A is called monotone if and only if for each x, yC,

x - y , A x - A y 0 .
(1.1)

An operator A is said to be strongly positive on H if there exists a constant γ ̄ >0 such that

A x , x γ ̄ x 2 , x H .

A mapping A of C into itself is called L-Lipschitz continuous if there exits a positive and number L such that

A x - A y L x - y , x , y C .

A mapping A of C into H is called α-inverse-strongly monotone if there exists a positive real number α such that

x - y , A x - A y α A x - A y 2 ,

for all x, yC; see [2, 610]. If A is an α-inverse strongly monotone mapping of C into H, then it is obvious that A is 1 α -Lipschitz continuous, that is, A x - A y 1 α x - y for all x, yC. Clearly, the class of monotone mappings include the class of α-inverse strongly monotone mappings.

Recall that a mapping T of C into H is called pseudo-contractive if for each x, yC, we have

T x - T y , x - y x - y 2 .
(1.2)

T is said to be a k-strict pseudo-contractive mapping if there exists a constant 0 ≤ k ≤ 1 such that

x - y , T x - T y x - y 2 - k I - T x - I - T y 2 , for all x , y D ( T ) .

A mapping T of C into itself is called nonexpansive if ∥Tx - Ty∥ ≤ ∥x - y∥, for all x, yC. We denote by F(T) the set of fixed points of T. Clearly, the class of pseudo-contractive mappings include the class of nonexpansive and strict pseudo-contractive mappings.

For finding an element of F(T), where T is a nonexpansive mapping of C into itself, Halpern [11] was the first to study the convergence of the following scheme:

x n + 1 = α n + 1 u + ( 1 - α n + 1 ) T ( x n ) , n 0 ,
(1.3)

where u, x0C and a sequence {α n } of real numbers in (0,1) in the framework of Hilbert spaces. Lions [12] improved the result of Halpern by proving strong convergence of {x n } to a fixed point of T provided that the real sequence {α n } satisfies certain mild conditions. In 2000, Moudafi [13] introduced viscosity approximation method and proved that if H is a real Hilbert space, for given x0C, the sequence {x n } generated by the algorithm

x n + 1 = α n f ( x n ) + ( 1 - α n ) T ( x n ) , n 0 ,
(1.4)

where f : CC is a contraction mapping with a constant β ∈ (0,1) and {α n } ⊂ (0,1) satisfies certain conditions, converges strongly to fixed point of Moudafi [13] generalizes Halpern's theorems in the direction of viscosity approximations. In [14, 15], Zegeye and Shahzad extended Moudafi's result to Banach spaces which more general than Hilbert spaces. For other related results, see [1618]. Viscosity approximations are very important because they are applied to convex optimization, linear programming, monotone inclusion and elliptic differential equations. Marino and Xu [19], studied the viscosity approximation method for nonexpansive mappings and considered the following general iterative method:

x n + 1 = ( I - α n A ) T x n + α n γ f ( x n ) , n 0 .
(1.5)

They proved that if the sequence {α n } of parameters satisfies appropriate conditions, then the sequence {x n } generated by (1.5) converges strongly to the unique solution of the variational inequality

A - γ f x * , x - x * 0 , x C ,

which is the optimality condition for the minimization problem

min x C 1 2 A x , x - h ( x ) ,

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

For finding an element of F(T) ∩ VI(C, A), where T is nonexpansive and A is α-inverse strongly monotone, Takahashi and Toyoda [20] introduced the following iterative scheme:

x n + 1 = α n x n + ( 1 - α n ) T P C ( x n - λ n A x n ) , n 0 .
(1.6)

where x0C, {α n } is a sequence in (0,1), and {λ n } is a sequence in (0, 2α), and obtained weak convergence theorem in a Hilbert space H. Iiduka and Takahashi [7] proposed a new iterative scheme x1 = xC and

x x + 1 = α n x + ( 1 - α n ) T P C ( x n - λ n A x n ) , n 0 ,
(1.7)

and obtained strong convergence theorem in a Hilbert space.

Motivated and inspired by the work mentioned above which combined from Equations (1.5) and (1.6), in this article, we introduced a new iterative scheme (3.1) below which converges strongly to common element of the set of fixed points of continuous pseudo-contractive mappings which more general than nonexpansive mappings and the solution set of the variational inequality problem of continuous monotone mappings which more general than α-inverse strongly monotone mappings. As a consequence, we provide an iterative scheme which converges strongly to a common element of set of fixed points of finite family continuous pseudo-contractive mappings and the solutions set of finite family of variational inequality problems for continuous monotone mappings. Our theorems extend and unify most the results that have been proved for these important class of nonlinear operators.

2. Preliminaries

Let H be a nonempty closed and convex subset of a real Hilbert space H. Let A be a mapping from C into H. For every point xH, there exists a unique nearest point in C, denoted by P C x, such that

x - P C x x - y , y C .

PC is called the metric projection of H onto C. We know that P C is a nonexpansive mapping of H onto C.

Lemma 2.1. Let H be a real Hilbert space. The following identity holds:

x + y 2 x 2 + 2 y , x + y , x , y H .

Lemma 2.2. Let C be a closed convex subset of a Hilbert space H. Let xH and x0C. Then x0 = P C x if and only if

z - x 0 , x 0 - x , z C .

Lemma 2.3.[21]Let {a n } be a sequence of nonnegative real numbers satisfying the following relation

a n + 1 ( 1 - γ n ) a n + σ n , n 0 ,

where,

  1. (i)

    { γ n } ( 0 , 1 ) , n = 1 γ n =;

  2. (ii)

    lim sup n σ n γ n 0or n = 1 σ n <.

Then, the sequence {a n } → 0 as n → ∞.

Lemma 2.4.[22]Let C be a nonempty closed and convex subset of a real Hilbert space H. Let A : CH be a continuous monotone mapping. Then, for r > 0 and xH, there exist zC such that

y - z , A z + 1 r y - z , z - x 0 , y C .
(2.1)

Moreover, by a similar argument of the proof of Lemmas 2.8 and 2.9 in[23], Zegeye[22]obtained the following lemmas:

Lemma 2.5.[22]Let C be a nonempty closed and convex subset of a real Hilbert space H. Let A : CH be a continuous monotone mapping. For r > 0 and xH, define a mapping F r : HC as follows:

F r x : = z C : y - z , A z + 1 r y - z , z - x 0 , y C

for all xH. Then the following hold:

  1. (1)

    F r is single-valued;

  2. (2)

    F r is a firmly nonexpansive type mapping, i.e., for all x, yH,

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

    F(F r ) = VI(C,A);

  4. (4)

    VI(C, A) is closed and convex.

In the sequel, we shall make use of the following lemmas:

Lemma 2.6.[22]Let C be a nonempty closed and convex subset of a real Hilbert space H. Let T : CH be a continuous pseudo-contractive mapping. Then, for r > 0 and xH, there exist zC such that

y - z , T z - 1 r y - z , ( 1 + r ) z - x 0 , y C .
(2.2)

Lemma 2.7.[22]Let C be a nonempty closed and convex subset of a real Hilbert space H. Let T : CC be a continuous pseudo-contractive mapping. For r > 0 and xH, define a mapping T r : HC as follows:

T r x : = z C : y - z , T z + 1 r y - z , ( 1 + r ) z - x 0 , y C

for all xH. Then the following hold:

  1. (1)

    T r is single - valued;

  2. (2)

    T r is a firmly nonexpansive type mapping, i.e., for all x, yH,

    T r x - T r y 2 T r x - T r y , x - y ;
  3. (3)

    F(T r ) = F(T);

  4. (4)

    F(T) is closed and convex.

Lemma 2.8.[19]Assume A is a strongly positive linear bounded operator on a Hilbert space H with coefficient γ ̄ >0and 0 < ρ ≤ ∥A-1. Then I - ρ A 1-ρ γ ̄ .

Let C be a nonempty closed and convex subset of a real Hilbert space H. Let T : CC be a continuous pseudo-contractive mapping and A : CH be a continuous monotone mapping. Then in what follows, T r n and F r n will be defined as follows: For xH and {r n } ⊂ (0, ∞), defined

T r n x : = z C : y - z , T z - 1 r n y - z , ( 1 - r n ) z - x 0 , y C

and

F r n x : = z C : y - z , A z + 1 r n y - z , z - x 0 , y C .

3. Strong convergence theorems

In this section, we will prove a strong convergence theorem for finding a common element of the set of fixed points for a continuous pseudo-contractive mapping and the solution set of a variational inequality problem governed by continuous monotone mappings.

Theorem 3.1. Let C be a nonempty closed and convex subset of a real Hilbert space H. Let T : CC be a continuous pseudo-contractive mapping and A : CH be a continuous monotone mapping such thatF:=F ( T ) VI ( C , A ) . Let f be a contraction of H into itself with a contraction constant β and let B : HH be a strongly positive linear bounded self-adjoint operator with coefficients β ̄ >0and let {x n } be a sequence generated by x1C and

{ y n = F r n x n x n + 1 = α n γ f ( x n ) + δ n x n + [ ( 1 δ n ) I α n B ] T r n y n ,
(3.1)

where {α n } ⊂ [0,1] and {r n } ⊂ (0, ∞) such that

(C1) lim n α n = 0 , n = 1 α n = ;

(C2) lim n δ n =0, n = 1 δ n + 1 - δ n <;

(C3) lim inf n r n >0, n = 1 r n + 1 - r n <.

Then, the sequence {x n } converges strongly tozF, which is the unique solution of the variational inequality:

( B - γ f ) z , x - z 0 , x F .
(3.2)

Equivalently, z= P F ( I - B + γ f ) z, which is the optimality condition for the minimization problem

min x C 1 2 A z , z - h ( z ) ,

where h is a potential function for γf (i.e.,h'(z) = γf(z) for zH).

Remark: (1) The variational inequality (3.2) has the unique solution; (see [19]). (2) It follows from condition (C1) that (1 - δ n )I - α n B is positive and ( 1 - δ n ) I - α n B I - δ n - α n β ̄ for all n ≥ 1; (see [24]).

Proof. We processed the proof with following four steps:

Step 1. First, we will prove that the sequence {x n } is bounded.

Let vF and let u n = T r n y n and y n = F r n x n . Then, from Lemmas 2.5 and 2.7 that

u n - v = T r n y n - T r n v y n - v = F r n x n - F r n v x n - v .
(3.3)

Moreover, from (3.1) and (3.2), we compute

x n + 1 v = α n ( γ ( f ( x n ) B v ) ) + δ n ( x n v ) + [ ( 1 δ n ) I α n B ] T r n v . α n γ f ( x n ) B v ) + δ n ( x n v ) + ( 1 δ n ) I α n B T r n v . α n β γ x n v + α n γ f ( v ) B v + δ n x n v + ( 1 + δ n α n β ¯ ) T r n y n v . α n β γ x n v + α n γ f ( v ) B v + δ n x n v + ( 1 + δ n α n β ¯ ) u n v . α n β γ x n v + α n γ f ( v ) B v + δ n x n v + ( 1 + δ n α n β ¯ ) x n v . = α n β γ x n v + α n γ f ( v ) B v + δ n x n v + x n v δ n x n v α n β ¯ x n v . = α n β γ x n v + α n γ f ( v ) B v + x n v α n β ¯ x n v . ( α n β γ + 1 α n β ¯ ) x n v + α n γ f ( v ) B v . = ( 1 α n ( β ¯ β γ ) ) x n v + α n γ f ( v ) B v . max { x n v , γ f ( v ) B v β ¯ β γ , } n 1.

Therefore, by the simple introduction, we have

x n - v = max x 1 - v , γ f ( v ) - B v β ̄ - β γ , n 1

which show that {x n } is bounded, so {y n }, {u n }, and {f(x n )} are bounded.

Step 2. We will show that ∥xn+1- x n ∥ → 0 and ∥u n - y n ∥ → 0 as n → ∞.

Notice that each T r n and F r n are firmly nonexpansive. Hence, we have

u n + 1 - u n = T r n y n + 1 - T r n y n y n + 1 - y n = F r n x n + 1 - F r n x n x n + 1 - x n .

From (3.1), we note that

x n + 1 - x n = α n γ f ( x n ) + δ n x n + [ ( 1 - δ n ) I - α n B ] T r n y n - α n - 1 γ f ( x n - 1 ) - δ n - 1 x n - 1 - [ ( 1 - δ n - 1 ) I - α n - 1 B ] T r n y n - 1 . = α n γ f ( x n ) + δ n x n + ( I - δ n - α n B ) u n - α n - 1 γ f ( x n - 1 ) - δ n - 1 x n - 1 - ( I - δ n - 1 - α n - 1 B ) u n - 1 . α n γ f ( x n ) - α n γ f ( x n - 1 ) + α n γ f ( x n - 1 ) + δ n x n - δ n - 1 x n - 1 - α n - 1 γ f ( x n - 1 ) + ( I - δ n - α n B ) u n - ( I - δ n - α n B ) u n - 1 + ( I - δ n - α n B ) u n - 1 - ( I - δ n - 1 - α n - 1 B ) u n - 1 . α n γ f ( x n ) - α n γ f ( x n - 1 ) + α n γ f ( x n - 1 ) - α n - 1 γ f ( x n - 1 ) + δ n x n - δ n - 1 x n - 1 + ( I - δ n - α n B ) u n - ( I - δ n - α n B ) u n - 1 + ( I - δ n - α n B ) u n - 1 - ( I - δ n - 1 - α n - 1 B ) u n - 1 . = α n γ f ( x n ) - f ( x n - 1 ) + α n - α n - 1 γ f ( x n - 1 ) + δ n x n - δ n - 1 x n - 1 + δ n x n - 1 - δ n x n - 1 + ( I - δ n - α n B ) u n - u n - 1 + ( I - δ n - α n B - I + δ n - 1 + α n - 1 B ) u n - 1 . = α n γ β x n - x n - 1 + α n - α n - 1 γ f ( x n - 1 ) + δ n x n - x n - 1 + δ n - δ n - 1 x n - 1 + I - δ n - α n B u n - u n - 1 + δ n - 1 - δ n + α n - 1 B + α n B u n - 1 . α n γ β x n - x n - 1 + α n - α n - 1 γ f ( x n - 1 ) + δ n x n - x n - 1 + δ n - δ n - 1 x n - 1 + I - δ n - α n B x n - x n - 1 + δ n - 1 - δ n u n - 1 + α n - 1 B + α n B u n - 1 . α n γ β x n - x n - 1 + α n - α n - 1 γ f ( x n - 1 ) + δ n x n - x n - 1 + δ n - δ n - 1 x n - 1 + I - δ n - α n B x n - x n - 1 + δ n - 1 - δ n x n - 1 - α n - 1 - α n B x n - 1 . α n γ β x n - x n - 1 + α n - α n - 1 γ f ( x n - 1 ) + δ n x n - x n - 1 + I - δ n - α n B x n - x n - 1 - α n - 1 - α n B x n - 1 . α n γ β x n - x n - 1 + α n - α n - 1 γ f ( x n - 1 ) + δ n + I - δ n - α n B x n - x n - 1 - α n - 1 - α n B x n - 1 . α n γ β x n - x n - 1 + α n - α n - 1 γ f ( x n - 1 ) + I - α n B x n - x n - 1 - α n - α n - 1 B x n - 1 . α n γ β x n - x n - 1 + α n - α n - 1 γ f ( x n - 1 ) - B x n - 1 + I - α n B x n - x n - 1 α n γ β x n - x n - 1 + α n - α n - 1 γ f ( x n - 1 ) - B x n - 1 + I - α n B y n - y n - 1 α n γ β x n - x n - 1 + α n - α n - 1 K + I - α n B y n - y n - 1 ,
(3.4)

where K = ∥γf(xn-1) - Bxn-1∥ = 2 sup{∥f(x n ) ∥ + ∥u n ∥:nN}. Moreover, since y n = F r n x n and y n + 1 = F r n + 1 x n + 1 , we get

y - y n , A y n + 1 r n y - y n , y n - x n 0 , y C
(3.5)

and

y - y n + 1 , A y n + 1 + 1 r n + 1 y - y n + 1 , y n + 1 - x n + 1 0 , y C .
(3.6)

Putting y = yn+1in (3.5) and y = y n in (3.6), we obtain

y n + 1 - y n , A y n + 1 r n y n + 1 - y n , y n - x n 0
(3.7)

and

y n - y n + 1 , A y n + 1 + 1 r n + 1 y n - y n + 1 , y n + 1 - x n + 1 0 .
(3.8)

Adding (3.7) and (3.8), we have

y n + 1 - y n , A y n - A y n + 1 + y n + 1 - y n , y n - x n r n - y n + 1 - x n + 1 r n + 1 0

which implies that

- y n + 1 - y n , A y n + 1 - A y n + y n + 1 - y n , y n - x n r n - y n + 1 - x n + 1 r n + 1 0 .

Using the fact that A is monotone, we get

y n + 1 - y n , y n - x n r n - y n + 1 - x n + 1 r n + 1 0 .

and hence

y n + 1 - y n , y n - y n + 1 + y n + 1 - y n - r n r n + 1 ( y n + 1 - x n + 1 ) 0 .

We observe that

y n + 1 - y n 2 y n + 1 - y n , x n + 1 - x n ( 1 - r n r n + 1 ) ( y n + 1 - x n + 1 ) y n + 1 - y n x n + 1 - x n + ( 1 - r n r n + 1 ) ( y n + 1 - x n + 1 ) .
(3.9)

Without loss of generality, let k be a real number such that r n > k > 0 for all nN. Then, we have

y n + 1 - y n x n + 1 - x n + 1 r n + 1 r n + 1 - r n y n + 1 - x n + 1 x n + 1 - x n + 1 k r n + 1 - r n M ,
(3.10)

where M = sup{∥y n - x n ∥: nN}. Furthermore, from (3.4) and (3.10), we have

x n + 1 - x n α n γ β x n - x n - 1 + α n - α n - 1 K + ( 1 - α n ) x n - x n - 1 + 1 k r n - r i - 1 M . = ( 1 - α n + α n γ β ) x n - x n - 1 + α n - α n - 1 K + 1 k r n - r n - 1 M . = ( 1 - α n ( 1 - γ β ) ) x n - x n - 1 + K α n - α n - 1 + M k r n - r n - 1 .

Using Lemma 2.3, and by the conditions (C1) and (C3), we have

lim n x n + 1 - x n = 0 .

Consequently, from (3.10), we obtain

lim n y n + 1 - y n = 0 .
(3.11)

Since u n = T r n y n and u n + 1 = T r n + 1 y n + 1 , we have

y - u n , T u n - 1 r n y - u n , ( 1 - r n ) u n - y n 0 , y C
(3.12)

and

y - u n + 1 , T u n + 1 - 1 r n + 1 y - u n + 1 , ( 1 - r n + 1 ) u n + 1 - y n + 1 0 , y C .
(3.13)

Putting y := un+1in (3.12) and y := u n in (3.13), we get

u n + 1 - u n , T u n - 1 r n u n + 1 - u n , ( 1 - r n ) u n - y n 0 .
(3.14)

and

u n - u n + 1 , T u n + 1 - 1 r n + 1 u n - u n + 1 , ( 1 - r n + 1 ) u n + 1 - y n + 1 0 .
(3.15)

Adding (3.14) and (3.15), we have

u n + 1 - u n , T u n - T u n + 1 - u n + 1 - u n , ( 1 - r n ) u n - y n r n - ( 1 - r n + 1 ) u n + 1 - y n + 1 r n + 1 0 .

Using the fact that T is pseudo-contractive, we get

u n + 1 - u n , u n - y n r n - u n + 1 - y n + 1 r n + 1 0

and hence

u n + 1 - u n , u n - u n + 1 + u n + 1 - y n - r n r n + 1 ( u n + 1 + y n + 1 ) 0 .

Thus, using the methods in (3.9) and (3.10), we can obtain

u n + 1 - u n y n + 1 - y n + 1 r n + 1 r n + 1 + r n M 1 ,
(3.16)

where M1 = sup{∥u n - y n ∥: nN}. Therefore, from (3.11) and property of {r n }, we get

lim n u n + 1 - u n = 0 .

Furthermore, since x n = α n - 1 γf ( x n + 1 ) + δ n - 1 x n - 1 + [ ( 1 - δ n - 1 ) I - α n - 1 B ] T r n y n - 1 , we have

x n - u n x n - u n - 1 + u n - 1 - u n = α n - 1 γ f ( x n - 1 ) + δ n - 1 x n - 1 + [ ( 1 - δ n - 1 ) I - α n - 1 B ] T r n y n - 1 - u n - 1 + u n - 1 - u n = α n - 1 γ f ( x n - 1 ) + δ n - 1 x n - 1 + ( I - δ n - 1 - α n - 1 B ) u n - 1 - u n - 1 + u n - 1 - u n = α n - 1 γ f ( x n - 1 ) + δ n - 1 x n - 1 + u n - 1 - δ n - 1 u n - 1 - α n - 1 B u n - 1 - u n - 1 + u n - 1 - u n α n - 1 γ f ( x n - 1 ) - α n - 1 B u n - 1 + δ n - 1 x n - 1 - δ n - 1 u n - 1 + u n - 1 - u n α n - 1 γ f ( x n - 1 ) - B u n - 1 + δ n - 1 x n - 1 - u n - 1 + u n - 1 - u n .

Thus, by (C1) and (C2), we obtain

x n - u n 0 , n .
(3.17)

For vF, using Lemma 2.5, we obtain

y n - v 2 = F r n y n - F r n v 2 F r n x n - F r n v , x n - v y n - v , x n - v = 1 2 ( y n - v 2 + x n - v 2 - x n - y n 2 )

and

y n - v 2 x n - v 2 - x n - y n 2 .
(3.18)

Therefore, from (3.1), the convexity of ∥·∥2, (3.2) and (3.18), we get

x n + 1 - v 2 = α n γ f ( x n ) + δ n x n + [ ( 1 - δ n ) I - α n B ] T r n y n - v 2 = ( 1 - δ n ) ( T r n y n - v ) + δ n ( x n - v ) + α n ( γ f ( x n ) - B T r n y n ) 2 ( 1 - δ n ) ( T r n y n - v ) + δ n ( x n - v ) 2 + 2 α n γ f ( x n ) - B T r n y n , x n + 1 - v ( 1 - δ n ) ( y n - v ) 2 + δ n ( x n - v ) 2 + 2 α n L 2

and hence

( 1 - δ n ) ( y n - v ) 2 δ n ( x n - v ) 2 - ( x n + 1 - v ) 2 + 2 α n L 2 .
(3.19)

So, we have ∥y n - v∥ → 0 as n → ∞. Consequently, from (3.16) and (3.18), we obtain

u n - y n u n - x n + x n - y n 0 as n .

Step 3. We will show that

lim sup n ( γ f - B ) z , x n - z 0 .
(3.20)

Let Q= P F , and since, Q(I - B + γf) is contraction on H into C (see also [[25], pp. 18]) and H is complete. Thus, by Banach Contraction Principle, then there exist a unique element z of H such that z = Q(I - B + γf)z.

We choose subsequence { x n i } of {x n } such that

lim sup n ( γ f - B ) z , x n - z = lim n γ f z - B z , x n i - z

Since { x n i } is bounded, there exists a sequence { x n i j } of { x n i } and yC such that { x n i j } y. Without loss of generality, we may assume that x n i y . Since C is closed and convex it is weakly closed and hence yC. Since x n - y n → 0 as n → ∞ we have that y n i y . Now, we show that yF. Since y n = F r n , Lemma 2.5 and using (3.5), we get

y - y n , A y n + y - y n , y n - x n r n 0 , y C .
(3.21)

and

y - y n i , A y n i + y - y n i , y n i - x n i r n i 0 , y C .
(3.22)

Set v t = tv + (1- t)y for all t ∈ (0,1] and vC. Consequently, we get v i C. From (3.22), it follows that

v t - y n i v t - y n i , A v t - v t - y n i , A v t - v t - y n i , y n i - x n i r n = v t - y n i , A v t - A y n i - v t - y n i , y n i - x n i r n ,

from the fact that y n i - x n i 0 as i → ∞, we obtain that u n i - x n i r n 0 as i → ∞. Since A is monotone, we also have that v t - y n i , A v t - A y n i 0. Thus, if follows that

0 lim i v t - y n i , A v t = v t - w , A v t ,

and hence v - y , A v t 0,vC.

If t → 0, the continuity of A gives that

v - y , A y 0 , v C .

This implies that yVI(C, A).

Furthermore, since u n = T r n y n , Lemma 2.5 and using (3.12), we get

y - u n i , T u n i - 1 r n y - u n i , ( r n i + 1 ) u n i - y n + 1 0 , y C .
(3.23)

Put z t = t(v) + (1 - t)y for all t ∈ (0,1] and vC. Then, z t C and from (3.23) and pseudo-contractivity of T, we get

u n i - z t , T z t = u n i - z t , T z t + z t - u n i , T u i - 1 r n z t - u n i , ( 1 + r n i ) u n i - y n i = - z t - u n i , T z t - 1 r n i z t - u n i , u n i - y n i - z t - u n i , u n i z t - u n i 2 - 1 r n i z t - u n i , u n i - y n i - z t - u n i , u n i = - z t - u n i , z t - z t - u n i , u n i - y n i r n i .

Thus, since u n - y n → 0, as n → ∞ we obtain that u n i - y n i r n i 0 as i → ∞. Therefore, as i → ∞, it follows that

y - z t , T z t y - z t , z t

and hence

- v - y , T z t - v - y , z t , v C .

Taking t → 0 and since T is continuous we obtain

- v - y , T y - v - y , y , v C .

Now, we get v = Ty. Then we obtain that y = Ty and hence yF(T). Therefore, yF(T) ∩ VI(C, A) and since z= P F ( I - B + γ f ) z, Lemma 2.2 implies that

lim sup n ( γ f - B ) z , x n - z = lim i ( I - B + γ f ) z - z , x n i - z = ( γ f - B ) z , y - z 0 .
(3.24)

Step 4. Finally, we will show that x n z as n → ∞, where z= P F ( I - B + r f ) z.

From (3.1) and (3.2) we observe that

x n + 1 - z 2 = α n γ f ( x n ) + δ n x n + [ ( 1 - δ n ) I - α n B ] T r n y n - z , x n + 1 - z = α n γ f ( x n ) - B z , x n + 1 - z + δ n x n - z , x n + 1 - z + [ ( 1 - δ n ) I - α n B ] ( T r n - z ) , x n + 1 - z α n γ f ( x n ) - f ( z ) , x n + 1 - z + α n γ f ( z ) - B z , x n + 1 - z + δ n x n - z x n + 1 - z + ( 1 - δ n - α n β ̄ ) z n - z x n + 1 - z α n γ K x n - z x n + 1 - z + α n γ f ( z ) - B z , x n + 1 - z + δ n x n - z x n + 1 - z + ( 1 - δ n - α n β ̄ ) z n - z x n + 1 - z = α n γ K x n - z x n + 1 - z + α n γ f ( z ) - B z , x n + 1 - z + ( 1 - α n β ̄ ) x n - z x n + 1 - z γ k 2 α n ( x n - z 2 + x n + 1 - z 2 ) + α n γ f ( z ) - B z , x n + 1 - z + ( 1 - α n β ̄ ) ( x n - z x n + 1 - z ) γ k 2 α n ( x n - z 2 + x n + 1 - z 2 ) + α n γ f ( z ) - B z , x n + 1 - z + ( 1 - α n β ̄ ) 2 ( x n - z 2 + x n + 1 - z 2 ) 1 - α n ( β ̄ - k γ ) 2 x n - z 2 + 1 2 x n + 1 - z 2 + α n γ f ( x ) - B z , x n + 1 - z ,

which implies that

x n + 1 + z 2 [ 1 - α n ( β ̄ - k γ ) ] x n - z 2 + 2 α n γ f ( z ) - B z , x n + 1 - z .

By the condition (C1), (3.24) and using Lemma 2.3, we see that limn→∞x n - z∥ = 0. This complete to proof. □

If we take f(x) = u, ∀xH and γ = 1, then by Theorem 3.1, we have the following corollary:

Corollary 3.2. Let C be a nonempty closed convex subset of a real Hilbert space H. Let T : CC be a continuous pseudo-contractive mapping and A : CH be a continuous monotone mapping such thatF:=F ( T ) VI ( C , A ) . let B : HH be a strongly positive linear bounded self-adjoint operator with coefficients β ̄ >0and let {x n } be a sequence generated by x1H and

{ y n = F r n x n x n + 1 = α n u + δ n x n + [ ( 1 δ n ) I α n B ] T r n y n ,
(3.25)

where {α n } ⊂ [0,1] and {r n } ⊂ (0, ∞) such that

(C1) lim n α n =0, n = 1 α n =;

(C2) lim n δ n =0, n = 1 δ n + 1 - δ n <;

(C3) lim inf n r n >0, n = 1 r n + 1 - r n <.

Then, the sequence {x n } converges strongly tozF, which is the unique solution of the variational inequality:

( B - f ) z , x - z 0 , x F .
(3.26)

Equivalently, z= P F ( I - B + f ) z.

If we take T ≡ 0, then T r n I (the identity map on C). So by Theorem 3.1, we obtain the following corollary.

Corollary 3.3. Let C be a nonempty closed convex subset of a real Hilbert space H. Let A : CH be a continuous monotone mapping such thatF:=VI ( C , A ) . Let f be a contraction of H into itself and let B : HH be a strongly positive linear bounded self-adjoint operator with coefficients β ̄ >0and let {x n } be a sequence generated by x1H and

x n + 1 = α n γ f ( x n ) + δ n x n + [ ( 1 - δ n ) I - α n B ] F r n x n ,
(3.27)

where {α n } ⊂ [0,1] and {r n } ⊂ (0, ∞) such that

(C1) lim n α n =0, n = 1 α n =;

(C2) lim n δ n =0, n = 1 δ n + 1 - δ n <;

(C3) lim inf n r n >0, n = 1 r n + 1 - r n <.

Then, the sequence {x n } converges strongly tozF, which is the unique solution of the variational inequality:

( B - γ f ) z , x - z 0 , x F
(3.28)

Equivalently, z= P F ( I - B + γ f ) z.

If we take A ≡ 0, then F r n I (the identity map on C). So by 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 : CC be a continuous pseudo-contractive mapping such thatF:=F ( T ) . Let f be a contraction of H into itself and let B : HH be a strongly positive linear bounded self-adjoint operator with coefficients β ̄ >0and let {x n } be a sequence generated by x1H and

x n + 1 = α n γ f ( x n ) + δ n x n + [ ( 1 - δ n ) I - α n B ] T r n x n ,
(3.29)

where {α n } ⊂ [0,1] and {r n } ⊂ (0, ∞) such that

(C1) lim n α n =0, n = 1 α n =;

(C2) lim n δ n =0, n = 1 δ n + 1 - δ n <;

(C3) lim inf n r n >0, n = 1 r n + 1 - r n <.

Then, the sequence {x n }n≥1converges strongly tozF, which is the unique solution of the variational inequality:

( B - γ f ) z , x - z 0 , x F .
(3.30)

Equivalently, z= P F ( I - B + γ f ) z.

If we take CH in Theorem 3.1, then we obtain the following corollary.

Corollary 3.5. Let H be a real Hilbert space. Let T n : HH be a continuous pseudo-contractive mapping and A : HH be a continuous monotone mapping such thatF:=F ( T ) A - 1 ( 0 ) . Let f be a contraction of C into itself and let B : HH be a strongly positive linear bounded self-adjoint operator with coefficients β ̄ >0and let {x n } be a sequence generated by x1H and

{ y n = F r n x n x n + 1 = α n γ f ( x n ) + δ n x n + [ ( 1 δ n ) I α n B ] T r n y n
(3.31)

where {α n } ⊂ [0,1] and {r n } ⊂ (0, ∞) such that

(C1) lim n α n =0, n = 1 α n =;

(C2) lim n δ n =0, n = 1 δ n + 1 - δ n <;

(C3) lim inf n r n >0, n = 1 r n + 1 - r n <.

Then, the sequence {x n } converges strongly tozF, which is the unique solution of the variational inequality:

( B - γ f ) z , x - z 0 , x F
(3.32)

Equivalently, z= P F ( I - B + γ f ) z.

Proof. Since D(A) = H, we note that VI(H, A) = A-1(0). So, by Theorem 3.1, we obtain the desired result. □

Remark 3.6. Our results extend and unify most of the results that have been proved for these important classes of nonlinear operators. In particular, Theorem 3.1 extends Theorem 3.1 of Iiduka and Takahashi [7] and Zegeye et al. [26], Corollary 3.2 of Su et al. [27] in the sense that our convergence is for the more general class of continuous pseudo-contractive and continuous monotone mappings. Corollary 3.4 also extends Theorem 4.2 of Iiduka and Takahashi [7] in the sense that our convergence is for the more general class of continuous pseudo-contractive and continuous monotone mappings.