Vietnam Journal of Mathematics (will be inserted by the editor)

A Fixed Point Scheme for Nonexpansive Mappings, Variational Inequalities and Equilibrium Problems
Pham N. Anh Le Q. Thuy Do D. Thanh

Received: 10 May 2013 / Accepted: 15 December 2013

Abstract The purpose of this paper is to introduce a new iteration scheme and prove a strong convergence theorem for nding the common element of the xed point set of a nonexpansive mapping, the solution set of variational inequalities and the solution set of equilibrium problems. Under certain conditions on parameters, we show that the iterative sequences generated by the scheme strongly converge to the common element in a real Hilbert space. Keywords Nonexpansive Pseudomonotone Continuous Fixed point Variational inequalities Equilibrium problems Mathematics Subject Classication (2010) 65K10 90C33

1 Introduction The equilibrium problems in the sense of Blum and Oettli (see [7]), shortly EP( f , C ), are presented as follows: Find x C such that f (x , y) 0 for all y C , EP( f , C )

where C is a nonempty closed convex subset of a real Hilbert space H with inner product , and norm , f : C C R is a bifunction such that f (x, x) = 0 for all x C and
This work is supported by the Vietnam Institute for Advanced Study in Mathematics. P.N. Anh ( ) Department of Scientic Fundamentals, Posts and Telecommunications Institute of Technology, Hanoi, Vietnam E-mail: anhpn@ptit.edu.vn L.Q. Thuy School of Applied Mathematics and Informatics, Ha Noi University of Science and Technology, No. 1, Dai Co Viet Road, Hai Ba Trung, Hanoi, Vietnam E-mail: thuy.lequang@hust.edu.vn D.D. Thanh Department of Mathematics, Haiphong University, Vietnam

Pham N. Anh et al.

f (x, ) is convex and subdifferentiable on C for every x C . The solution set of Problem EP( f , C ) is denoted by Sol( f , C ). The bifunction f is called strongly monotone on C with > 0, if f (x, y) + f (y, x) x y 2 x, y C ; monotone on C , if f (x, y) + f (y, x) 0 x, y C ; pseudomonotone on C , if f (x, y) 0 f (y, x) 0 x, y C ;

Lipschitz-type continuous on C with constants c1 > 0 and c2 > 0 in the sense of Mastroeni (see [13]) if f (x, y) + f (y, z) f (x, z) c1 x y
2

c2 y z

x, y, z C .

The mapping B : C H is called -inverse strongly monotone, if Bx By, x y Bx By

2

x, y C .

The variational inequalities (shortly VI(C , B)) are to nd x C such that Bx , x x 0 x C . (1)

The solution set of Problem VI(C , B) is denoted by sol(C , B). The mapping g : C C is said to be contractive with (0, 1), if g(x) g(y) x y The mapping S : C C is called nonexpansive, if Sx Sy x y x, y C . x, y C .

Fix(S) denotes the set of xed points of S. A linear bounded operator A of H into itself is called strongly positive if there is a constant > 0 with property that Ax, x x
2

x H .

In this paper, we are interested in the problem of nding a common element of the solution set of the equilibrium problems Sol( f , C ), the solution set of variational inequalities sol(C , B) and the set of xed points Fix(S), namely: Find x Fix(S) sol(C , B) Sol( f , C ). (2)

Problem (2) is very general and it includes the variational inequalities, the equilibrium problems, the xed point problem, and the vector optimization problem as particular cases. It is well-known that the problem of nding a common xed point of mappings has been extensively investigated (see, for example, [3, 6, 12] and the references therein). In fact, x is a solution to Problem VI(F, C ) if and only if it is a xed point of the mapping T , where T (x) := PrC (x F (x)) for all x C . Otherwise, for each > 0 and x C , x Sol( f , C ) if and only if it is a xed point of the solution mapping S, where S(x) := argmin{ f (x, y) + x y 2 : y C} (see [1]). So, we can say that, solving the problem of nding a common element of the solution set of the equilibrium problem EP( f , C ), the variational inequality

A Fixed Point Scheme for Nonexpansive Mappings

Under certain conditions on parameters k and k , he showed that the sequences {xk } and {yk } weakly converge to the point x Fix(S) Sol( f , C ). Inspired and motivated by the idea of Anh [1], Wangkeeree and Preechasilp [17] replaced xk+1 in (3) by xk+1 := PC k g(xk ) + (1 k A)SPC (t k Bt k ) , where t k = argmin{k f (yk , y) + y xk
2

problem VI(F, C ) and the set of xed points of nonexpansive mappings, is an extended study of the problem of nding a common xed point of mappings. Theory and methods for solving Problem (2) have been well developed by many researchers (see [2, 46, 8, 14, 18, 19] and the references therein). Combettes and Hirstoaga [9] proposed an iterative scheme of nding the best approximation to the initial data when Sol( f , C ) = 0 / and proved a strong convergence theorem. Motivated by this idea, Takahashi and Takahashi [16] introduced the viscosity approximation method for nding a common element of the set of solutions of an equilibrium problem and the set of xed points of a nonexpansive mapping in a real Hilbert space. Recently, Anh [1] proposed a hybrid extragradient algorithm for nding a point of the set Fix(S) Sol( f , C ). The iteration sequence is given by 0 x C, yk = argmin{ f (xk , y) + y xk 2 : y C }, k (3) t k = argmin{k f (yk , y) + y xk 2 : y C }, k+1 x = k x0 + (1 k )Sxk .

: y C}

and g is contractive, A is a strongly positive linear bounded operator of H into itself. Then they showed that under some control conditions, the sequences {xk }, {yk }, and {t k } strongly converge to an element of Fix(S) sol(B, C ) Sol( f , C ). Combining the iteration method in [17] and an improvement set of linesearch techniques for equilibrium problems, we introduce a new iteration scheme for nding an element of Fix(S) sol(C , B) Sol( f , C ). Then, we show that the iterative sequences generated by the scheme strongly converge to a solution of Problem (2) in a real Hilbert space.

2 Preliminaries Let C be a nonempty closed convex subset of a real Hilbert space H . Let f : C C R be a bifunction. For solving the mixed equilibrium problem, let us assume the following conditions for a bifunction f : (A1 ) (A2 ) (A3 ) (A4 ) f (x, x) = 0 for all x C ; f is continuous on C ; f is pseudomonotone on C ; for each x C , f (x, ) is convex and subdifferentiable on C .

For each point x H , there exists the unique nearest point in C , denoted by PC (x), such that x PC (x) x y The mapping PC is called the metric projection on C . y C .

Pham N. Anh et al.

Lemma 1 Let C be a nonempty closed convex subset of H , x H and y C. Then (i) (ii) (iii) (iv) y = PC (x) if and only if x y, y z 0 for all z C; PC is a nonexpansive mapping on C; x y, PC (x) PC (y) PC (x) PC (y) 2 for all x, y H , x PC (x), PC (x) y 0 for all x H and y C.

Using Lemma 1, one can show that Problem (1) is equivalent to a xed point problem. Lemma 2 A point u C is a solution of the variational inequality (1) if and only if u satises the relation u = PC (u Bu) for all > 0. A set-valued mapping T : H 2H is called monotone if for all x, y H , u T x, and v Ty imply x y, u v 0. A monotone mapping T : H 2H is maximal if the graph G(T ) of T is not properly contained in the graph of any other monotone mapping. It is known that a monotone mapping T is maximal if and only if for (x, u) H H , x y, u v 0 for every (y, v) G(T ) implies u T x. Let B be an inverse-strongly monotone mapping of C to H , let NC (v) be the normal cone to C at v C , that is, NC (v) = {w H : v u, w 0 for all u C }, and dene Tv = Bv + NC (v) 0 / if v C , if v / C. (4)

Then T is a maximal monotone and v T 1 0 if and only if v sol(C , B) (see [15]). Now we collect some useful lemmas for proving the convergence results of this paper. Lemma 3 (see [10]) Let C be a nonempty closed convex subset of a real Hilbert space H and h : C R be convex and subdifferentiable on C. Then x is a solution to the following convex problem: min{h(x) : x C } if and only if 0 h(x ) + NC (x ), where NC (x ) is the out normal cone at x to C and h() denotes the subdifferential of g. Lemma 4 (see [11]) Let C be a closed convex subset of a real Hilbert space H and let S : C C be a nonexpansive mapping such that Fix(S) = 0 / . If a sequence {xn } C is such n n n that x z and x Sx 0, then z = Sz. Lemma 5 (see [12]) Assume that A is a strongly positive linear bounded operator on a Hilbert space H with coefcient > 0 and 0 < A 1 , then I A 1 . In the sequel, we also need the following lemma that can be found in the existing literature [20]. Lemma 6 (see [20]) Let {an } be a sequence of non-negative real numbers satisfying the following property: an+1 (1 n )an + n bn , n 0, where {n } (0, 1) and {bn } R such that n=0 n = and lim supn bn 0. Then {an } converges to zero, as n . Now we are in a position to describe the iteration algorithm for nding an element of the set Fix(S) sol(C , B) Sol( f , C ).

A Fixed Point Scheme for Nonexpansive Mappings

Algorithm 1 Choose positive sequences {n } (0, 1); [a, b], 0 < a < b < 2 , 0 < < 1 0 , (0, 1), (0, 2 ), x C , n = 0. Step 1. Solve the following strongly convex problem yn = argmin n f (xn , y) + 1 y xn 2
2

: yC

(5)

and set d (xn ) = xn yn . If d (xn ) = 0 then go to Step 2. Otherwise, set t n = xn and go to Step 3. Step 2. Find the smallest positive integer number mn such that f xn mn d (xn ), yn d (xn ) 2 . Compute t n = PCHn (xn ), where = and go to Step 3. Step 3. Compute zn xn mn d (xn ), vn 2 f (zk , zk ) and Hn = {x H : vn , x zn (7) 0}, (6)

xn+1 = PC n g(xn ) + (I n A)SPC (t n Bt n ) .

(8)

Increase n by 1 and go back to Step 1. We now state and prove the convergence of the proposed iteration method.

3 Convergence Results In this section, we show that the sequences {xn }, {yn } and {t n } dened by Algorithm 1 strongly converge to the common element in a real Hilbert space. Theorem 1 Let H be a real Hilbert space and C be a closed convex subset of H . Let f : C C R be a bifunction satisfying (A1 )(A4 ) and B : C H be a -inverse strongly monotone mapping, let A be a strongly positive linear bounded operator of H into itself with coefcient > 0 such that A = 1 and let g : C C be a contraction with coefcient (0, 1). Assume that 0 < < . Let S be a nonexpansive mapping of C into itself such that = Fix(S) Sol( f , C) sol(C, B) = 0 / . Let the sequences {xn }, {yn }, and {t n } be generated by (5), (7) and (8), where {n } (0, 1), [a, b] for some a, b (0 < a < b < 2 ) and {n } [c, d ], for some c, d (0 < c < d < 1). Suppose that the following conditions are satised
1 (B1 ) limn n = 0, 0 < n < min{1, };

(B2 ) (B3 ) (B4 ) (B5 )

n n 1 = 0; n=1 n = , limn n n=1 |n+1 n | < ; |n+1 n | < ; n=1 If the sequence {xn } is bounded then {vn } is also bounded, where vn 2 f (xn , xn ).

Then the following hold. (i) P (I A + g) is a contraction on C; hence there exists q C such that q = P (I A + g)(q), where P is the metric projection of H onto . (ii) The sequences {xn }, {yn }, and {t n } strongly converge to the same point q Fix(S) sol(C , B) Sol( f , C ).

Pham N. Anh et al.

Proof (i) For any x, y H , we have P (I A + g)(x) P (I A + g)(y) (I A + g)(x) (I A + g)(y) g(x) g(y) + I A x y x y + (1 ) x y = 1 ( ) x y . The Banachs contraction principle guarantees that P (I A + g) has a unique xed point, says q H . That is, q = P (I A + g)(q). By Lemma 1(i), we obtain ( g A)q, x q 0 tn x . (9)

(ii) If there exists n0 such that d (xn ) = 0, i.e., xn = yn for all n n0 , from Step 1, we have = xn . By Rabian Wangkeeree and Pakkapon Preechasilp [17], the sequences {xn }, {yn }, and {t n } strongly converge to the same point q . Now we consider d (xn ) = 0 and divide the proof into several steps. Step 1. If d (xn ) = 0, then there exists the smallest nonnegative integer mn such that f (xn mn d (xn ), yn ) d (xn ) 2 . Indeed, for d (xn ) = 0 and (0, 1), we suppose for contradiction that for every nonnegative integer m, we have f xn m d (xn ), yn + d (xn )
2

> 0.

Passing to the limit of the above inequality as m , by continuity of f , we obtain f xn , yn + d (xn )

2

0.

(10)

On the other hand, since yn is the unique solution of the strongly convex problem min n f (xn , y) + we have 1 y xn 2
2

: y C ,

1 1 y xn 2 n f (xn , yn ) + yn xn 2 2 With y = xn , the last inequality implies

n f (xn , y) +

y C .

n f (xn , yn ) +
Combining (10) with (11), we obtain

1 d (xn )||2 0. 2

(11)

d (xn )

1 d (xn ) 2 . 2n

1 . The rst case contradicts d (xn ) = 0, Hence it must be either d (xn ) = 0 or 2 n 1 while the second one contradicts the fact n 2 > 1. Step 2. We claim that if d (xn ) = 0 then xn / Hn . Indeed, from zn = xn mn d (xn ), it follows that

yn zn =

1 mn n (z xn ). mn

A Fixed Point Scheme for Nonexpansive Mappings

Then using (6) and the assumption f (x, x) = 0 for all x C , we have 0 > d (xn ) Hence xn zn , vn > 0. This implies that xn / Hn . Step 3. We claim that if d (xn ) = 0 then t n = PCHn (y n ), where y n = PHn (xn ). 0 Indeed, for K = {x H : t , x x 0} and t = 0, we know that PK (y) = y Hence y n = PHn (xn ) = xn t , y x0 t. t 2
2

f (zn , yn ) = f (zn , yn ) f (zn, zn ) vn , yn zn =

1 mn n z xn , vn . mn

mn vn , d (xn ) n vn , xn zn n n v = x v . vn 2 vn 2

Otherwise, for every y C Hn there exists (0, 1) such that x = xn + (1 )y C Hn , where

Hn = {x H : vn , x zn = 0}.

From Step 2, it follows that xn C but xn / Hn . Therefore, we have yy n

2

(1 )2 y y n
n

2 2 2 2

n = x x (1 )y n ) = (x y n ) (xn y = x y n x y x y
2

+ 2 xn y n + ,
2

y n , xn y n 2 x (12)

n 2 n 2

x y

n 2

because y n = PHn (xn ). Also we have x xn

2

= x y n + y n xn = x y n = x y
2 n 2 n

2 2

2 x y n , xn y n + y n xn + y x
n 2

Using t n = PCHn (xn ) and the Pythagorean theorem, we can reduce that x y n
2

= x xn

y n xn

t n xn

y n xn

= tn y n 2 .

(13)

From (12) and (13), we have tn y n y y n which means t n = PCHn (y n ). Step 4. We claim that if d (xn ) = 0 then C Hn . y C Hn ,

Pham N. Anh et al.

f (x , x)

Indeed, suppose x , this implies that x Sol( f , C ). Using the denition of x , 0 for all x C and f is pseudomonotone on C , we get f (zn , x ) 0. (14)

It follows from vn 2 f (zn, zn ) that f (zn , x ) = f (zn , x ) f (zn , zn ) vn , x zn . Combining (14) and (15), we have vn , x zn 0. By the denition of Hn , we have x Hn . Thus Sol( f , C ) C Hn , which means C Hn . Step 5. Let wn = PC (t n Bt n ) and x . We claim that if d (xn ) = 0 then the sequences {xn }, {wn } and {t n } are bounded. Indeed, in the case d (xn ) = 0, by Step 3, we have t n = PCHn (y n ), i.e., y n t n , z t n 0 z C Hn , (15)

where y n = PHn (xn ). Substituting z = x Sol( f , C ) C Hn by Step 4, then we have y n t n , x t n 0 which implies that tn y n Hence t n x
2 2

y n t n , x y n + y n t n 0,

tn y n , x y n .

= tn y n + y n x = tn y n = y x
n n 2

2 2

+ y n x
n n

+ 2 tn y n , y n x
2

x y n , t n y n + y n x
2 2

+ 2 tn y n , y n x (16)

+ t y ,y x tn y n 2 .

y x Since zn = xn mn d (xn ) and

y n = PHn (xn ) = xn

vn , xn zn n v , vn 2

A Fixed Point Scheme for Nonexpansive Mappings

we have y n x
2

= xn x = xn x = xn x 2

+ +

vn , xn zn vn 4

vn

2 vn , xn zn n n v , x x vn 2 2 mn vn , d (xn ) n n v , x x vn 2

mn vn , d (xn ) vn

mn
2

mn vn , d (xn ) 2 vn n n mn vn , d (xn ) v , d (x ) n n v , x x n 2 v vn

= xn x 2 mn

mn vn , d (xn ) 2 vn n n v , d (x ) ( vn , xn x mn vn , d (xn ) ) vn 2
2

= xn x = xn x

mn vn , d (xn ) vn mn vn , d (xn ) vn

2 mn vn , d (xn ) n n v , x x mn d (xn ) vn 2 2 mn vn , d (xn ) n n v , z x . vn 2 (17)

It follows from vn 2 f (zn, zn ) that f (zn , y) f (zn, zn ) vn , y zn y C . (18) Replacing y by yn and combining with assumptions f (zn , zn ) = 0 and zn = xn mn d (xn ), we have f (zn , yn ) vn , yn zn = (1 mn ) vn , d (xn ) . Combining this inequality with (6) and assumption (0, 1), we obtain vn , d (xn )

d (xn ) 2 . 1 mn

(19)

Substituting y = x in (18) and using f (zn , zn ) = 0, we have f (zn, x ) vn , x zn . Since f is pseudomonotone on C and f (x , x) 0 x C , we have (20)

f (zn , x ) 0. Combining this with (20), we get 0 vn , x zn . Using (17), (19) and (21), we have y n x
2

(21)

xn x xn x

mn vn , d (xn ) vn mn vn (1 mn )

d (xn ) 4 .

(22)

10

Pham N. Anh et al.

Combining (16) with (22), we obtain t n x

2

xn x

tn y n

mn n v (1 mn )

d (xn ) 4 .

On the other hand, we have I B is a nonexpansive mapping. Indeed, since B is a strongly monotone mapping and 0 < < 2 for all x, y C , we have (I B)x (I B)y
2

= (x y) (Bx By) = xy xy = xy
2 2 2

2 2 2

+ +

2 2

Bx By Bx By

2 x y, Bx By 2 Bx By
2 2

+ ( 2 ) Bx By

x y 2.

Let x , we have wn x = PC (t n Bt n ) PC (x Bx ) t n Bt n (x Bx ) t n x . By Lemma 5, we have xn+1 x = PC n g(xn ) + (I n A)SPC (t n Bt n ) x = PC n g(xn ) + (I n A)Swn x n g(xn ) + (I n A)Swn x = n g(xn ) n Ax + (I n A)Swn Sx + n Ax = n ( g(xn ) Ax ) + I (Swn Sx ) n A(Swn Sx ) = n ( g(xn ) Ax ) + (I n A)(Swn Sx ) n g(xn ) Ax + (1 n ) t n x = n g(xn ) g(x ) Ax + g(x ) + (1 n ) t n x n ( g(xn ) g(x ) + g(x ) Ax ) + (1 n ) xn x n xn x + n g(x ) Ax + (1 n ) xn x g(x ) Ax = (1 n ( )) xn x + n ( ) . ( ) By induction, we get xn x max x1 x , 1 g(x ) Ax ( ) .

Hence {xn } is bounded, and then {wn }, {t n } are also bounded. Step 6. We claim that the sequence {yn } is bounded. Indeed, since yn is the unique solution to min n f (xn , y) + 1 y xn 2
2

: y C ,

A Fixed Point Scheme for Nonexpansive Mappings

11

we have

n f (xn , y) +

1 y xn 2

n f (xn , yn ) +

1 n y xn 2

y C .

With y = xn C and f (xn , xn ) = 0, we have 0 n f (xn , yn ) + 1 n y xn 2 . 2 (23)

By hypothesis, f (xn , ) is convex and subdifferentiable on C , i.e., f (xn , y) f (xn , xn ) un , y xn where un 2 f (xn , xn ). Putting y = yn , we have f (xn , yn ) un , yn xn . Combining this and (23), we obtain y C ,

n un , yn xn +
and so n un Hence

1 n x yn 2

0,

yn xn +

1 n x yn 2

0.

xn yn 2n un < 2 un .

(24)

From the assumption (B4 ) and Step 5, it implies that the sequence {un } is bounded. Then, it follows from (24) that {yn } is bounded. Step 7. We claim that limn xn+1 xn = 0. Indeed, we have wn wn1
2

= PC (t n Bt n ) PC (t n1 Bt n1 ) (t n t n1 ) (Bt n Bt n1 ) = t n t n1 t n t n1 = t n t n1 t n t n1
n 2 2 2 2 2 2 2 2

+ +

2 2

Bt n Bt n1 Bt n Bt n1

2 t n t n1 , Bt n Bt n1 2 Bt n Bt n1
2 2

+ ( 2 ) Bt n Bt n1

= PCHn (y ) PCHn (y n1 ) y n y n1
n 2 2

= PHn (x ) PHn (xn1 ) xn xn1 2 . Hence

wn wn1 xn xn1 .

12

Pham N. Anh et al.

Thus, we have xn+1 xn = PC n g(xn ) + (I n A)Swn PC n1 g(xn1 ) + (I n1 A)Swn1 (n g(xn ) + (I n A)Swn ) n1 g(xn1 ) + (I n1 A)Swn1 = n g(xn ) n g(xn1 ) + n g(xn1 ) n1 g(xn1 ) + (I n A)Swn (I n A)Swn1 + (I n A)Swn1 (I n1 A)Swn1 n xn xn1 + |n n1 | g(xn1 ) + I n A Swn Swn1 + |n n1 | ASwn1 n xn xn1 + (1 n ) wn wn1 +|n n1 |( g(xn1 ) + ASwn1 ) n xn xn1 + (1 n ) xn xn1 +|n n1 |( g(xn1 ) + ASwn1 ) = (1 n ( )) xn xn1 + |n n1 |M ,
|n n1 | n

(25)

), bn := where M = supn0 { g(xn1 ) + ASwn1 }. Applying Lemma 6 for n := n (

and using the assumptions (B1 B3 ), we have limn xn xn1 = 0. Hence limn xn+1 xn = 0. Step 8. We claim that limn xn t n = 0. Indeed, for each x , we have xn+1 x
2

= PC n g(xn ) + (I n A)Swn x n g(xn ) + (I n A)Swn x

n n 2

= n ( g(x ) Ax ) + I (Sw x ) n A(Swn x ) = n ( g(xn ) Ax ) + (I n A)(Swn x )

2 g(xn ) Ax = n 2 n 2 2

(n g(xn ) Ax + (1 n ) Swn x )2 + (1 n )2 Swn x Swn x

2 2 2

+2n (1 n ) g(xn ) Ax =

g(x ) Ax
n

+ (1 n ) Swn x Swn x

+2n (1 n ) g(xn ) Ax +2n (1 n ) g(x ) Ax

n

2 ( g(xn ) g(x ) + g(x ) Ax )2 + (1 n )2 Swn x n

Sw x

2 n

g(x ) g(x )
n

2 + 2n

g(xn ) g(x ) g(x ) Ax

2

2 +n

g(x ) Ax

+ (1 n )2 Swn x Swn x

+2n (1 n ) g(xn ) Ax
2 2 = n g(xn ) g(x ) 2 +n 2

2 g(xn ) g(x ) g(x ) Ax + 2n 2

g(x ) Ax

+ (1 n )2 Swn Sx Swn x

+2n (1 n ) g(xn ) Ax

2 2 2 n n x x 2 + (1 n )2 wn x 2 2 2 g(x ) Ax 2 + 2n g(xn ) g(x ) +n +2n (1 n ) g(xn ) Ax Swn x

g(x ) Ax

A Fixed Point Scheme for Nonexpansive Mappings

2 2 n x x n 2 +n 2 2 n 2

13
2

+ (1 n )2 t n x
2

g(x ) Ax
x x
n 2

+2n (1 n ) g(x ) Ax +(1 n )2 xn x

2 2

2 + 2n g(xn ) g(x ) n n

g(x ) Ax

Sw x
2

tn y n

mn vn (1 mn )

d (xn )

2 +n g(x ) Ax

2 + 2n g(xn ) g(x ) g(x ) Ax

+2n (1 n ) g(xn ) Ax where

2 n = n g(x ) Ax 2

Swn x tn y n
2

2 2 + (1 n )2 ) xn x 2 (1 n )2 ( n n 2 + n , xn x 2 (1 n )2 t n y

+ n

2 + 2n g(xn ) g(x ) g(x ) Ax

+2n (1 n ) g(xn ) Ax It then follows that n ( 1 n ) 2 t n y Hence limn t n y n = 0.

Swn x (1 n )2

vn

mn (1 mn )

d (xn ) 4 .

xn x
n n 2

xn+1 x + n .

,d (x ) , which implies that limn xn y n = 0. On the other hand xn y n 2 = vvn 2 Since xn t n xn y n + t n y n ,

mn

we obtain that limn xn t n = 0. Step 9. We claim that lim xn Sxn = 0. n Indeed, by Steps 7, 8, we have xn+1 x
2 2 g(xn ) Ax n 2 n 2

+ (1 n )2 wn x
n

+2n (1 n ) g(x ) Ax

w x
2

g(x ) Ax
n

+ (1 n ) (I B)t n (I B)x wn x t n x
2 2

+2n (1 n ) g(xn ) Ax
2 g(xn ) Ax n 2

+ ( 1 n ) 2

+ ( 2 ) Bt n Bx

+2n (1 n ) g(xn ) Ax
2 n g(xn ) Ax 2 2 n

wn x
2

+ (1 n )2 t n x wn x

+(1 n ) ( 2 ) Bt Bx +2n (1 n ) g(xn ) Ax

2 n g(xn ) Ax 2 2 n

+ (1 n )2 t n x
2

+(1 n ) a(b 2 ) Bt Bx +2n (1 n ) g(xn ) Ax

2 n

wn x
2 2 2

g(x ) Ax
n

+ (1 n ) xn x wn x .

+(1 n )2 a(b 2 ) Bt n Bx +2n (1 n ) g(xn ) Ax

14

Pham N. Anh et al.

Hence (1 n )2 a(b 2 ) Bt n Bx
2 2 n g(xn ) Ax 2

+ (1 n )2 xn x
n

n+1

x
n

+ 2n (1 n ) g(x )

Ax

w x .

Using (B1 ) and this inequality, we have limn Bt n Bx = 0. On the other hand, by Lemma 1 and Step 7, we have wn x
2

= PC (t n Bt n ) PC (x Bx )

(t n Bt n ) (x Bx ), wn x 1 = ( (t n Bt n ) (x Bx ) 2 + wn x 2 2 (t n Bt n ) (x Bx ) (wn x ) 2 ) 1 ( t n x 2 + wn x 2 (t n wn ) (Bt n Bx ) 2 ) 2 1 n t x 2 + wn x 2 t n wn 2 2 1 2 + (2 t n wn , Bt n Bx Bt n Bx 2 ). 2 Hence wn x

2

t n x

t n wn

+ 2 t n wn , Bt n Bx

Bt n Bx 2 .

From this inequality and Step 8, we have xn+1 x

2 2 n g(xn ) Ax 2 n 2

+ (1 n )2 wn x wn x
2

+2n (1 n ) g(xn ) Ax

g(x ) Ax
n

+ (1 n ) ( t n x
2 n

t n wn

+2 t n wn , Bt n Bx +2n (1 n ) g(x ) Ax
2 n g(xn ) Ax 2

Bt n Bx 2 ) wn x
2

+ (1 n )2 xn x
2

( 1 n ) 2 ( t n w n

+2 (1 n )2 t n wn , Bt n Bx (1 n )2 Bt n Bx 2 ) +2n (1 n ) g(xn ) Ax and hence ( 1 n ) 2 t n w n

2 2 n g(xn ) Ax 2

wn x ,

+ (1 n )2 xn x
2

xn+1 x

2 2

+2 (1 n )2 t n wn , Bt n Bx (1 n )2 Bt n Bx +2n (1 n ) g(xn ) Ax Since n 0 and Bt n Bx 0, we obtain

n

wn x .

lim t n wn = 0.

A Fixed Point Scheme for Nonexpansive Mappings

15

From (8), we have xn+1 Swn = PC (n g(xn ) + (I n A)Swn ) Swn n g(xn ) + (I n A)Swn Swn = n g(xn ) ASwn 0, as n . Since t n St n t n xn + xn xn+1 + xn+1 Swn + Swn St n t n xn + xn xn+1 + xn+1 Swn + wn t n , we obtain that t n St n 0 as n . Moreover, we get wn Swn wn t n + t n St n + St n Swn 2 wn t n + t n St n 0 as n . Since xn wn xn t n + t n wn , it implies that
n

lim xn wn = 0.

Since xn Sxn xn xn+1 + xn+1 Swn + Swn Sxn xn xn+1 + xn+1 Swn + wn xn , we obtain that
n

lim xn Sxn = 0.

Step 10. We claim that lim sup ( g A)q, Swn q 0.

n

(26)

Indeed, we choose a subsequence {wnk } of {wn } such that lim sup ( g A)q, Swn q = lim sup ( g A)q, Swnk q .
n k

Since {wn } is bounded, there exists a subsequence {wnki } of {wnk } which converges weakly to x . Next we show that x . We prove that x Fix(S). We may assume without loss of generality that wnk x . Since wn Swn 0, we obtain Swnk p. Since xn Sxn 0, xn wn 0 and by Lemma 4, we have x Fix(S). We show that x Sol( f , C ). From Steps 7 and 10, we have t nk x , xnk x , ynk x .

Since yn is the unique solution of the convex minimization problem yn = argmin n f (xn , y) + 1 y xn 2
2

: y C ,

16

Pham N. Anh et al.

we have 0 2 n f (xn , y) + It follows that 1 y xn 2

2

(yn ) + NC (yn ).

0 = n z + yn xn + zn ,

where z 2 f (xn , yn ) and zn NC (yn ). By the denition of the normal cone NC (yn ), we get that (27) yn xn , y yn n z, yn y y C . On the other hand, since f (xn , ) is subdifferentiable on C and z 2 f (xn , yn ), we have f (xn , y) f (xn, yn ) z, y yn Combining (27) with (27), we have y C . (28)

n ( f (xn , y) f (xn , yn )) yn xn , yn y
Hence

y C . y C .

nk ( f (xnk , y) f (xnk , ynk )) ynk xnk , ynk y

f (x , y) 0

Thus, using {n } [c, d ], 0 < c < d < 1 and the continuity of f , we have y C .

Hence x Sol( f , C ). We show that x sol(C , B). Let Tv = Bv + NC v, 0 /, v C, v / C,

where NC v is the normal cone to C at v. Then T is a maximal monotone operator. Let (v, u) G(T ). Since u Bv NC v and wn C , we have v yn , u Bv 0. On the other hand, by Lemma 1(iv) and from wn = PC (t n Bt n ), we have v wn , wn (t n Bt n 0, and hence v wn , 1 (wn t n ) + Bt n 0. Therefore, we get

v wnk , u v wnk , Bv v wnk , = v wnk , Bv Bt nk

(wnk t nk ) + Bt nk

1 nk nk (w t ) 1 nk nk (w t )

= v wnk , Bv Bwnk + v wnk , Bwnk Bt nk v wnk , v wnk , Bvnk Bt nk v wnk , 1 nk nk (w t ) .

This implies that v x , u 0 as k . Since T is maximal monotone, we have x T 1 0 and hence x sol(C , B). Therefore we have x . This implies that lim sup ( g A)q, Swn q = lim sup ( g A)q, Swnk q = ( g A)q, x q 0.
n n

A Fixed Point Scheme for Nonexpansive Mappings

17

Step 11. We claim that xn q. Indeed, it follows from Step 2 that xn+1 q
2

= PC (n g(xn ) + (I n A)Swn ) PC (q) n g(x ) + (I n A)Sw q

n n 2 g(xn ) Aq n 2 n g(xn ) Aq 2 2 2

+ I n A

Swn q

+2n (I n A)(Swn q), g(xn ) Aq

2

+ (1 n )2 Swn q
2 2 + n g(xn ) Aq 2

2 A(Swn q), g(xn ) Aq +2n Swn q, g(xn ) Aq 2n

( 1 n ) 2 w n q ( 1 n ) 2 t n q
n

2 A(Swn q), g(xn ) Aq +2n Swn q, g(xn ) Aq 2n 2 2 + n g(xn ) Aq n 2

+2n Sw q, g(x ) g(q) + 2n Swn q, g(q) Aq

2 2n A(Swn q), g(xn ) Aq

(1 n )2 xn q (1 n )2 xn q
n 2

2 + n g(xn ) Aq 2 + n g(xn ) Aq n 2 2n 2

+ 2n wn q xn q + 2n xn q
n 2 2

2 +2n Swn q, g(q) Aq 2n A(Swn q), g(xn ) Aq 2 2

+2n Sw q, g(q) Aq

A(Sw q), g(x ) Aq

n

((1 n ) + 2n ) x q (1 2n ( )) xn q
2

2 + n g(xn ) Aq

2 A(Swn q) g(xn ) Aq +2n Swn q, g(q) Aq + 2n

+ n (n g(xn ) Aq

+ n 2 xn q

+2n A(Swn q) g(xn ) Aq + 2 Swn q, g(q) Aq ). > 0 such that Otherwise {xn }, {g(xn )}, and {Swn } are bounded, we can take a constant M sup{n g(xn ) Aq M
n0 2

+ n 2 xn q

+ 2n A(Swn q) g(xn ) Aq }.

This implies that xn+1 q

2

(1 2n ( )) xn q

+ n n ,

(29)

. From (26), it follows that lim supn n 0. where n = 2 Swn q, g(q) Aq + n M Applying Lemma 6 for (29), we obtain that xn q as n . This completes the proof. From Algorithm 1, we can easily deduce the algorithm for solving the equilibrium problem EP( f , C ) as follows. Algorithm 2 Choose positive sequences {n } (0, 1), [a, b], 0 < a < b < 2 , 0 < < 1 0 , (0, 1), (0, 2 ), x C , n = 0. Step 1. Solve the following strongly convex problem yn = argmin n f (xn , y) + 1 y xn 2
2

: yC

and set d (xn ) = xn yn . If d (xn ) = 0 then go to Step 2. Otherwise, set t n = xn and go to Step 3.

18

Pham N. Anh et al.

Step 2. Find the smallest positive integer number mn such that f (xn mn d (xn ), yn ) d (xn ) 2 . Compute t n = PCHn (xn ), where zn = xn mn d (xn ), vn 2 f (zk , zk ) and Hn = {x H : Increase n by 1 and go back to Step 1, and go to Step 3. Step 3. Compute xn+1 = PC (n g(xn ) + (I n A)(t n )). Increase n by 1 and go back to Step 1. As in Theorem 1, we give a convergent result of Algorithm 2 as the following. Theorem 2 Let H be a real Hilbert space and C be a closed convex subset of H . Let f : C C R be a bifunction satisfying (A1 )(A4 ) and A be a strongly positive linear bounded operator of H into itself with coefcient > 0 such that A = 1. Let g : C C be a contraction with coefcient (0, 1). Assume that 0 < < . Let S be a nonexpansive mapping of C into itself such that Sol( f , C ) = 0 / . Let the sequences {xn }, {yn }, and {t n } be generated by Algorithm 2, where {n } (0, 1), [a, b] for some a, b (0 < a < b < 2 ) and {n } [c, d ] for some c, d (0 < c < d < 1). Suppose that the conditions (B1 )(B5 ) of Theorem 1 are satised. Then the following hold. (i) P (I A + g) is a contraction on C; hence there exists q C such that q = PSol( f ,C) (I A + g)(q), where PSol( f ,C) is the metric projection of H onto Sol( f , C ). (ii) The sequences {xn }, {yn }, and {t n } strongly converge to the same point q Sol( f , C ).
Acknowledgements We are very grateful to two anonymous referees for their really helpful and constructive comments in improving the paper.

vn , x zn 0}.

References
1. Anh, P.N.: A hybrid extragradient method extended to xed point problems and equilibrium problems. Optim. 62, 271283 (2013) 2. Anh, P.N.: Strong convergence theorems for nonexpansive mappings and Ky Fan inequalities. J. Optim. Theory Appl. 154, 303320 (2012) 3. Anh, P.N.: A hybrid extragradient method for pseudomonotone equilibrium problems and xed point problems. Bull. Malays. Math. Sci. Soc. 36, 107116 (2013) 4. Kim, J.K., Anh, P.N., Nam, Y.M.: Strong convergence of an extended extragradient method for equilibrium problems and xed point problems. J. Korean Math. Soc. 49, 187200 (2012) 5. Anh, P.N., Son, D.X.: A new iterative scheme for pseudomonotone equilibrium problems and a nite family of pseudocontractions. J. Appl. Math. Inform. 29, 11791191 (2011) 6. Aoyama, K., Kimura, Y., Takahashi, W., Toyoda, M.: Approximation of common xed points of a countable family of nonexpansive mappings in a Banach space. Nonlinear Anal. 67, 23502360 (2007) 7. Blum, E., Oettli, W.: From optimization and variational inequality to equilibrium problems. Math. Stud. 63, 127149 (1994) 8. Ceng, L.C., Petrus el, A., Yao, J.C.: Iterative approaches to solving equilibrium problems and xed point problems of innitely many nonexpansive mappings. J. Optim. Theory Appl. 143, 3758 (2009) 9. Combettes, P.L., Hirstoaga, S.A.: Equilibrium programming in Hilbert spaces. J. Nonlinear Convex Anal. 6, 117136 (2005) 10. Daniele, P., Giannessi, F., Maugeri, A.: Equilibrium Problems and Variational Models. Springer US (2003)

A Fixed Point Scheme for Nonexpansive Mappings

19

11. Goebel, K., Kirk, W.A.: Topics in Metric Fixed Point Theory. Cambridge Studies in Advanced Mathematics 28. Cambridge University Press, Cambridge (1990) 12. Marino, G., Xu, H.-K.: A general iterative method for nonexpansive mappings in Hilbert spaces. J. Math. Anal. Appl. 318, 4352 (2006) 13. Mastroeni, G.: Gap functions for equilibrium problems. J. Glob. Optim. 27, 411426 (2003) 14. Peng, J.-W., Yao, J.-C.: Some new extragradient-like methods for generalized equilibrium problems, xed point problems and variational inequality problems. Optim. Methods Softw. 25, 677698 (2010) 15. Rockafellar, R.T.: On the maximality of sums of nonlinear monotone operators. Trans. Am. Math. Soc. 149, 7588 (1970) 16. Takahashi, S., Takahashi, W.: Viscosity approximation methods for equilibrium problems and xed point problems in Hilbert spaces. J. Math. Anal. Appl. 331, 506515 (2007) 17. Wangkeeree, R., Preechasilp, P.: A new iterative scheme for solving the equilibrium problems, variational inequality problems, and xed point problems in Hilbert spaces. J. Appl. Math., 154968 (2012), 21 pp. doi:10.1155/2012/154968 18. Wang, S., Cho, Y.J., Qin, X.: A new iterative method for solving equilibrium problems and xed point problems for an innite family of nonexpansive mappings. Fixed Point Theory Appl. (2010). doi: 10.1155/2010/165098 19. Wang, S., Guo, B.: New iterative scheme with nonexpansive mappings for equilibrium problems and variational inequality problems in Hilbert spaces. J. Comput. Appl. Math. 233, 26202630 (2010) 20. Xu, H.K.: An iterative approach to quadratic optimization. J. Optim. Theory Appl. 116, 659678 (2003)