1 Introduction

Let C be a closed convex subset of a real Hilbert space H. A mapping T:CH is called a contraction mapping if there exists L[0,1) such that TxTyLxy for all x,yC. If L=1 then T is called nonexpansive. T is called quasi-nonexpansive if TxTpxp for all xC and pF(T), where F(T):={xC:Tx=x}, the set of fixed points of T. A mapping T is called γ-strictly pseudocontractive [1] if and only if there exists γ[0,1) such that

T x T y 2 x y 2 +γ ( I T ) x ( I T ) y 2 ,for all x,yC,
(1.1)

and T is called pseudocontractive if

T x T y 2 x y 2 + ( I T ) x ( I T ) y 2 ,for all x,yC,
(1.2)

where I is the identity mapping. We note that inequalities (1.1) and (1.2) can be equivalently written as

xy,TxTy x y 2 λ ( I T ) x ( I T ) y 2 ,
(1.3)

for some λ>0, and

xy,TxTy x y 2 ,for all x,yC,
(1.4)

respectively.

Clearly, the class of nonexpansive mappings is a subset of the class of γ-strictly pseudocontractive mappings and the class of γ-strictly pseudocontractive is contained in the class of pseudocontractive mappings. Moreover, this inclusion is strict due to the following example in [2].

Take X= R 2 , B={x R 2 :x1}, B 1 ={xB:x 1 2 }, B 2 ={xB: 1 2 x1}. If x=(a,b)X we define x⊥ to be (b,a)X. Define T:BB by

Tx= { x + x , if  x B 1 , x x x + x , if  x B 2 .
(1.5)

Then T is a Lipschitzian and pseudocontractive mapping but not a strictly pseudocontractive mapping.

Closely related to the class of pseudocontractive mappings is the class of monotone mappings. A mapping A:CH is called monotone if

xy,AxAy0,for all x,yC,
(1.6)

and A is called γ-inverse strongly monotone if there exists a positive real number γ such that

xy,AxAyγ A x A y 2 ,for all x,yC.
(1.7)

If A is γ-inverse strongly monotone, then inequality (1.7) implies that A is Lipschitzian with constant L:= 1 γ , that is, AxAy 1 γ xy, for all x,yC.

We remark the T is γ-strictly pseudocontractive if and only if A:=(IT) is γ-inverse strongly monotone and T is pseudocontractive if and only if A:=(IT) is monotone. Clearly, the class of monotone mappings includes the class of γ-inverse strongly monotone mappings. We note that the inclusion is proper. This can be seen from the example in [2]. Take A:=(IT), where T is as in (1.5). Then we see that A is monotone but not γ-inverse strongly monotone as T is not strictly pseudocontractive.

A mapping A is called maximal monotone if it is monotone and R(I+rA), the range of (I+rA), is H for all r>0. If A is maximal monotone, then to each r>0 and xH, there corresponds a unique element x r D(A) satisfying

x x r +rA x r .

We denote the resolvent of A by J r x= x r . That is, J r = ( I + r A ) 1 for all r>0. If A is monotone then J r := ( I + r A ) 1 is nonexpansive single valued mapping from R(I+rA) into D(A) and F( J r )=N(A) (see [3]).

It is now well known (see e.g. [4]) that if A is monotone then the solutions of the equation Ax=0 correspond to the equilibrium points of some evolution systems. Consequently, considerable research efforts, especially within the past 20 years or so, have been devoted to iterative methods for approximating the zeros of monotone mapping A or fixed point of pseudocontractive mapping T (see, for example, [511]).

Let A be a nonlinear mapping on H. Consider the problem of finding

uC such that 0Au.
(1.8)

When A is a maximal monotone mapping, a well-known methods for solving (1.8) is the proximal point algorithm: x 1 =xH, and

x n + 1 = J r n x n ,n=1,2,3,,

where J r n = ( I + r n A ) 1 and { r n }(0,), then Rockafellar [12] (also see [13]) proved that the sequence { x n } converges weakly to an element of A 1 (0).

In [14], Kamimura and Takahashi investigated the problem of finding a zero point of a maximal monotone mapping by considering the following iterative algorithm:

x 0 H, x n + 1 = α n x n +(1 α n ) J λ n x n ,n=0,1,,
(1.9)

where { α n } is a sequence in (0,1), { λ n } is a positive sequence, A:HH is a maximal monotone, and J λ n = ( I + λ n A ) 1 . They showed that the sequence { x n } generated by (1.9) converges weakly to some z A 1 (0) in the framework of real Hilbert spaces, provided that the control sequences satisfy some restrictions.

Let C be a nonempty, closed and convex subset of H and A:CH be a nonlinear mapping. The variational inequality problem which was introduced and studied by Stampacchia [15] is to:

find uC such that Au,vu0,vC.
(1.10)

The set of solutions of the variational inequality problem is denoted by VI(C,A).

Variational inequality theory has emerged as an important tool in studying a wide class of numerous problems in physics, optimization, variational inequalities, minimax problems, and the Nash equilibrium problems in noncooperative games (see, for instance, [1622]).

In [23], Takahashi and Toyoda investigated the problem of finding a common point of solutions of the variational inequality problem (1.10) for A:CH a γ-inverse strongly monotone mapping and fixed points of a nonexpansive mapping T:CC by considering the following iterative algorithm:

x 0 H, x n + 1 = α n x n +(1 α n )T P C ( x n λ n A x n ),n=0,1,,
(1.11)

where { α n } is a sequence in (0,1), { λ n } is a positive sequence. They proved that the sequence { x n } generated by (1.11) converges weakly to some zVI(C,A)F(T) provided that the control sequences satisfy some restrictions.

It is worth to mention that the methods studied above give weak convergence theorems in the framework of Hilbert spaces.

Regarding iterative method for a common point of fixed points of nonexpansive and zeros of sum of two monotone mappings, Takahashi et al. [24] proved the following theorem.

Theorem TT [24]

Let C be a nonempty closed and convex subset of a real Hilbert space H. Let A be a γ-inverse strongly monotone mapping of C into H and let B be a maximal monotone mapping on H such that the domain of B is included in C. Let J λ = ( I + λ B ) 1 be the resolvent of B, for λ>0, and let T be a nonexpansive mapping of C into itself such that F(T) ( A + B ) 1 . Let x 1 =xC and let { x n }C be a sequence generated by

x n + 1 = β n x n +(1 β n )T ( α n x + ( 1 α n ) J λ n ( x n λ n A x n ) ) ,n=1,2,,

where { λ n }, { β n } and { α n } satisfy certain conditions. Then { x n } converges strongly to a point of F(T) ( A + B ) 1 (0).

For other related results, we refer to [2530].

A natural question arises: can we obtain an iterative scheme which converges strongly to a common point of fixed points of the pseudocontractive mapping T and zeros of two monotone mappings?

It is our purpose in this paper to introduce an iterative scheme which converges strongly to a common minimum-norm point of fixed points of a Lipschitzian pseudocontractive mapping and zeros of sum of two monotone mappings. Application to a common element of the set of fixed points of a Lipschitzian pseudocontractive mapping and solutions of variational inequality for γ-inverse strongly monotone mapping is included. The results obtained in this paper improve and extend the results of Kamimura and Takahashi [14], Takahashi and Toyoda [23], Takahashi et al. [24] and some other results in this direction.

2 Preliminaries

In what follows we shall make use of the following lemmas.

Lemma 2.1 [31]

Let C be a convex subset of a real Hilbert space H. Let xH. Then x 0 = P C x if and only if

z x 0 ,x x 0 0,zC.

We also remark that in a real Hilbert space H, the following identity holds:

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

Lemma 2.2 [32]

Let { a n } be a sequence of nonnegative real numbers satisfying the following relation:

a n + 1 (1 α n ) a n + α n δ n ,n n 0 ,

where { α n }(0,1) and { δ n }R satisfying the following conditions: lim n α n =0, n = 1 α n =, and lim sup n δ n 0. Then lim n a n =0.

Lemma 2.3 [33]

Let H be a real Hilbert space, C a closed convex subset of H and T:CC be a continuous pseudocontractive mapping, then

  1. (i)

    F(T) is closed convex subset of C;

  2. (ii)

    (IT) is demiclosed at zero, i.e., if { x n } is a sequence in C such that x n x and T x n x n 0, as n, then x=T(x).

Lemma 2.4 [34]

Let { a n } be sequences of real numbers such that there exists a subsequence { n i } of {n} such that a n i < a n i + 1 for all iN. Then there exists a nondecreasing sequence { m k }N such that m k and the following properties are satisfied by all (sufficiently large) numbers kN:

a m k a m k + 1 and a k a m k + 1 .

In fact, m k =max{jk: a j < a j + 1 }.

Lemma 2.5 [35]

Let H be a real Hilbert space. Then for all x i H and α i [0,1] for i=1,2,,n such that α 1 + α 2 ++ α n =1 the following equality holds:

α 0 x 0 + α 1 x 1 + + α n x n 2 = i = 0 n α i x i 2 0 i , j n α i α j x i x j 2 .

Lemma 2.6 [36]

Let C be a nonempty closed and convex subset of a real Hilbert space H. Let A:CE be γ-inverse strongly monotone mapping. Then, for 0<μ<2γ, the mapping A μ x:=(xμAx) is nonexpansive.

Lemma 2.7 [37]

Let H be a Hilbert space. Let A:D(A)H 2 H and B:D(B)H 2 H be maximal monotone mappings. Suppose that D(A)intD(B). Then A+B is a maximal monotone mapping.

3 Main result

Theorem 3.1 Let C be a nonempty, closed and convex subset of a real Hilbert space H. Let T:CC be a Lipschitzian pseudocontractive mapping with Lipschitz constant L. Let A:CH be a γ-inverse strongly monotone mapping and B be a maximal monotone mapping on H such that the domain of B is subset of C. Assume that F=F(T) ( A + B ) 1 (0) is nonempty. Let { x n } be the sequence generated from an arbitrary x 0 C by

{ y n = ( 1 β n ) x n + β n T x n ; x n + 1 = P C [ ( 1 α n ) ( θ n x n + δ n T y n + γ n T λ n x n ) ] ,
(3.1)

where T λ n ( x n ):= ( I + λ n B ) 1 (I λ n A) x n and { λ n }(a,b)(a,2γ), { θ n },{ δ n },{ γ n }(c,d)(0,1), { α n }(0,e)(0,1), for some a,b,c,d,e>0, satisfying the following conditions: (i)  θ n + δ n + γ n =1, (ii) lim n α n =0, α n =; (iii) δ n + γ n β n β< 1 1 + L 2 + 1 , n1. Then { x n } converges strongly to the minimum-norm point x of ℱ.

Proof From Lemma 2.6 and the fact that J λ n is nonexpansive we see that T λ n is nonexpansive. Let pF. Then from (3.1), (1.2), Lemma 2.5 and using the fact that p= T λ n (p) we have

x n + 1 p 2 = P C [ ( 1 α n ) ( θ n x n + δ n T y n + γ n T λ n x n ) ] p 2 ( 1 α n ) ( θ n x n + δ n T y n + γ n T λ n x n ) p 2 α n p 2 + ( 1 α n ) θ n ( x n p ) + δ n ( T y n p ) + γ n ( T λ n x n p ) 2 α n p 2 + ( 1 α n ) [ θ n x n p 2 + δ n T y n p 2 + γ n T λ n x n p 2 ] ( 1 α n ) δ n θ n T y n x n 2 ( 1 α n ) θ n γ n T λ n x n x n 2 α n p 2 + ( 1 α n ) ( θ n + γ n ) x n p 2 + ( 1 α n ) δ n T y n p 2 ( 1 α n ) δ n θ n T y n x n 2 ( 1 α n ) θ n γ n T λ n x n x n 2

and hence

x n + 1 p 2 α n p 2 + ( 1 α n ) ( θ n + γ n ) x n p 2 + ( 1 α n ) δ n [ y n p 2 + y n T y n 2 ] ( 1 α n ) δ n θ n T y n x n 2 ( 1 α n ) θ n γ n T λ n x n x n 2 = α n p 2 + ( 1 α n ) ( θ n + γ n ) x n p 2 + ( 1 α n ) δ n y n p 2 + ( 1 α n ) δ n y n T y n 2 ( 1 α n ) δ n θ n T y n x n 2 ( 1 α n ) θ n γ n T λ n x n x n 2 .
(3.2)

In addition, from (3.1), Lemma 2.5, and (1.2) we get

y n p 2 = ( 1 β n ) ( x n p ) + β n ( T x n p ) 2 = ( 1 β n ) x n p 2 + β n T x n p 2 β n ( 1 β n ) x n T x n 2 ( 1 β n ) x n p 2 + β n [ x n p 2 + x n T x n 2 ] β n ( 1 β n ) x n T x n 2 = x n p 2 + β n 2 x n T x n 2
(3.3)

and

y n T y n 2 = ( 1 β n ) ( x n T y n ) + β n ( T x n T y n ) 2 = ( 1 β n ) x n T y n 2 + β n T x n T y n 2 β n ( 1 β n ) x n T x n 2 ( 1 β n ) x n T y n 2 + β n L 2 x n y n 2 β n ( 1 β n ) x n T x n 2 = ( 1 β n ) x n T y n 2 + β n 3 L 2 x n T x n 2 β n ( 1 β n ) x n T x n 2 = ( 1 β n ) x n T y n 2 β n ( 1 L 2 β n 2 β n ) x n T x n 2 .
(3.4)

Substituting (3.3) and (3.4) into (3.2) we obtain

x n + 1 p 2 α n p 2 + ( 1 α n ) ( θ n + γ n ) x n p 2 + ( 1 α n ) δ n [ x n p 2 + β n 2 x n T x n 2 ] + ( 1 α n ) δ n [ ( 1 β n ) x n T y n 2 β n ( 1 L 2 β n 2 β n ) x n T x n 2 ] ( 1 α n ) δ n θ n T y n x n 2 ( 1 α n ) θ n γ n T λ n x n x n 2 = α n p 2 + ( 1 α n ) x n p 2 ( 1 α n ) δ n β n ( 1 ( L 2 β n 2 + 2 β n ) ) × x n T x n 2 + ( 1 α n ) δ n ( 1 θ n β n ) T y n x n 2 ( 1 α n ) θ n γ n T λ n x n x n 2 ,

and hence

x n + 1 p 2 α n p 2 + ( 1 α n ) x n p 2 ( 1 α n ) δ n β n × ( 1 ( L 2 β n 2 + 2 β n ) ) x n T x n 2 + ( 1 α n ) δ n ( δ n + γ n β n ) T y n x n 2 ( 1 α n ) θ n γ n T λ n x n x n 2 .
(3.5)

Now, from (iii) of the hypotheses we have

12 β n L 2 β n 2 12β L 2 β 2 >0
(3.6)

and

( δ n + γ n ) β n 0,for all n1.
(3.7)

Thus, inequality (3.5) implies that

x n + 1 p 2 α n p 2 +(1 α n ) x n p 2 .
(3.8)

Thus, by induction,

x n + 1 p 2 max { p 2 , x 0 p 2 } ,n0,

which implies that { x n } and hence { y n } are bounded.

Let w n :=(1 α n )( θ n x n + δ n T y n + γ n T λ n x n ). Then we see that x n + 1 = P C w n . Let x = P F (0). Then, using (3.1), (2.1) and following the methods used to get (3.5), we obtain

x n + 1 x 2 = P C [ ( 1 α n ) ( θ n x n + δ n T y n + γ n T λ n x n ) ] x 2 α n ( x ) + ( 1 α n ) [ θ n x n + δ n T y n + γ n T λ n x n x ] 2 ( 1 α n ) δ n T y n + θ n x n + γ n T λ n x n x 2 + 2 α n x , w n x ( 1 α n ) δ n T y n x 2 + ( 1 α n ) θ n x n x 2 + ( 1 α n ) γ n T λ n x n x 2 ( 1 α n ) θ n δ n T y n x n 2 ( 1 α n ) θ n γ n T λ n x n x n 2 + 2 α n x , w n x

and so

x n + 1 x 2 ( 1 α n ) δ n [ y n x 2 + y n T y n 2 ] + ( 1 α n ) ( θ n + γ n ) x n x 2 ( 1 α n ) θ n δ n T y n x n 2 ( 1 α n ) θ n γ n T λ n x n x n 2 + 2 α n x , w n x ( 1 α n ) δ n [ x n x 2 + β n 2 x n T x n 2 ] + ( 1 α n ) δ n [ ( 1 β n ) x n T y n 2 β n ( 1 L 2 β n 2 β n ) × x n T x n 2 ] + ( 1 α n ) ( θ n + γ n ) x n x 2 ( 1 α n ) θ n δ n T y n x n 2 ( 1 α n ) θ n γ n T λ n x n x n 2 + 2 α n x , w n x ,

which implies that

x n + 1 x 2 ( 1 α n ) x n x 2 ( 1 α n ) δ n β n [ 1 L 2 β n 2 2 β n ] × x n T x n 2 + ( 1 α n ) δ n ( δ n + γ n β n ) x n T y n 2 ( 1 α n ) γ n x n T λ n x n 2 + 2 α n x , w n x
(3.9)
(1 α n ) x n x 2 +2 α n x , w n x .
(3.10)

Now, we consider two cases.

Case 1. Suppose that there exists n 0 N such that { x n x } is decreasing for all n n 0 . Then we see that { x n x } is convergent. Thus, from (3.9) and (3.6) we have

x n T x n 0, x n T λ n x n 0as n.
(3.11)

Moreover, from (3.1) and (3.11) we obtain

y n x n = β n x n T x n 0as n,
(3.12)

and hence Lipschitz continuity of T, (3.12), (3.11) imply that

T y n x n T y n T x n + T x n x n L y n x n + T x n x n 0 as  n .
(3.13)

In addition, from (3.13) and (3.11) we have

w n x n = ( 1 α n ) ( θ n x n + δ n T y n + γ n T λ n x n ) x n ( 1 α n ) δ n T y n x n + ( 1 α n ) γ n T λ n x n x n + α n x n 0 as  n .
(3.14)

Furthermore, since { w n } is bounded subset of H which is reflexive, we can choose a subsequence { w n i } of { w n } such that w n i w and lim sup n x , w n x = lim i x , w n i x . It follows from (3.14) that x n i w. Then, from (3.11) and Lemma 2.3, we have wF(T).

Next, we show that w ( A + B ) 1 (0). Let

z n = J λ n (I λ n A) x n .
(3.15)

Then from (3.11) we get z n x n 0 as n. In addition, for any pF, we see that

z n p 2 = J λ n ( I λ n A ) x n J λ n ( I λ n A ) p 2 x n p 2 2 λ n x n p , A x n A p + λ n 2 A x n A p 2 x n p 2 λ n ( 2 γ λ n ) A x n A p 2 .

This implies that

λ n ( 2 γ λ n ) A x n A p 2 x n p 2 z n p 2 ( x n p + z n p ) x n z n ,

and hence we get

A x n Ap0as n.
(3.16)

Now from (3.15) we obtain

x n i λ n i A x n i (I+ λ n i B) z n i .

That is,

x n i z n i λ n i A x n i B z n i .

Since B is monotone, we get for any (u,v)G(B), where G(B) is the graph of B defined by G(B)={(x,w)H×H:xD(A),wAx},

z n i u , x n i z n i λ n i A x n i v 0.
(3.17)

On the other hand, since x n i w,A x n i Awγ A x n i A w 2 , x n i w and A x n i Ap, as n we have A x n i Aw. Thus, letting i, we obtain from (3.17)

wu,Awv0.

Thus, maximality of B implies that AwBw, that is, 0(A+B)(w). Hence, we get w ( A + B ) 1 (0).

Therefore, by Lemma 2.1, we immediately obtain

lim sup n x , w n x = lim i x , w n i x = x , w x 0.
(3.18)

Then it follows from (3.10), (3.18), and Lemma 2.2 that x n x 0 as n. Consequently, x n x = P F (0).

Case 2. Suppose that there exists a subsequence { n i } of {n} such that

x n i x < x n i + 1 x ,

for all iN. Then, by Lemma 2.4, there exists a nondecreasing sequence { m k }N such that m k , and

x m k x x m k + 1 x and x k x x m k + 1 x ,
(3.19)

for all kN. Now, from (3.9) and (3.6) we get x m k T x m k 0, and x m k T λ m k x m k 0 as k. Thus, like in Case 1, we obtain w m k x m k 0 and

lim sup k x , w m k x 0.
(3.20)

Now, from (3.10) we have

x m k + 1 x 2 (1 α m k ) x m k x 2 +2 α m k x , w m k x ,
(3.21)

and hence (3.19) and (3.21) imply that

α m k x m k x 2 x m k x 2 x m k + 1 x 2 + 2 α m k x , w m k x 2 α m k x , w m k x .

But using the fact that α m k >0 and (3.20) we obtain

x m k x 0as k.

This together with (3.21) implies that x m k + 1 x 0 as k. But x k x x m k + 1 x for all kN and hence we obtain x k x . Therefore, from the above two cases, we can conclude that { x n } converges strongly to the minimum-norm point of ℱ. The proof is complete. □

If, in Theorem 3.1, we assume that A=0, then we get T λ n ( x n ):= ( I + λ n B ) 1 x n and hence we get the following corollary.

Corollary 3.2 Let C be a nonempty, closed and convex subset of a real Hilbert space H. Let T:CC be a Lipschtzian pseudocontractive mapping with Lipschitz constant L and B:C 2 H be a maximal monotone mapping. Assume that F=F(T) B 1 (0) is nonempty. Let { x n } be the sequence generated from an arbitrary x 0 C by

{ y n = ( 1 β n ) x n + β n T x n ; x n + 1 = P C [ ( 1 α n ) ( θ n x n + δ n T y n + γ n T λ n x n ) ] ,
(3.22)

where T λ n ( x n ):= ( I + λ n B ) 1 x n and { λ n }(a,1), { θ n },{ δ n },{ γ n }(c,d)(0,1), { α n }(0,e)(0,1), for some a,c,d,e>0, satisfying the following conditions: (i) θ n + δ n + γ n =1, (ii) lim n α n =0, α n =; (iii) δ n + γ n β n β< 1 1 + L 2 + 1 , n1. Then { x n } converges strongly to the minimum-norm point x of ℱ.

We also have the following theorem for two maximal monotone mappings.

Theorem 3.3 Let C be a nonempty, closed and convex subset of a real Hilbert space H such that int(C). Let A,B:CH be maximal monotone mappings. Let T:CC be a Lipschitzian pseudocontractive mapping with Lipschitz constant L such that F=F(T) ( A + B ) 1 (0) is nonempty. Let { x n } be the sequence generated from an arbitrary x 0 C by

{ y n = ( 1 β n ) x n + β n T x n ; x n + 1 = P C [ ( 1 α n ) ( θ n x n + δ n T y n + γ n T λ n x n ) ] ,
(3.23)

where T λ n ( x n ):= ( I + λ n ( A + B ) ) 1 x n and { λ n }(a,1), { θ n },{ δ n },{ γ n }(c,d)(0,1), { α n }(0,e)(0,1), for some a,c,d,e>0, satisfying the following conditions: (i) θ n + δ n + γ n =1, (ii) lim n α n =0, α n =; (iii) δ n + γ n β n β< 1 1 + L 2 + 1 , n1. Then { x n } converges strongly to the minimum-norm point x of ℱ.

Proof From Lemma 2.7 we find that A+B is a maximal monotone and hence by Corollary 3.2 we get the required assertion. □

If, in Theorem 3.3, we assume that T=I, the identity mapping on C, then we get the following corollary.

Corollary 3.4 Let C be a nonempty, closed and convex subset of a real Hilbert space H such that int(C). Let A,B:CH be maximal monotone mappings such that F= ( A + B ) 1 (0) is nonempty. Let { x n } be the sequence generated from an arbitrary x 0 C by

x n + 1 = P C [ ( 1 α n ) ( ( 1 γ n ) x n + γ n T λ n x n ) ] ,

where T λ n ( x n ):= ( I + λ n ( A + B ) ) 1 x n and { λ n }(a,1), { γ n }(c,d)(0,1), { α n }(0,e)(0,1), for some a,c,d,e>0, satisfying the following conditions: lim n α n =0 and α n =. Then { x n } converges strongly to the minimum-norm point x of ℱ.

4 Applications

We next study the problem of finding a solution of a variational inequality. Let C be a nonempty closed convex subset of a real Hilbert space H. The normal cone for C at a point xC, denoted by N C (x), is defined by

N C (x)= { x H : y x , x 0 , y C } .
(4.1)

Let f:H(,] be a proper lower semicontinuous convex function. Define the subdifferential

f(x)= { z H : f ( x ) + y x , z f ( y ) , y H } ,

for all xH. Then from Rockafellar [38] we know that ∂f is maximal monotone mapping of H into itself. Let C be a nonempty closed convex subset of H and i C be the indicator function of C, that is,

i C (x)= { 0 , if  x C , , if  x C .
(4.2)

Then i C :H(,] is a proper lower semicontinuous convex function on H and i C is a maximal monotone mapping. Let J λ x= ( I + λ i C ) 1 x for all λ>0 and xH. From the fact that i C x= N C x and xC, we get

u J λ x x u + λ i C u x u + λ N C u x u λ N C u x u , y u 0 , y C u = P C x .

Moreover,

x ( A + i C ) 1 ( 0 ) 0 ( A + i C ) x A x i C x A x , y x 0 , y C x VI ( C , A ) ,

and hence x ( A + i C ) 1 (0)xVI(C,A). Thus, the following corollary holds. Now, using Theorem 3.1, we obtain a strong convergence theorem for finding a common point of fixed points of Lipschtzian pseudocontractive mapping and solutions of the variational inequality problem for γ-inverse monotone mapping.

Theorem 4.1 Let C be a nonempty, closed and convex subset of a real Hilbert space H. Let T:CC be a Lipschitzian pseudocontractive mapping with Lipschitz constant L and let A:CH be a γ-inverse strongly monotone mapping such that F=F(T)VI(C,A). Let { x n } be the sequence generated from an arbitrary x 0 C by

{ y n = ( 1 β n ) x n + β n T x n ; x n + 1 = P C [ ( 1 α n ) ( θ n x n + δ n T y n + γ n P C ( x n λ n A x n ) ) ] ,
(4.3)

where { λ n }(a,b)(a,2γ), { θ n },{ δ n },{ γ n }(c,d)(0,1), { α n }(0,e)(0,1), for some a,b,c,d,e>0, satisfying the following conditions: (i) θ n + δ n + γ n =1, (ii) lim n α n =0, α n =; (iii) δ n + γ n β n β< 1 1 + L 2 + 1 , n1. Then { x n } converges strongly to the minimum-norm point x of ℱ.

If, in Theorem 4.1, we take TI, the identity mapping on C we have the following corollary for a solution of variational inequality for a γ-inverse strongly monotone mapping.

Corollary 4.2 Let C be a nonempty, closed and convex subset of a real Hilbert space H. Let A:CH be a γ-inverse strongly monotone mapping with VI(C,A). Let { x n } be the sequence generated from an arbitrary x 0 C by

x n + 1 = P C [ ( 1 α n ) ( ( 1 γ n ) x n + γ n P C ( x n λ n A x n ) ) ] ,

where { λ n }(a,b)(a,2γ), { γ n }(c,d)(0,1), { α n }(0,e)(0,1), for some a,b,c,d,e>0, satisfying the following conditions: lim n α n =0, α n =. Then { x n } converges strongly to the minimum-norm point x of VI(C,A).

If, in Theorem 4.1, we take A:=(IS), where S is a nonexpansive self mapping of C into itself, then we get the following corollary.

Corollary 4.3 Let C be a nonempty, closed and convex subset of a real Hilbert space H. Let T:CC be a Lipschitzian pseudocontractive mapping with Lipschitz constant L and let S:CC be a nonexpansive mapping such that F=F(T)F(S). Let { x n } be the sequence generated from an arbitrary x 0 C by

{ y n = ( 1 β n ) x n + β n T x n ; x n + 1 = P C [ ( 1 α n ) ( θ n x n + δ n T y n + γ n ( ( 1 λ n ) x n + λ n S x n ) ) ] ,
(4.4)

where { λ n }(a,b)(a, 1 2 ), { θ n },{ δ n },{ γ n }(c,d)(0,1), { α n }(0,e)(0,1), for some a,b,c,d,e>0, satisfying the following conditions: (i) θ n + δ n + γ n =1, (ii) lim n α n =0, α n =; (iii) δ n + γ n β n β< 1 1 + L 2 + 1 , n1. Then { x n } converges strongly to the minimum-norm point x of F(T)F(S).

Proof Put A:=IS in Theorem 4.1. Then we see that A is a 1 4 -inverse strongly monotone mapping. Furthermore, for xC we have

P C (xλAx)= P C ( x λ ( I T ) x ) =(1λ)x+λTx

and

x VI ( C , A ) x VI ( C , I S ) S x x , y x 0 , y C P C S x = x S x = x .
(4.5)

Thus, we obtain VI(C,A)=F(S). Therefore, the conclusion holds by Theorem 4.1 □

Remark 4.4 Theorem 3.1 provides convergence sequence to a common point of fixed points of a Lipschitzian pseudocontractive mapping and zeros of two monotone mappings in Hilbert spaces.

Remark 4.5 Theorem 3.1 improves Theorem 3.1 of Takahashi et al. [24] in the sense that our convergence is to the common minimum-norm point of fixed points of a Lipschitzian pseudocontractive mapping and zeros of sum of two monotone mappings. Corollary 3.4 improves Theorem 1 of Kamimura and Takahashi [14] in the sense that our convergence is for the a zero of sum of two maximal monotone mappings. Theorem 4.1 extends Theorem 3.1 of Takahashi and Toyoda [23] in the sense that our convergence is to the common minimum-norm point of fixed points of a Lipschitzian pseudocontractive mapping and solutions of variational inequality for a γ-inverse strongly monotone mapping.