1 Introduction and preliminaries

Let C be a nonempty closed and convex subset of a real Hilbert space H with the inner product and induced norm . A mapping F of C into H is said to be monotone if

FxFy,xy0
(1.1)

for all x,yC.

The variational inequality problem with respect to F and C is to find a point zC such that

Fz,yz0for all yC.
(1.2)

Variational inequalities were initially investigated by Kinderlehrer and Stampacchia in [1], and have been widely studied by many authors ever since, due to the fact that they cover as diverse disciplines as partial differential equations, optimization, optimal control, mathematical programming, mechanics and finance (see [13]).

We know that if F is a k-Lipschitz continuous and η-strongly monotone mapping, i.e., F enjoys the following properties:

FxFykxyandFxFy,xyη x y 2

for all x,yC, where k and η are fixed positive numbers, then (1.2) has a unique solution. It is well known that (1.2) is equivalent to the fixed point equation

z= P C [ ( I μ F ) z ] ,
(1.3)

where P C stands for the metric projection from H onto C and μ is an arbitrarily positive number. Consequently, the well-known iterative procedure, the projected gradient method (PGM) [36], can be used to solve (1.2). PGM generates an iterative sequence by the recursion

x 1 Cand x n + 1 = P C [ ( I μ F ) x n ] ,n1.
(1.4)

When F is a k-Lipschitz continuous and η-strongly monotone mapping, as μ(0, 2 η k 2 ), the sequence { x n } generated by (1.4) converges strongly to a unique solution of (1.2).

The projected gradient method (1.4) involves the metric projection P C . In order to reduce the complexity caused by P C , Yamada [7] introduced a hybrid steepest descent method (HSDM) for solving (1.2). By assuming that C= i = 1 N Fix( T i ), where Fix( T i )={xH:x= T i x} and T i is a nonexpansive mapping on H, i.e.,

TxTyxy

for all x,yH, Yamada proposed the following iterative algorithm:

x 1 H, x n + 1 =(I λ n μF) T [ n ] x n ,
(1.5)

where T [ n ] = T n mod N , taking values in {1,2,,N}, μ(0, 2 η k 2 ) and { λ n } is a sequence of real numbers in (0,1), and proved that, under the following conditions:

(L1) lim n λ n =0,

(L2) n = 1 λ n =,

(L3) n = 1 | λ n λ n + N |<, and

(L4) C=Fix( T 1 T 2 T N 1 T N )=Fix( T N T 1 T N 2 T N 1 )==Fix( T 2 T 3 T N T 1 ),

the sequence { x n } generated by (1.5) converges strongly to a unique solution of (1.2). The algorithms and convergence results of Yamada in [7] have been improved and extended to a finite or an infinite family of nonexpansive mappings; see, for example, Xu and Kim [8], Zeng [9], Liu and Cai [10], and Iemoto and Takahashi [11]. However, all such improvements and extensions are confined to a finite or an infinite family of nonexpansive mappings.

In this paper, we propose a new iterative algorithm based on a combination of the projected gradient method for variational inequalities with the Ishikawa-type method for fixed point problems to solve (1.2) with C= i = 1 N Fix( T i ), where { T i } i = 1 N is a finite family of L i -Lipschitz continuous and quasi-pseudocontractive mappings on Ω, where Ω is a nonempty closed and convex subset of H, while F:ΩH is a k-Lipschitz continuous and η-strongly monotone mapping.

Given a stating point x 1 Ω, the iteration is generated by

{ x 1 Ω , y n i = ( 1 α n i ) x n + α n i T i x n , i = 1 , 2 , , N , x n + 1 = P Ω [ ( I λ n μ F ) ( β n 0 x n + i = 1 N β n i T i y n i ) ] , n 1 ,
(1.6)

where { β n i :i=0,1,2,,N}(a,b)(0,1), { λ n }(0,1) satisfy the following conditions:

  1. (i)

    i = 0 N β n i =1;

  2. (ii)

    lim n λ n =0, n = 1 λ n =;

  3. (iii)

    i = 1 N β n i min{ α n i :i=1,2,,N}max{ α n i :i=1,2}α< 1 1 + L 2 + 1 , n1,

where L:=max{ L i :i=1,2,,N}, while μ is a fixed constant satisfying μ(0, 2 η k 2 ).

By virtue of new analysis techniques, we prove that the sequence generated by (1.6) converges strongly to a unique solution of (1.2) with C= i = 1 N Fix( T i ).

In order to reach our goal, we need the following conceptions and facts.

Let D be a nonempty subset of a real Hilbert space H. A mapping T:DH is called κ-strictly pseudocontractive if and only if there exists a constant κ[0,1) such that

T x T y 2 x y 2 +κ ( I T ) x ( I T ) y 2
(1.7)

for all x,yD. When κ=1, T is said to be pseudocontractive.

T is said to be quasi-pseudocontractive if and only if Fix(T) and

T x y 2 x y 2 + ( I T ) x 2
(1.8)

for all xD but yFix(T).

We remark that inequalities (1.7) and (1.8) are equivalent to the inequalities

TxTy,xy x y 2 1 κ 2 ( I T ) x ( I T ) y 2 for all x,yD
(1.9)

and

Txy,xy x y 2
(1.10)

for all xD but yFix(T), respectively.

We note that if T is κ-strictly pseudocontractive, then it is Lipschitz continuous and pseudocontractive; if T is a pseudocontraction with a fixed point, then T is a quasi-pseudocontraction; however, the converse may be not true.

Recall that the metric (nearest point) projection from H onto a nonempty closed convex subset E of H is defined as follows: for each point xH, there exists a unique point P E xE with the property

x P E xxyfor all yE,

that is, for any point xH, x ¯ = P E x if and only if x ¯ E and x x ¯ =inf{xy:yE}.

Lemma 1.1 [12, 13]

Let P E :HE be a metric projection from H on a nonempty closed convex subset E of H. Then the following conclusions hold true:

(p1) Given xH and zE. Then z= P E x if and only if there holds the inequality

xz,yz0,yE.
(1.11)

(p2)

P E x P E y,xy P E x P E y 2 ,x,yH,
(1.12)

in particular, one has

P E x P E yxy,x,yH.
(1.13)

Lemma 1.2 [14, 15]

  1. (i)

    x ± y 2 = x 2 ±2x,y+ y 2 for all x,yH;

  2. (ii)

    ( 1 t ) x + t y 2 =(1t) x 2 +t y 2 t(1t) x y 2 for all x,yH and tR;

  3. (iii)

    for all x i H and α i [0,1] (i=1,2,,n) such that i = 1 n α i =1, the following equality holds:

    i = 1 n α i x i 2 = i = 1 n α i x i 2 1 i < j n α i α j x i x j 2 .

Lemma 1.3 [7]

Let Ω be a nonempty subset of H and F:ΩH be a k-Lipschitz continuous and η-strongly monotone mapping. For each λ(0,1] and μ(0, 2 η k 2 ), write T λ :=(IλμF) and τ:=1 1 μ ( 2 η μ k 2 ) (0,1). Then we have

T λ x T λ y (1λτ)xy

for all x,yΩ.

Lemma 1.4 [16]

Let E be a nonempty closed convex subset of a real Hilbert space H and T:EE be L-Lipschitz continuous and quasi-pseudocontractive. Then Fix(T) is a nonempty closed convex subset of E, and therefore P Fix ( T ) x is well defined for each xH.

Lemma 1.5 [17]

Let E be a nonempty closed convex subset of a real Hilbert space H and T:EE be a demicontinuous pseudocontraction from E into itself. Then Fix(T) is a closed convex subset of E and IT is demiclosed at zero.

Lemma 1.6 [18]

Let { a n } be a sequence 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 fulfilled:

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

for all sufficiently large numbers kN.

Lemma 1.7 [19]

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

s n + 1 (1 t n ) s n + t n σ n ,n n 0 ,

where { t n }(0,1) and { σ n }R satisfy the following conditions: lim n t n =0, n = 1 t n =, and lim ¯ n σ n 0. Then s n 0 as n.

2 Main results

Theorem 2.1 Let Ω be a nonempty, closed and convex subset of a real Hilbert space H. Let T 1 , T 2 ,, T N :ΩΩ be L i -Lipschitz continuous and quasi-pseudocontractive with Lipschitz constants L 1 , L 2 ,, L N , respectively. Let F:ΩH be a k-Lipschitz continuous and η-strongly monotone mapping. Assume that F= i = 1 N Fix( T i ) and I T i are demiclosed at zero for i=1,2,,N. Let { x n } be defined by (1.6). Then { x n } converges strongly to a unique solution x of (1.2), where x = P F (IμF) x .

Proof First of all, we show that P F x is well defined for each xH. Indeed, in view of Lemma 1.4, we know that Fix( T i ) are closed convex for i=1,2,,N, and hence ℱ is also nonempty, closed and convex; consequently, P F x is well defined for any xH. Secondly, we show that there exists a unique x F such that

x = P F (IμF) x .
(2.1)

Indeed, in view of Lemma 1.3, we know that IμF:ΩH is a contraction, and hence P F (IμF):ΩΩ is also a contraction on Ω. Then we use the Banach contraction mapping principle to deduce (2.1).

Write u n = β n 0 x n + i = 1 N β n i T i y n i . Then, pF, by virtue of Lemma 1.2, (1.6) and (1.8), we have that

y n i p 2 = ( 1 α n i ) ( x n p ) + α n i ( T i x n p ) 2 = ( 1 α n i ) x n p 2 + α n i T i x n p 2 α n i ( 1 α n i ) x n T i x n 2 ( 1 α n i ) x n p 2 + α n i [ x n p 2 + x n T i x n 2 ] α n i ( 1 α n i ) x n T i x n 2 = x n p 2 + α n i 2 x n T i x n 2
(2.2)

for i=1,2,,N and all n1.

Furthermore, from (1.6) and Lemma 1.2, we get that

y n i T i y n i 2 = ( 1 α n i ) ( x n T i y n i ) + α n i ( T i x n T i y n i ) 2 = ( 1 α n i ) x n T i y n i 2 + α n i T i x n T i y n i 2 α n i ( 1 α n i ) x n T i x n 2 ( 1 α n i ) x n T i y n i 2 + α n i L 2 x n y n i 2 α n i ( 1 α n i ) x n T i x n 2 = ( 1 α n i ) x n T i y n i 2 + α n i 3 L 2 x n T i x n 2 α n i ( 1 α n i ) x n T i x n 2 = ( 1 α n i ) x n T i y n i 2 α n i ( 1 α n i L 2 α n i 2 ) x n T i x n 2
(2.3)

for i=1,2,,N and all n1.

At this point, we can estimate u n p 2 . In fact, from Lemma 1.2, (2.2), (2.3) and conditions (i) and (iii) in (1.6), we have

u n p 2 = β n 0 ( x n p ) + i = 1 N β n i ( T i y n i p ) 2 = β n 0 x n p 2 + i = 1 N β n i ( T i y n i p ) 2 i = 1 N β n 0 β n i x n T i y n i 2 1 i < j N β n i β n j T i y n i T j y n j 2 β n 0 x n p 2 + i = 1 N β n i [ y n i p 2 + y n i T i y n i 2 ] i = 1 N β n 0 β n i x n T i y n i 2 1 i < j N β n i β n j T i y n i T j y n j 2 β n 0 x n p 2 + i = 1 N β n i x n p 2 + i = 1 N β n i ( 1 α n i ) x n T i y n i 2 i = 1 N β n i α n i ( 1 α n i L 2 α n i 2 ) x n T i x n 2 i = 1 N β n 0 β n i x n T i y n i 2 = x n p 2 i = 1 N β n i α n i ( 1 α n i L 2 α n i 2 ) x n T i x n 2 + i = 1 N β n i ( 1 α n i β n 0 ) x n T i y n i 2 x n p 2 i = 1 N β n i α n i ( 1 α n i L 2 α n i 2 ) x n T i x n 2 x n p 2 ( i = 1 N β n i ) 2 ( 1 α L 2 α 2 ) x n T i x n 2 x n p 2 ( N a ) 2 ( 1 α L 2 α 2 ) x n T i x n 2
(2.4)

for all i=1,2,,N and all n1.

Note that 1α L 2 α 2 >0, it follows from (2.4) that

u n p x n pfor all n1.
(2.5)

In particular, for x = P F (IμF) x F, we have

u n x x n x for all n1.
(2.6)

From Lemmas 1.1, 1.3 and (2.6), we can prove that { x n } is bounded. Indeed, we have

x n + 1 x = P Ω [ ( I λ n μ F ) u n ] x = P Ω [ ( I λ n μ F ) u n ] P Ω x ( I λ n μ F ) u n x = ( I λ n μ F ) u n ( I λ n μ F ) x λ n μ F x = ( I λ n μ F ) u n ( I λ n μ F ) x + λ n μ F x ( 1 τ λ n ) u n x + μ λ n F x ( 1 τ λ n ) u n x + τ λ n μ F x τ ( 1 τ λ n ) x n x + τ λ n μ F x τ max { x 1 x , μ F x τ } : = M

for all n1, and therefore { x n } is bounded; consequently, { y n i }, { u n } and {F u n } are all bounded.

We next show that x n x (n).

By virtue of Lemmas 1.1-1.3, (1.6) and (2.4), we have that

x n + 1 x 2 = P Ω [ ( I λ n μ F ) u n ] x 2 ( I λ n μ F ) u n x 2 = ( I λ n μ F ) u n ( I λ n μ F ) x λ n μ F x 2 = ( I λ n μ F ) u n ( I λ n μ F ) x 2 + λ n 2 μ 2 F x 2 + 2 μ λ n F x , ( I λ n μ F ) u n ( I λ n μ F ) x ( 1 τ λ n ) u n x 2 + λ n 2 μ 2 F x 2 + 2 μ λ n F x , x u n + 2 μ 2 λ n 2 F x , F u n F x = ( 1 τ λ n ) [ x n x 2 ( N a ) 2 ( 1 α L 2 α 2 ) x n T i x n 2 ] + 2 μ λ n F x , x u n + 2 μ 2 λ n 2 F x , F u n λ n 2 μ 2 F x 2 ( 1 τ λ n ) x n x 2 ( 1 τ λ n ) C 1 x n T i x n 2 + 2 μ λ n F x , x u n + 2 μ 2 F x λ n 2 F u n ( 1 τ λ n ) x n x 2 ( 1 τ λ n ) C 1 x n T i x n 2 + 2 μ λ n F x , x u n + C 2 λ n 2
(2.7)

for i=1,2,,N and all n1, where C 1 = ( N a ) 2 (1α L 2 α 2 ) and C 2 =2 μ 2 F x sup{F u n :n1} are fixed positive constants.

Set s n = x n x 2 . Then (2.7) reduces to

s n + 1 s n +τ λ n s n +(1τ λ n ) C 1 x n T i x n 2 2μ λ n F x , x u n + C 2 λ n 2
(2.8)

for i=1,2,,N and all n1.

Now we consider two possible cases.

Case 1. { s n } is decreasing eventually, that is, there exists some integer n 0 1 such that

s n + 1 s n for all n n 0 .

In this case, we have lim n s n exists.

Taking the limit in (2.8), noting that λ n 0 as n, we get that

x n T i x n 0as n
(2.9)

for i=1,2,,N. It follows from (1.6) that

x n y n i 0as n
(2.10)

for i=1,2,,N. Since T i is L i -Lipschitz continuous, we have that

T i x n T i y n i L i x n y n i
(2.11)

for i=1,2,,N. Consequently, from (2.9)∼(2.11) we get that

u n x n = i = 1 N β n i ( x n T i y n i ) i = 1 N β n i x n T i y n i i = 1 N β n i x n T i x n + i = 1 N β n i T i x n T i y n i b i = 1 N x n T i x n + L b i = 1 N x n y n i 0

as n, which derives that

lim ¯ n F x , x u n = lim ¯ n F x , x x n .
(2.12)

Assume that

lim ¯ n F x , x x n = lim k F x , x x n k .
(2.13)

Without loss of generality, we can assume that x n k x ˆ weakly as k; then x ˆ = T i x ˆ for i=1,2,,N, by virtue of (2.9) and our assumption, and hence x ˆ F. It follows from (2.13) and (1.2) that

lim ¯ n F x , x u n = F x , x x ˆ 0.
(2.14)

Set t n =τ λ n and σ n = 2 μ τ F x , x u n + C 2 τ λ n . Then (2.8) reduces to

s n + 1 (1 t n ) s n + t n σ n ,

where lim ¯ n σ n 0. Now Lemma 1.7 can be used to deduce s n 0 as n.

Case 2. { s n } is not decreasing eventually, that is, there exists a subsequence {ni} of {n} such that s n i s n i + 1 for all iN. By virtue of Lemma 1.6, we know that there exists a nondecreasing sequence { m k }N such that m k , s m k s m k + 1 and s k s m k + 1 for all sufficiently large kN. In this case, we have s m k + 1 s m k 0 for large enough kN. It follows from (2.8) that

lim k ( s m k + 1 s m k )=0,
(2.15)
lim k ( x m k T i x m k )=0for i=1,2,,N,
(2.16)

and

lim ¯ k s m k 2μ lim ¯ k F x , x u m k .
(2.17)

By using a reasoning similar to case 1, we can obtain that lim ¯ k F x , x u m k 0, and hence lim ¯ k s m k 0 by (2.17), i.e., s m k 0 as k, which derives s m k + 1 0 as k; consequently, s k 0 as k, since s k s m k + 1 for sufficiently large kN. This completes the proof. □

Remark 2.1 When Ω=H, P Ω in (1.6) can be dropped.

Corollary 2.1 Let Ω be a nonempty, closed and convex subset of a real Hilbert space H. Let T 1 , T 2 ,, T N :ΩΩ be N L i -Lipschitz continuous and strongly pseudocontractive with Lipschitz constants L 1 , L 2 ,, L N , respectively. Let F, ℱ and { x n } be the same as in Theorem  2.1. Then { x n } converges strongly to a unique solution x of (1.2), where x = P F (IμF) x .

Proof By virtue of Lemma 1.5, we know that Fix( T i ) are closed convex for i=1,2,,N and hence F= i = 1 N Fix( T i ) is nonempty, closed and convex. Lemma 1.5 also ensures that I T i are demiclosed at zero for i=1,2,,N and hence the conclusion of Corollary 2.1 follows exactly from Theorem 2.1. □

Corollary 2.2 Let Ω be a nonempty, closed and convex subset of a real Hilbert space H. Let T 1 , T 2 ,, T N :ΩΩ be N strict pseudocontractions, respectively. Let F, ℱ and { x n } be the same as in Theorem  2.1. Then { x n } converges strongly to a unique solution x of (1.2), where x = P F (IμF) x .

Proof Since every strictly pseudocontractive mapping is Lipschitz continuous and pseudocontractive, we have the desired conclusion. □

Corollary 2.3 Let Ω be a nonempty, closed and convex subset of a real Hilbert space H. Let T 1 , T 2 ,, T N :ΩΩ be N nonexpansive mappings, respectively. Let F, ℱ and { x n } be the same as in Theorem  2.1. Then { x n } converges strongly to a unique solution x of (1.2), where x = P F (IμF) x .

Proof Since any nonexpansive mapping is 1-Lipschitz continuous and pseudocontractive, we have the desired conclusion by Corollary 2.2. □

Remark 2.2 When F=I, we have the following strong convergence theorem.

Corollary 2.4 Let Ω be a nonempty, closed and convex subset of a real Hilbert space H. Let T 1 , T 2 ,, T N :ΩΩ be N L i -Lipschitz continuous and quasi-pseudocontractive with Lipschitz constants L 1 , L 2 ,, L N , respectively. Letand I T i be the same as in Theorem  2.1. Let { x n } be defined by (1.6) with F=I. Then { x n } converges strongly to the minimum-norm fixed point of the family { T i } i = 1 N .

3 Numerical example

Example 3.1 [20]

Consider the following optimization problem: find an element

x C:φ ( x ) = min x C φ(x),
(3.1)

where φ(x)= 1 2 x 2 , x=( x 1 , x 2 ) R 2 , a Euclid space, and C= C 1 C 2 , defined by

C 1 = { ( x 1 , x 2 ) R 2 : x 1 2 x 2 + 1 0 } , C 2 = { ( x 1 , x 2 ) R 2 : 4 x 1 x 2 3 0 }

(3.1) has a unique solution x =(1,1) and F=φ=I is 1-Lipschitz continuous and 1 2 -strongly monotone. Starting with the point x 1 =( x 1 , x 2 )=(2,3), μ= 1 20 (0,1) and λ n = 1 n + 1 , set α n i = 1 100 + 1 n + 100 , β n 1 = β n 2 = 1 2 α n i , β n 0 =1 α n i for i=1,2, Table 1 shows the results of algorithm in [20], we obtained the results of algorithm (1.6) in Table 2. Obviously, the results in Table 2 are better.

Table 1 The results of the algorithm in [20]
Table 2 The results of algorithm ( 1.6 )

Example 3.2 [21]

Let H=R with absolute value norm. Let Ω=[2,1] and T 1 , T 2 :ΩΩ be defined by

T 1 x={ x + x 2 , x [ 2 , 0 ] , x , x ( 0 , 1 ] ,

and

T 2 x:={ x , x [ 2 , 1 2 ] , x 2 ( x 1 2 ) 2 , x ( 1 2 , 1 ] .

Then F=Fix( T 1 )Fix( T 2 )=[0,1][2, 1 2 ]=[0, 1 2 ], T 1 :ΩΩ is 5-Lipschitz continuous and pseudocontractive and T 2 :ΩΩ is 10-Lipschitz continuous and pseudocontractive. We find the point x F with the minimum-norm. To do so, set F=I.

Now, taking λ n = 1 n + 10 , α n i = 1 100 + 1 n + 100 , β n 1 = β n 2 = 1 2 α n i , β n 0 =1 α n i for i=1,2, and μ= 1 2 (0, 2 η k 2 )=(0,1), we see that the conditions of Corollary 2.1 are fulfilled and algorithm (1.6) provides the data in Table 3. Our result is better.

Table 3 Values of { x n } with initial values x 0 =1 and x 0 =0.8