• No results found

Some extragradient methods for common solutions of generalized equilibrium problems and fixed points of nonexpansive mappings

N/A
N/A
Protected

Academic year: 2020

Share "Some extragradient methods for common solutions of generalized equilibrium problems and fixed points of nonexpansive mappings"

Copied!
19
0
0

Loading.... (view fulltext now)

Full text

(1)

R E S E A R C H

Open Access

Some extragradient methods for common

solutions of generalized equilibrium problems

and fixed points of nonexpansive mappings

Jian-Wen Peng

Correspondence: jwpeng6@yahoo. com.cn

School of Mathematics, Chongqing Normal University, Chongqing 400047, PR China

Abstract

In this article, we introduce some new iterative schemes based on the extragradient method (and the hybrid method) for finding a common element of the set of solutions of a generalized equilibrium problem, and the set of fixed points of a family of infinitely nonexpansive mappings and the set of solutions of the variational inequality for a monotone, Lipschitz-continuous mapping in Hilbert spaces. We obtain some strong convergence theorems and weak convergence theorems. The results in this article generalize, improve, and unify some well-known convergence theorems in the literature.

Keywords:Generalized equilibrium problem, Extragradient method, Hybrid method, Nonex-pansive mapping, Strong convergence, Weak convergence

1. Introduction

LetHbe a real Hilbert space with inner product〈.,.〉and induced norm ||·||. Let Cbe a nonempty closed convex subset ofH. LetFbe a bifunction fromC × C toRand let

B:C ®Hbe a nonlinear mapping, where Ris the set of real numbers. Moudafi [1], Moudafi and Thera [2], Peng and Yao [3,4], Takahashi and Takahashi [5] considered the following generalized equilibrium problem:

FindxCSuch thatF(x,y) +Bx,yx ≥0,∀y∈C. (1:1)

The set of solutions of (1.1) is denoted byGEP(F,B). IfB= 0, the generalized equili-brium problem (1.1) becomes the equiliequili-brium problem forF:C × C ®R, which is to findxÎCsuch that

F(x,y)≥0 for allyC. (1:2)

The set of solutions of (1.2) is denoted byEP(F).

The problem (1.1) is very general in the sense that it includes, as special cases, opti-mization problems, variational inequalities, minimax problems, Nash equilibrium pro-blem in noncooperative games, and others; see for instance [1-7].

Recall that a mappingS: C®Cis nonexpansive if there holds that

||Sx−Sy|| ≤ ||xy|| for allx,yC.

We denote the set of fixed points ofSby Fix(S).

(2)

Let the mapping A: C® H be monotone andk-Lipschitz-continuous. The varia-tional inequality problem is to findxÎCsuch that

Ax,yx ≥0

for allyÎ C. The set of solutions of the variational inequality problem is denoted by

V I(C,A).

Several algorithms have been proposed for finding the solution of problem (1.1). Mou-dafi [1] introduced an iterative scheme for finding a common element of the set of solu-tions of problem (1.1) and the set of fixed points of a nonexpansive mapping in a Hilbert space, and proved a weak convergence theorem. Moudafi and Thera [2] introduced an auxiliary scheme for finding a solution of problem (1.1) in a Hilbert space and obtained a weak convergence theorem. Peng and Yao [3,4] introduced some iterative schemes for finding a common element of the set of solutions of problem (1.1), the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality for a monotone, Lipschitz-continuous mapping and obtain both strong convergence theorems, and weak convergence theorems for the sequences generated by the corresponding pro-cesses in Hilbert spaces. Takahashi and Takahashi [5] introduced an iterative scheme for finding a common element of the set of solutions of problem (1.1) and the set of fixed points of a nonexpansive mapping in a Hilbert space, and proved a strong convergence theorem.

(3)

and the set of fixed points of a family of finitely nonexpansive mappings in a Hilbert space. We observe that the algorithms in [13-16] involves the W-mapping generated by a family of infinitely (finitely) nonexpansive mappings which is an effective tool in nonlinear analysis (see [20,21]). However, theW-mapping generated by a family of infi-nitely (fiinfi-nitely) nonexpansive mappings is too completed to use for finding the com-mon element of the set of solutions of problem (1.2) and the set of fixed points of a family of infinitely (finitely) nonexpansive mappings. It is natural to raise and to give an answer to the following question: Can one construct algorithms for finding a com-mon element of the set of solutions of a generalized equilibrium problem (an equili-brium problem), the common set of fixed points of a family of infinitely nonexpansive mappings and the set of solutions of a variational inequality without theW-mapping generated by a family of infinitely (finitely) nonexpansive mappings? In this article, we will give a positive answer to this question.

Recently, OHaraa et al. [22] introduced and researched an iterative approach for finding a nearest point of infinitely many nonexpansive mappings in a Hilbert spaces without using theW-mapping generated by a family of infinitely (finitely) nonexpansive mappings. Inspired by the ideas in [1-6,8-16,22] and the references therein, we intro-duce some new iterative schemes based on the extragradient method (and the hybrid method) for finding a common element of the set of solutions of a generalized equili-brium problem, the set of fixed points of a family of infinitely nonexpansive mappings, and the set of solutions of the variational inequality for a monotone, Lipschitz– contin-uous mapping without using the W-mapping generated by a family of infinitely (finitely) nonexpansive mappings. We obtain both strong convergence theorems and weak convergence theorems for the sequences generated by the corresponding pro-cesses. The results in this article generalize, improve, and unify some well-known con-vergence theorems in the literature.

2. Preliminaries

LetHbe a real Hilbert space with inner product〈·,·〉and norm ||·||. LetCbe a none-mpty closed convex subset of H. Let symbols® and⇀ denote strong and weak con-vergences, respectively. In a real Hilbert spaceH, it is well known that

λx+ (1−λ)y2=λx2+ (1−λ)y2−λ(1−λ)xy2

for all x,yÎHandlÎ[0, 1].

For anyx Î H, there exists the unique nearest point inC, denoted by PC(x), such

that ||x - PC(x)||≤||x - y|| for ally ÎC. The mapping PCis called the metric

projec-tion of HontoC. We know that PC is a nonexpansive mapping from HontoC. It is

also known thatPCxÎCand

xPC(x),PC(x)−y ≥0 (2:1)

for all xÎHandyÎC.

It is easy to see that (2.1) is equivalent to xy2≥xPC(x)

2

+yPC(x)

2

(2:2)

(4)

A mapping AofCintoHis called monotone if

AxAy,xy ≥0

for allx,y Î C. A mappingA ofCintoHis called a-inverse-strongly monotone if there exists a positive real numberasuch that

xy,AxAyαAxAy2

for all x,yÎC. A mappingA:C®His called k-Lipschitz-continuous if there exists a positive real numberksuch that

AxAykxy

for all x, yÎ C. It is easy to see that ifAisa-inverse-strongly monotone, thenAis monotone and Lipschitz-continuous. The converse is not true in general. The class of a-inverse-strongly monotone mappings does not contain some important classes of mappings even in a finite-dimensional case. For example, if the matrix in the corre-sponding linear complementarity problem is positively semidefinite, but not positively definite, then the mapping Awill be monotone and Lipschitz-continuous, but not a-inverse-strongly monotone (see [23]).

Let Abe a monotone mapping ofCintoH. In the context of the variational inequal-ity problem, the characterization of projection (2.1) implies the following:

uVI(C,A)u=PC(u−λAu), λ >0.

and

u=PC(u−λAu) for someλ >0⇒uVI(C,A).

It is also known thatHsatisfies the Opial’s condition [24], i.e., for any sequence {xn}

⊂Hwithxn⇀ x, the inequality

lim inf

n→∞ xnx<lim infn→∞ xny

holds for everyyÎ Hwithx≠y.

A set-valued mappingT:H®2His called monotone if for allx,yÎH,fÎTxandgÎ Tyimply〈x - y,f - g〉≥0. A monotone mappingT:H®2His maximal if its graphG(T) ofTis not properly contained in the graph of any other monotone mapping. It is known that a monotone mappingTis maximal if and only if for (x,f)ÎH×H,〈x - y,f - g〉≥0 for every (y,g)ÎG(T) implies fÎ Tx. Let A be a monotone,k-Lipschitz-continuous mapping ofCintoHandNCvbe normal cone toCatvÎC, i.e.,NCv= {wÎH:〈v - u,

w〉≥0,∀uÎC}. Define

Tv=

Av+NCvifvC,

∅ ifv∈/ C.

Then, Tis maximal monotone and 0Î Tvif and only ifvÎV I(C,A) (see [25]). For solving the equilibrium problem, let us assume that the bifunctionFsatisfies the following condition:

(A1)F(x, x) = 0 for allxÎC;

(5)

(A3) for eachx,y,zÎ C,

lim

t↓0F(tz+ (1−t)x,y)F(x,y);

(A4) for eachxÎC,y↦F(x,y) is convex and lower semicontinuous.

We recall some lemmas which will be needed in the rest of this article.

Lemma 2.1.[7] LetCbe a nonempty closed convex subset ofH, letFbe a bifunction from

C × CtoRsatisfying (A1)-(A4). Letr >0 andxÎH. Then, there existszÎCsuch that

F(z,y) +1

ryz,zx ≥0, for allyC.

Lemma 2.2.[8] LetCbe a nonempty closed convex subset ofH, letFbe a bi-func-tion fromC × C toRsatisfying (A1)-(A4). Forr >0 andxÎ H, define a mappingTr:

H®Cas follows:

Tr(x) ={zC:F(z,y) +

1

ryz,zx ≥0,∀yC}

for all xÎH. Then, the following statements hold: (1)Tris single-valued;

(2)Tris firmly nonexpansive, i.e., for any x,yÎH,

Tr(x)−Tr(y)2≤ Tr(x)−Tr(y),xy;

(3)F(Tr) =EP(F);

(4)EP(F) is closed and convex.

3. The main results

We first show a strong convergence of an iterative algorithm based on extragradient and hybrid methods which solves the problem of finding a common element of the set of solutions of a generalized equilibrium problem, the set of fixed points of a family of infinitely nonexpansive mappings, and the set of solutions of the variational inequality for a monotone, Lipschitz-continuous mapping in a Hilbert space.

Theorem 3.1. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. LetFbe a bifunction from C × Cto Rsatisfying (A1)-(A4). LetAbe a monotone and

k-Lipschitz-continuous mapping ofCintoHandBbe ana-inverse-strongly monotone mapping ofCintoH. LetS1,S2,... be a family of infinitely nonexpansive mappings of C

into itself such that=∩∞i=1Fix(Si)∩VI(C,A)∩GEP(F,B)=∅. Assume that for alliÎ

{1, 2,...} and for any bounded subsetKofC, thenthere holds

lim

n→∞supxK||

SnxSi(Snx)|| = 0. ()

Let {xn}, {un}, {yn} and {zn} be sequences generated by

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

x1=xC,

F(un,y) +Bxn,yun+

1 rn

yun,unxn ≥0, ∀yC,

yn= (1−γn)un+γnPC(unλnAun),

zn= (1−αnβn)xn+αnyn+βnSnPC(unλnAyn),

Cn={z∈C:||znz||2 ≤ ||xnz||2+ (3−3γn+αn)b2||Aun||2},

Qn={z∈C:xnz,xxn ≥0},

xn+1=PCnQnx

(6)

for every n= 1, 2,... where {ln}⊂[a,b] for somea,b∈(0,

1

4k), {rn}⊂[d,e] for some

d,eÎ (0, 2a), and {an}, {bn}, {gn} are three sequences in [0, 1] satisfying the conditions:

(i)an+bn≤1 for allnÎN;

(ii)nlim→∞αn= 0; (iii)lim infn→∞ βn>0; (iv)nlim→∞γn= 1andγn>

3

4for all nÎN;

Then, {xn}, {un}, {yn} and {zn} converge strongly tow=PΩ(x).

Proof. It is obvious thatCnis closed, and Qnis closed and convex for every n= 1,

2,.... Since

Cn={zH:znxn2+ 2znxn,xnz ≤(3−3γn+αn)b2Aun2},

we also have that Cn is convex for everyn= 1, 2,.... It is easy to see that〈xn- z,x

-xn〉≥0 for allzÎ Qn and by (2.1),xn=PQnx. Let tn=PC(un -lnAyn) for everyn= 1, 2,.... Let u Î Ω and let{Trn}>be a sequence of mappings defined as in Lemma 2.2. Then u=PC(u−λnAu) =Trn(u−rnBu). From un=Trn(xnrnBxn)∈C and the a-inverse strongly monotonicity ofB, we have

unu2=Trn(xnrnBxn)−Trn(u−rnBu) 2

xnrnBxn−(u−rnBu)

2

xnu2−2rnxnu,BxnBu+r2nBxnBu2

xnu2−2rnαBxnBu2+rn2BxnBu2

=xnu2+rn(rn−2α)BxnBu2

xnu2.

(3:2)

From (2.2), the monotonicity of A, anduÎV I(C,A), we have

tnu2≤unλnAynu 2

unλnAyntn 2

=unu2− untn2+ 2λnAyn,utn

=unu2− untn2+ 2λn(AynAu,uyn+Au,uyn+Ayn,yntn)

≤ unu2− untn2+ 2λnAyn,yntn

≤ unu2−unyn 2

−2unyn,yntnyntn 2

+ 2λnAyn,yntn

=unu2−unyn 2

yntn 2

+ 2unλnAynyn,tnyn.

Further, Since yn= (1-gn)un+gnPC(un-lnAun) andAisk-Lipschitz-continuous, we

have

unλnAynyn,tnyn

=unλnAunyn,tnyn+λnAunλnAyn,tnyn

unλnAun−(1−γn)unγnPC(unλnAun),tnyn+λnAunAyntnyn

(7)

In addition, from the definition ofPC, we have

unλnAunPC(unλnAun),tnyn

=unλnAunPC(unλnAun),tn−(1−γn)unγnPC(unλnAun)

= (1−γn)unλnAunPC(unλnAun),tnun

+γnunλnAunPC(unλnAun),tnPC(unλnAun)

≤(1−γn)unλnAunPC(unλnAun)tnun

≤(1−γn)λnunAunun(tnyn+ynun)

≤(1−γn)λnAun(tnyn+ynun).

It follows fromb< 41k,γn>

3

4and (3.2) that

tnu2≤ unu2−unyn 2

yntn 2

+ 2γn(1−γn)bAun(tnyn+ynun)

+2(1−γn)bAuntnyn+ 2bkunyntnyn

unu2−unyn2−yntn2+ (1−γn)(2b2Aun2+tnyn2+ynun2)

+(1−γn)(b2Aun2+tnyn 2

) +bk(unyn 2

+tnyn 2

)

=unu2−(γnbk)unyn2+ (1−2γn+bk)tnyn2+ 3(1−γn)b2Aun2 ≤ unu2+ 3(1−γn)b2Aun2

xnu2+ 3(1−γn)b2Aun2.

(3:3)

In addition, fromuÎV I(C,A) and (3.2), we have ynu

2

=(1−γn)(unu) +γn(PC(unλnAun)−u)

2

≤(1−γn)unu2+γnPC(unλnAun)−PC(u)2

≤(1−γn)unu2+γnunλnAunu2

≤(1−γn)unu2+γn[unu2−2λnAun,unu+λ2nAun2]

unu2+b2Aun2

xnu2+b2Aun2.

(3:4)

Therefore, from (3.2) to (3.4) andzn= (1-an -bn)xn+anyn+bnSntn andu=Snu,

we have

znu2=(1−αnβn)xn+αnyn+βnSntnu2

≤(1−αnβn)xnu2+αnynu

2

+βnSntnu2

≤(1−αnβn)xnu2+αnynu2+βntnu2

≤(1−αnβn)xnu2+αn[unu2+b2Aun2]

+βn[unu2+ 3(1−γn)b2Aun2]

xnu2+ (3−3γn+αn)b2Aun2],

(3:5)

for everyn= 1, 2,... and hence uÎCn. So,Ω⊂Cnfor everyn= 1, 2,.... Next, let us

show by mathematical induction that xnis well defined and Ω⊂Cn ∩Qnfor every n

= 1, 2,.... For n = 1 we havex1 =xÎ Cand Q1=C. Hence, we obtainΩ ⊂C1 ∩ Q1.

Suppose thatxkis given andΩ⊂Ck∩Qkfor somekÎN. SinceΩis nonempty,Ck∩

Qkis a nonempty closed convex subset ofH. Hence, there exists a unique elementxk+1

Î Ck∩ Qk such thatxk+1=PCkQkx. It is also obvious that there holds〈xk+1- z,x -xk

+1〉≥0 for everyz ÎCk ∩Qk. SinceΩ⊂Ck ∩Qk, we have〈xk+1- z,x -xk+1〉≥0 for

(8)

Let l0=PΩx. Fromxn+1=PCnQnx andl0 vΩ⊂Cn∩Qn, we have

xn+1−x ≤ l0−x (3:6)

for everyn= 1, 2,.... Therefore, {xn} is bounded. From (3.2) to (3.5) and the lipschitz

continuity of A, we also obtain that {un}, {yn}, {Aun}, {tn} and {zn} are bounded. Since

xn+1Î Cn∩Qn⊂Cnand xn=PQnx, we have xnxxn+1−x

for everyn= 1, 2,.... It follows from (3.6) that limn®∞||xn- x|| exists.

Since xn=PQnx andxn+1ÎQn, using (2.2), we have

xn+1−xn2≤ xn+1−x2− xnx2

for everyn= 1, 2,.... This implies that

lim

n→∞xn+1−xn= 0.

Sincexn+1ÎCn, we have ||zn-xn+1||2≤||xn-xn+1||2+ (3 - 3gn+an)b2||Aun||2and

hence it follows from limn®∞gn= 1 and limn®∞an= 0 that limn®∞||zn-xn+1|| = 0. Since

||xnzn|| ≤ ||xnxn+1||+||xn+1−zn||

for everyn= 1, 2,..., we have ||xn- zn||®0.

ForuÎΩ, from (3.5), we obtain

||znu||2− ||xnu||2

≤(−αnβn)||xnu||2+ αn||ynu||2+ βn||Sntnu||2

≤(3−3γn+αn)b2||Aun||2.

Since limn®∞ gn= 1 and limn®∞ an= 0, {xn}, {yn}, {Aun}, and {zn} are bounded, we

have

lim

n→∞βn(||Sntnu||

2− ||x

nu||2) = 0.

By lim infn®∞bn> 0, we get

lim

n→∞||Sntnu||

2− ||x

nu||2= 0.

From (3.3) and u=Snu, we have

lim

n→∞||Sntnu|| 2− ||x

nu||2 ≤ lim

n→∞||tnu|| 2− ||x

nu||2

≤ lim

n→∞3(1−γn)b 2||Au

n||2= 0.

Thus, limn®∞||tn- u||2 -||xn- u||2 = 0.

From (3.3) and (3.2), we have

(γnbk)||unyn||2+ (2γn−1−bk)||tnyn||2

≤ ||xnu||2− ||tnu||2+ 3(1−γn)b2||Aun||2.

It follows that

lim

n→∞(γnbk)||unyn|| 2+ (2γ

(9)

The assumptions ongnand lnimply thatγnbk>

1

2and2γn−1−bk> 1

4. Conse-quently, limn®∞||un- yn|| = limn®∞ ||tn- yn|| = 0. SinceA is Lipschitz-continuous,

we have limn®∞||Atn- Ayn|| = 0. It follows from ||un- tn||≤ ||un- yn|| + ||tn - yn||

that limn®∞||un- tn|| = 0.

We rewrite the definition of znas

znxn=αn(ynxn) +βn(Sntnxn).

From limn®∞ ||zn - xn|| = 0, limn®∞an= 0, the boundedness of {xn}, {yn} and lim

infn®∞bn> 0 we infer that limn®∞||Sntn-xn|| = 0.

By (3.2)-(3.5), we have

||znu||2≤(1−αnβn)||xnu||2+αn[||unu||2+b2||Aun||2] +βn[||unu||2+ 3(1−γn)b2||Aun||2] ≤(1−αnβn)||xnu||2+αn[||xnu||2+rn(rn−2α)||BxnBu||2+b2||Aun||2]

+βn[||xnu||2+rn(rn−2α)||BxnBu||2+ 3(1−γn)b2||Aun||2] ≤ ||xnu||2+ (αn+βn)rn(rn−2α)||BxnBu||2+ (3βn−3βnγn+αn)b2||Aun||2].

(3:7)

Hence, we have

(αn+βn)d(2αe)||BxnBu||2

≤(αn+βn)rn(2αrn)||BxnBu||2

≤ ||xnu||2− ||znu||2+ (3βn−3βnγn+αn)b2||Aun||2

≤(||xnu||+||znu||)||xnzn||+ (3βn−3βnγn+αn)b2||Aun||2.

Since limn®∞ an = 1, lim infn®∞ bn> 0, limn®∞ gn= 1, ||xn - zn|| ® 0 and the

sequences {xn} and {zn} are bounded, we obtain ||Bxn- Bu||®0.

ForuÎΩ, we have, from Lemma 2.2,

||unu||2= ||Trn(xnrnBxn)Trn(urnBu)||2 ≤ Trn(xnrnBxn)−Trn(urnBu),xnrnBxn−(urnBu)

=1

2{||unu|| 2+||x

nrnBxn−(urnBu)||2− ||xnrnBxn−(urnBu)−(unu)||2}

≤1

2{||unu|| 2+||x

nu||2− ||xnrnBxn−(urnBu)−(unu)||2}

=1

2{||unu|| 2+||x

nu||2− ||xnun||2+ 2rnBxnBu,xnun −rn2||BxnBu||2}.

Hence,

||unu||2 ≤ ||xnu||2− ||xnun||2+ 2rnBxnBu,xnunrn2||BxnBu||2

≤ ||xnu||2− ||xnun||2+ 2rnBxnBu,xnun.

Then, by (3.5), we have

||znu||2 ≤(1−αnβn)||xnu||2+αn[||unu||2+b2||Aun||2] +βn[||unu||2+ 3(1−γn)b2||Aun||2] ≤(1−αnβn)||xnu||2+αn[(||xnu||2− ||xnun||2+ 2rnBxnBu,xnun) +b2||Aun||2]

+βn[(||xnu||2− ||xnun||2+ 2rnBxnBu,xnun) + 3(1−γn)b2||Aun||2]

≤ ||xnu||2+ (−αnβn)||xnun||2+ 2rn(αn+βn)||BxnBu|| ||xnun||+ (3βn−3βnγn+αn)b2||Aun||2

Hence,

(αn+βn)||xnun||2 ≤ ||xnu||2− ||znu||2+ 2rn(αn+βn)||BxnBu|| ||xnun||+ (3βn3βnγn+αn)b2||Aun||2 ≤(||xnu||+||znu||)||xnzn||+ 2rn(αn+βn)||BxnBu|| ||xnun||+ (3βn−3βnγn+αn)b2||Aun||2.

Since limn®∞an= 0, lim infn®∞bn> 0, limn®∞gn= 1, ||xn-zn||®0, ||Bxn-Bu||®0

and the sequences {xn}, {un} and {zn} are bounded, we obtain ||xn-un||®0. From ||zn

(10)

From ||tn- xn||≤||tn- un|| + ||xn- un||, we also have ||tn- xn||®0.

Since zn= (1 -an -bn)xn +anyn+bnSntn, we have bn(Sntn- tn) = (1-an-bn)(tn

-xn) + an(tn- yn) + (zn- tn). Then

βn||Sntntn|| ≤(1−αnβn)||tnxn||+ αn||tnyn||+||zntn||

and hence ||Sntn- tn||®0. At the same time, observe that for alliÎ{1, 2,...},

||Sitntn|| ≤ ||SitnSi(Sntn)||+||Si(Sntn)−Sntn|| ||+||Sntntn||.

≤2||Sntntn||+ sup xK

||Si(Snx)Snx||.

It follows from (3.8) and the condition (*) that for all iÎ{1, 2,...},

lim

n→∞||Sitntn||= 0. (3:9)

As {xn} is bounded, there exists a subsequence{xni}of {xn} such thatxni⇀w. From ||

xn- un||® 0, we obtain thatuni⇀ w. From ||un- tn||® 0, we also obtain thattni⇀

w. Since {uni}⊂CandCis closed and convex, we obtainwÎC.

First, we show wÎGEP(F,B). Byun=Trn(xnrnBxn)∈C, we know that

F(un,y) +Bxn,yun+

1

rnyun,unxn ≥0, ∀yC.

It follows from (A2) that

Bxn,yun+

1 rny−

un,unxnF(y,un),∀y∈C.

Hence,

Bxni,yuni+yuni,

unixni rni

F(y,uni),∀yC. (3:10)

For t with 0< t ≤1 and y Î C, letyt=ty + (1- t)w. Sincey Î Cand wÎ C, we

obtain ytÎC. So, from (3.10) we have

ytuni,Byt ≥ ytuni,Byt − ytuni,Bxni − ytuni,

unixni rni

+F(yt,uni)

=ytuni,BytBuni+ytuni,BuniBxni

ytuni,

unixni rni

+F(yt,uni).

Since||unixni|| →0, we have||BuniBxni|| →0. Further, from the inverse-strongly

monotonicity of B, we haveytuni,BytBuni ≥0. Hence, from (A4),

unixni rni →0

anduni w, we have

ytw,BytF(yt,w), (3:11)

asi® ∞. From (A1), (A4) and (3.11), we also have

0 =F(yt,yt)≤tF(yt,y) + (1t)F(yt,w)

tF(yt,y) + (1t)ytw,Byt

(11)

and hence

0≤F(yt,y) + (1t)yw,Byt.

Lettingt®0, we have, for eachyÎ C,

F(w,y) +yw,Bw ≥0.

This implies that wÎGEP(F,B).

We next show that w∈ ∩∞i=1Fix(Si). Assume w∈ ∩/ ∞i=1Fix(Si). Since tniw and w=Si0wfor somei0Î {1, 2,...} from the Opial condition, we have

lim inf

i→∞ ||tniw|| <lim infi→∞ ||tniSi0w||

≤lim inf

i→∞ {||tniSi0tni||+||Si0tniSi0w||}

≤lim inf

i→∞ ||tniw||.

This is a contradiction. Hence, we get w∈ ∩∞i=1Fix(Si).

Finally we show wÎ V I(C, A). Let

Tv=

Av+NCvifvC,

∅ ifvC.

whereNCvis the normal cone toCatvÎC. We have already mentioned that in this

case the mappingTis maximal monotone, and 0ÎTvif and only ifvÎV I(C,A). Let (v,g)ÎG(T). ThenTv=Av+NCvand henceg - Av ÎNCv.

Hence, we have 〈v - t,g - Av〉≥0 for alltÎC. On the other hand, fromtn=PC(un

-lnAyn) andvÎC, we have

unλnAyntn,tnv ≥0

and hence

v−tn,

tnun λn

+Ayn ≥0.

Therefore, we have

v−tni,g ≥ v−tni,Av

≥ v−tni,Av − vtni, tniuni

λni

+Ayni

=v−tni,AvAyni

tniuni λni

=v−tni,AvAtni+AtniAyni

tniuni λni

=vtni,AvAtni+vtni,AtniAynivtni,

tniuni λni

vtni,AtniAynivtni, tniuni

λni

Hence, we obtain〈v - w,g〉≥ 0 asi ®∞. Since Tis maximal monotone, we have w

(12)

Froml0 =PΩx,wÎ Ωand (3.6), we have

||l0−x|| ≤ ||wx|| ≤lim inf

i→∞ ||xnix|| ≤lim sup

i→∞ ||xnix|| ≤ ||l0−x||.

Hence, we obtain

lim

i→∞||xnix|| = ||wx||.

From xnixwx, we have xnixwx, and hencexniw. Sincexn=PQnx and l0Î Ω⊂Cn∩Qn⊂Qn, we have

−||l0−xni|| 2l

0−xni,xnix+l0−xni,xl0 ≥ l0−xni,xl0.

Asi®∞, we obtain-||l0- w||2≥〈l0- w,x - l0〉≥0 byl0=PΩxandwÎΩ. Hence, we have w=l0. This implies thatxn® l0. It is easy to seeun® l0,yn®l0 andzn®

l0. The proof is now complete.

By combining the arguments in the proof of Theorem 3.1 and those in the proof of Theorem 3.1 in [3], we can easily obtain the following weak convergence theorem for an iterative algorithm based on the extragradient method which solves the problem of finding a common element of the set of solutions of a generalized equilibrium pro-blem, the set of fixed points of a family of infinitely nonexpansive mappings and the set of solutions of the variational inequality for a monotone, Lipschitz-continuous mapping in a Hilbert space.

Theorem 3.2. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. LetFbe a bifunction fromC × Cto Rsatisfying (A1)-(A4). LetAbe a monotone, and

k-Lipschitz-continuous mapping ofCintoHandBbe ana-inverse-strongly monotone mapping ofCintoH. LetS1,S2,... be a family of infinitely nonexpansive mappings of C

into itself such that=∩∞i=1Fix(Si)∩VI(C,A)∩GEP(F,B)=∅. Assume that for alliÎ

{1, 2,...} and for any bounded subsetKofC, thenthere holds

lim

n→∞supxK||

SnxSi(Snx)||= 0. ()

Let {xn}, {un} and {yn} be the sequences generated by

⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩

x1=xC,

F(un,y) +Bxn,yun+

1 rn

yun,unxn ≥0, ∀yC,

yn=PC(unλnAun),

xn+1=βnxn+ (1−βn)SnPC(unλnAyn)

(3:12)

for everyn= 1, 2,.... If {ln}⊂[a,b] for somea,b∈(0,1k), {bn}⊂[δ,ε] for someδ,ε

Î (0, 1) and {rn}⊂[d,e] for some d, eÎ (0, 2a). Then, {xn}, {un} and {yn} converge

weakly to wÎ Ω, wherew= limn®∞PΩxn.

4. Applications

By Theorems 3.1 and 3.2, we can obtain many new and interesting convergence theo-rems in a real Hilbert space. We give some examples as follows:

Let A= 0, by Theorems 3.1 and 3.2, respectively, we obtain the following results.

(13)

nonexpansive mappings of C into itself such that =∩∞i=1Fix(Si)∩GEP(F,B)=∅.

Assume that for alliÎ{1, 2,...} and for any bounded subsetKofC, thenthere holds

lim

n→∞supxK||SnxSi(Snx)|| = 0. ()

Let {xn}, {un} {yn}, and {zn} be the sequences generated by

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

x1=xC,

F(un,y) +Bxn,yun+

1 rn

yun,unxn ≥0, ∀yC,

zn= (1−αnβn)xn+αnun+βnSnun,

Cn={zC:||znz||2≤ ||xnz||2},

Qn={zC:xnz,xxn ≥0},

xn+1=PCnQnx

for every n= 1, 2,.... where {rn}⊂[d, e] for somed, e Î(0, 2a), and {an}, {bn} are

sequences in [0, 1] satisfying the conditions:

(i)an+bn≤1 for allnÎN;

(ii)nlim→∞αn= 0;

(iii)lim infn→∞ βn>0for allnÎN;

Then, {xn}, {un}, and {zn} converge strongly tow=P∑(x).

Theorem 4.2. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. Let F be a bifunction fromC×C to Rsatisfying (A1)-(A4). Let B be an a-inverse-strongly monotone mapping of CintoH. LetS1, S2,... be a family of infinitely

nonex-pansive mappings of Cinto itself such that =∩∞i=1Fix(Si)∩GEP(F,B)=∅. Assume

that for all iÎ{1, 2,...} and for any bounded subsetKofC, thenthere holds

lim

n→∞supxK||SnxSi(Snx)||= 0. ()

Let {xn} and {un} be sequences generated by

⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩

x1=xC,

F(un,y) +Bxn,yun+

1 rn

yun,unxn ≥0, ∀yC,

xn+1=βnxn+ (1−βn)Snun

for every n= 1, 2,.... If {bn}⊂[δ,ε] for someδ,εÎ (0, 1) and {rn}⊂[d,e] for some

d,eÎ (0, 2a). Then, {xn} and {un} converge weakly towÎ∑, wherew= limn®∞P∑xn.

Theorem 4.3. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. Let Fbe a bifunction fromC×C toRsatisfying (A1)-(A4). LetAbe a monotone andk -Lipschitz-continuous mapping of CintoHandBbe an a-inverse-strongly monotone mapping ofCintoH. LetS1,S2,... be a family of infinitely nonexpansive mappings of C

into itself such that=∩∞i=1Fix(Si)∩VI(C,A)∩GEP(F,B)=∅. Assume that for alliÎ

{1, 2,...} and for any bounded subsetKofC, thenthere holds

lim

n→∞supxK||

(14)

Let {xn}, {un}, {yn}, and {zn} be sequences generated by

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

x1=xC,

F(un,y) +Bxn,yun+r1nyun,unxn ≥0, ∀yC,

yn=PC(unλnAun),

zn= (1−βn)xn+βnSnPC(unλnAyn),

Cn={zC:||znz||2≤ ||xnz||2,

Qn={zC:xnz,xxn ≥0},

xn+1=PCnQnx

for every n= 1, 2,... where {ln}⊂[a,b] for somea,b∈(0,

1

4k), {rn}⊂[d,e] for some

d, e Î (0, 2a), and {bn} is a sequence in [0, 1] satisfyinglim infn→∞ βn>0. Then, {xn},

{un}, {yn}, and {zn} converge strongly tow=PΩ(x).

Proof. Puttinggn= 1 andan= 0, by Theorem 3.1, we obtain the desired result.

Let B= 0, by Theorems 3.1, 3.2, and 4.3, we obtain the following results.

Theorem 4.4. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. Let Fbe a bifunction fromC×C toRsatisfying (A1)-(A4). LetAbe a monotone andk -Lipschitz-continuous mapping ofCinto H. LetS1,S2,... be a family of infinitely

nonex-pansive mappings of C into itself such that =∩∞i=1Fix(Si)∩VI(C,A)EP(F)=∅.

Assume that for alliÎ{1, 2,...}, and for any bounded subsetKofC, there holds

lim

n→∞supxK||Sn

xSi(Snx)|| = 0. ()

Let {xn}, {un}, {yn}, and {zn} be the sequences generated by

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

x1=xC,

F(un,y) +r1nyun,unxn ≥0, ∀yC,

yn= (1−γn)un+γnPC(unλnAun),

zn= (1−αnβn)xn+αnyn+βnSnPC(unλnAyn),

Cn={z∈C:||znz||2≤ ||xnz||2+ (3−3γn+αn)b2||Aun||2},

Qn={zC:xnz,xxn ≥0},

xn+1=PCnQnx

for every n = 1, 2,.... where {ln}⊂ [a, b] for somea,b∈(0,

1

4k), {rn}⊂[d, +∞) for some d >0, and {an}, {bn}, {gn} are three sequences in [0, 1] satisfying the following

conditions:

(i)an+bn≤1 for allnÎN;

(ii)nlim→∞αn= 0; (iii)lim infn→∞ βn>0; (iv)nlim→∞γn= 1andγn>

3

4for all nÎN;

Then, {xn}, {un}, {yn} and {zn} converge strongly tow=PΛ(x).

Theorem 4.5. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. Let Fbe a bifunction fromC×C toRsatisfying (A1)-(A4). LetAbe a monotone andk -Lipschitz-continuous mapping ofCinto H. LetS1,S2,... be a family of infinitely

nonex-pansive mappings of C into itself such that =∩∞i=1Fix(Si)∩VI(C,A)EP(F)=∅.

(15)

lim

n→∞supxK||SnxSi(Snx)|| = 0. ()

Let {xn}, {un}, and {yn} be the sequences generated by

⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩

x1=xC,

F(un,y) +

1 rn

yun,unxn ≥0, ∀yC,

yn=PC(unλnAun),

xn+1=βnxn+ (1−βn)SnPC(unλnAyn)

for every n= 1, 2,.... If {ln}⊂[a, b] for somea,b∈(0,1k),{bn}⊂[δ,ε], for some δ, ε

Î (0, 1) and {rn}⊂[d,+∞] for somed> 0, then {xn}, {un} and {yn} converge weakly to

wÎΛ, wherew= limn®∞PΛxn.

Theorem 4.6. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. LetFbe a bifunction from C × Cto Rsatisfying (A1)-(A4). LetAbe a monotone and

k-Lipschitz-continuous mapping ofCintoH. LetS1,S2,... be a family of infinitely

non-expansive mappings of C into itself such that =∩∞i=1Fix(Si)∩VI(C,A)EP(F)=∅.

Assume that for alliÎ{1, 2,...} and for any bounded subsetKofC, thenthere holds

lim

n→∞supxK||SnxSi(Snx)|| = 0. ()

Let {xn}, {un} {yn}, and {zn} be the sequences generated by

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

x1=xC,

F(un,y) +

1 rn

yun,unxn ≥0, ∀yC,

yn=PC(unλnAun),

zn= (1−βn)xn+βnSnPC(unλnAyn),

Cn={zC:||znz||2≤ ||xnz||2,

Qn={zC:xnz,xxn ≥0},

xn+1=PCnQnx

for every n= 1, 2,.... where {ln}⊂[a, b] for some a,b∈(0,

1

4k), {rn}⊂[d, +∞) and for some d >0, and {bn} is a sequence in [0, 1] satisfyinglim infn→∞ βn>0. Then, {xn},

{un}, {yn}, and {zn} converge strongly tow=PΛ(x).

Let B= 0 andF(x,y) = 0 forx, y ÎC, by Theorems 3.1 and 4.3, we obtain the fol-lowing results.

Theorem 4.7. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. Let Abe a monotone andk-Lipschitz-continuous mapping of CintoH. LetS1, S2,... be

a family of infinitely nonexpansive mappings of C into itself such that =∩∞i=1Fix(Si)∩VI(C,A)=∅. Assume that for all i Î {1, 2,...} and for any bounded

subsetKofC, thenthere holds

lim

n→∞supxK||SnxSi(Snx)|| = 0. ()

Let {xn}, {yn}, and {zn} be the sequences generated by

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

x1=xC,

yn= (1−γn)xn+γnPC(xnλnAxn),

zn= (1−αnβn)xn+αnyn+βnSnPC(xnλnAyn),

Cn={z∈C:||znz||2≤ ||xnz||2+ (3−3γn+αn)b2||Axn||2},

Qn={z∈C:xnz,xxn ≥0},

(16)

for everyn= 1, 2,.... where {ln}⊂[a,b] for somea,b∈(0,

1

4k), and {an}, {bn}, {gn}are three sequences in [0, 1] satisfying the following conditions:

(i)an+bn≤1 for allnÎN;

(ii)nlim→∞αn= 0; (iii)lim infn→∞ βn>0; (iv)nlim→∞γn= 1andγn>

3

4for all nÎN;

Then, {xn}, {yn}, and {zn} converge strongly tow=PΓ(x).

Theorem 4.8. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. Let Abe a monotone andk-Lipschitz-continuous mapping of CintoH. LetS1, S2,... be

a family of infinitely nonexpansive mappings of C into itself such that =∩∞i=1Fix(Si)∩VI(C,A)=∅. Assume that for all i Î {1, 2,...} and for any bounded

subsetKofC, thenthere holds

lim

n→∞supxK||SnxSi(Snx)|| = 0. ()

Let {xn}, {yn}, and {zn} be the sequences generated by

⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩

x1=xC,

yn=PC(xnλnAxn),

zn= (1−βn)xn+βnSnPC(xnλnAyn),

Cn={zC:||znz||2≤ ||xnz||2,

Qn={zC:xnz,xxn ≥0},

xn+1=PCnQnx

for every n = 1, 2,.... where {ln} ⊂ [a, b] for some a,b∈(0,

1

4k), and {bn} is a sequence in [0, 1] satisfyinglim infn→∞ βn>0. Then, {xn}, {yn}, and {zn} converge strongly

to w=PΓ(x).

Let F(x,y) = 0 forx,y Î C, then by Theorem 3.2 and the proof of Theorem 4.7 in [3], we obtain the following result.

Theorem 4.9. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. Let Abe a monotone andk-Lipschitz-continuous mapping ofCintoHandBbe an a-inverse-strongly monotone mapping of CintoH. LetS1, S2,... be a family of infinitely

nonexpansive mappings of C into itself such that

=∩∞i=1Fix(Si)∩VI(C,A)VI(C,B)=∅. Assume that for alli Î{1, 2,...} and for any

bounded subset KofC, thenthere holds

lim

n→∞supxK||SnxSi(Snx)|| = 0. ()

Let {xn}, {un}, and {yn} be the sequences generated by

⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩

x1=xC,

un=PC(xnrnBxn),

yn=PC(unλnAun),

(17)

for every n= 1, 2,.... if {ln}⊂[a,b] for somea,b∈(0,1k), {bn}⊂[δ, ε] for someδ, ε

Î (0, 1) and {rn}⊂[d,e] for somed,eÎ (0, 2a). Then, {xn} and {un} converge weakly

to wÎΞ, wherew= limn®∞PΞxn.

Remark 4.1.

(i) For all n≥1, letSn=Sbe a nonexpansive mapping, by Theorems 3.2, 4.2, 4.7,

4.8, and 4.9 we recover Theorem 3.1 in [5], Theorem 3.1 in [1], Theorem 5 in [26], Theorem 3.1 in [23], and Theorem 4.7 in [3]. In addition, letA= 0, by Theorems 4.6 and 4.5, respectively, we recover Theorems 3.1 and 4.1 in [11].

(ii) For alln≥1, letSn=Sbe a nonexpansive mapping, by Theorems 3.1, 4.3, and

4.4, respectively, we recover Theorems 4.3, 4.4, and 4.7 in [4] with some modified conditions onF.

(iii) Theorems 3.1, 3.2, 4.3-4.7 also improve the main results in [10,12,13] because the inverse strongly monotonicity ofAhas been replaced by the monotonicity and Lipschitz continuity ofA.

The following result illustrates that there are the nonexpansive mappings S1, S2 ,...

satisfying the condition (*).

Lemma 4.1. Let Cbe a nonempty closed convex subset of a real Hilbert spaceH. Let

T be a nonexpansive mapping of Cinto itself such that Fix(T) ≠ ∅. If we define

Sn(x) =

1 n

n−1

j=0 T

jx fornÎ{1, 2,...}, andxÎ C, then the following results hold:

(a) For any bounded subsetKofC, there holds

lim

n→∞supxK||SnxT(Snx)||= 0.

(b)∩∞i=1Fix(Si) = Fix(T).

(c) for all iÎ{1, 2,...} and for any bounded subsetKofC, there holds

lim

n→∞supxK||Sn

xSi(Snx)||= 0.

Proof.

(a) It is due to Bruck [27,28] (please also see Lemma 3.1 in [22]). (b) It follows from (a) that∩∞i=1Fix(Si)⊆Fix(T).

Moreover, it is obvious that∩∞i=1Fix(Si)⊇Fix(T). Hence,∩∞i=1Fix(Si) = Fix(T).

(c) It can be proved by mathematical induction. In fact, it is clear that this conclu-sion holds for i = 1. Assume that the conclusion holds fori =m, that is, for any bounded subset KofC, there holds

lim

n→∞supxK||SnxSm(Snx)||= 0. (4:1)

We now prove that the conclusion also holds for i=m+ 1. In fact, we observe that

lim

n→∞supxK||

SnxSm+1(Snx)|| ≤lim n→∞supxK||

SnxSm(Snx)||+ lim

n→∞supxK||

Sm(Snx)−Sm+1(Snx)||

≤ lim

n→∞supxK||

SnxSm(Snx)||+ lim

n→∞supxK

⎡ ⎣ 1

m+ 1||T

m

(Snx)||+ 1

m(m+ 1)

m−1

j=0

||Tj(Snx)||

(18)

It is easy to verify thatS1,S2,... are nonexpansive mappings. It follows from (4.1) and

(4.2) that for any bounded subsetKofC, there holds

lim

n→∞supxK||

SnxSm+1(Snx)|| = 0.

From Lemma 4.1, we know that by Theorems 3.1 and 3.2, respectively, we can obtain the following results.

Theorem 4.10. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. LetFbe a bifunction from C × Cto Rsatisfying (A1)-(A4). LetAbe a monotone and

k-Lipschitz-continuous mapping ofCintoHandBbe ana-inverse-strongly monotone mapping ofCintoH. LetTbe a nonexpansive mapping of Cinto itself such thatΘ=

Fix(T)∩VI(C, A)∩GEP(F, B)≠∅. Let {ln}⊂[a, b] for somea,b∈(0,

1

4k), {rn}⊂[d,e] and for some d,eÎ(0, 2a), and {an}, {bn}, and {gn} be three sequences in [0, 1]

satisfy-ing the followsatisfy-ing conditions:

(i)an+bn≤1 for allnÎN;

(ii) lim

n→∞αn= 0; (iii)lim infn→∞ βn>0;

(iv)nlim→∞γn= 1andγn>

3

4for alln ÎN; If we defineSn(x) = 1 n

n−1

j=0 T

jxfornÎ

{1, 2,...}, andxÎ C, then the sequences {xn}, {un}, {yn}, and {zn} generated by

algo-rithm (3.1) converge strongly tow=PΘ(x).

Theorem 4.11. LetCbe a nonempty closed convex subset of a real Hilbert spaceH. LetFbe a bifunction from C × Cto Rsatisfying (A1)-(A4). LetAbe a monotone and

k-Lipschitz-continuous mapping ofCintoHandBbe ana-inverse-strongly monotone mapping ofCintoH, andTbe a nonexpansive mapping of Cinto itself such thatΘ= Fix(T)∩VI(C,A)∩GEP(F, B)≠∅. Assume that {ln}⊂[a,b] for somea,b∈(0,1k){bn}

⊂ [δ, ε] for some δ, ε Î (0, 1), and {rn} ⊂ [d, e] some d, e Î (0, 2a). If we define

Sn(x) =

1 n

n−1

j=0 T

jx fornÎ {1, 2,...} andxÎC, then the sequences {x

n}, {un}, and {yn}

generated by algorithm (3.12) converge weakly towÎΘ, wherew= limn®∞PΘxn.

5. Competing interests

The authors declare that they have no competing interests.

Acknowledgements

This research was supported by the National Natural Science Foundation of China, the Natural Science Foundation of Chongqing (Grant No. CSTC, 2009BB8240), and the Special Fund of Chongqing Key Laboratory (CSTC). The author is grateful to the referees for their detailed comments and helpful suggestions, which have improved the presentation of this article.

Received: 30 November 2010 Accepted: 29 June 2011 Published: 29 June 2011

References

1. Moudafi, A: Weak convergence theorems for nonexpansive mappings and equilibrium Problems. J Nonlinear Convex Anal.9, 3743 (2008)

2. Moudafi, A, Thera, M: Proximal and dynamical approaches to equilibrium problems. Lecture Notes in Econom and Math System, Springer-Verlag, Berlin.477, 187–201 (1999)

3. Peng, JW, Yao, JC: Weak convergence of an iterative scheme for generalized equilibrium problems. Bull Aust Math Soc.

(19)

4. Peng, JW, Yao, JC: A new hybrid-extragradient method for generalized mixed equilibrium problems and fixed point problems and variational inequality problems. Taiwan J Math.12(6):14011432 (2008)

5. Takahashi, S, Takahashi, W: Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space. Nonlinear Anal.69, 10251033 (2008). doi:10.1016/j.na.2008.02.042

6. Flam, SD, Antipin, AS: Equilibrium programming using proximal-like algorithms. Math Program.78, 29–41 (1997) 7. Blum, E, Oettli, W: From optimization and variational inequalities to equilibrium problems. Math Stud.63, 123145

(1994)

8. Combettes, PL, Hirstoaga, SA: Equilibrium programming in Hilbert spaces. J Nonlinear Convex Anal.6, 117136 (2005) 9. Takahashi, S, Takahashi, W: Viscosity approximation methods for equilibrium problems and fixed point problems in

Hilbert spaces. J Math Anal Appl.331, 506–515 (2006)

10. Su, Y, Shang, M, Qin, X: An iterative method of solutions for equilibrium and optimization problems. Nonlinear Anal.69, 2709–2719 (2008). doi:10.1016/j.na.2007.08.045

11. Tada, A, Takahashi, W: Weak and strong convergence theorems for a nonexpansive mapping and an equilibrium problem. J Optim Theory Appl.133, 359–370 (2007). doi:10.1007/s10957-007-9187-z

12. Plubtieng, S, Punpaeng, R: A new iterative method for equilibrium problems and fixed point problems of nonexpansive mappings and monotone mappings. Appl Math Comput.197, 548–558 (2008). doi:10.1016/j.amc.2007.07.075 13. Chang, SS, Joseph Lee, HW, Chan, CK: A new method for solving equilibrium problem, fixed point problem and

variational inequality problem with application to optimization. Nonlinear Anal.70, 3307–3319 (2009). doi:10.1016/j. na.2008.04.035

14. Yao, YH, Liou, YC, Yao, JC: Convergence theorem for equilibrium problems and fixed point problems of infinite family of nonexpansive mappings. Fixed Point Theory Appl 12 (2007). Article ID 64363

15. Ceng, LC, Yao, JC: Hybrid viscosity approximation schemes for equilibrium problems and fixed point problems of infinitely many nonexpansive mappings. Appl Math Comput.198, 729–741 (2007)

16. Colao, V, Marino, G, Xu, H-K: An iterative method for finding common solutions of equilibrium and fixed point problems. J Math Anal Appl.344, 340–352 (2008). doi:10.1016/j.jmaa.2008.02.041

17. Iusem, AN, Sosa, W: Iterative algorithms for equilibrium problems. Optimization.52, 301316 (2003). doi:10.1080/ 0233193031000120039

18. Nguyen, TTV, Strodiot, JJ, Nguyen, VH: A bundle method for solving equilibrium problems. Math Program Ser B.116, 529–552 (2009). doi:10.1007/s10107-007-0112-x

19. Ceng, LC, AI-Homidan, S, Ansari, QH, Yao, JC: An iterative scheme for equilibrium problems and fixed point problems of strict pseudo-contraction mappings. J Comput Appl Math.223, 967–974 (2008)

20. Takahashi, W, Shimoji, K: Convergence theorems for nonexpansive mappings and feasibility problems. Math Comput Model.32, 14631471 (2000). doi:10.1016/S0895-7177(00)00218-1

21. Shimoji, K, Takahashi, W: Strong convergence to common fixed points of infinite nonexpansive mappings and applications. Taiwanese J Math.5(2):387404 (2001)

22. OHaraa, JG, Pillay, P, Xu, HK: Iterative approaches to finding nearest common fixed points of nonexpansive mappings in Hilbert spaces. Nonlinear Anal.54, 1417–1426 (2003). doi:10.1016/S0362-546X(03)00193-7

23. Nadezhkina, N, Takahashi, W: Strong convergence theorem by a hybrid method for non-expansive mappings and Lipschitz-continuous monotone mappings. SIAM J Optim.16(4):1230–1241 (2006). doi:10.1137/050624315

24. Opial, Z: Weak convergence of the sequence of successive approximation for nonexpansive mappings. Bull Am Math Soc.73, 561–597 (1967)

25. Rockafellar, RT: On the maximality of sums of nonlinear monotone operators. Trans Am Math Soc.149, 7588 (1970). doi:10.1090/S0002-9947-1970-0282272-5

26. Ceng, LC, Hadjisavvas, N, Wong, NC: Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point problems. J Global Optim.46, 635–646 (2010) (2010). doi:10.1007/s10898-009-9454-7

27. Bruck, RE: A simple proof of the mean ergodic theorem for nonlinear contractions in Banach spaces. Israel J Math.32, 107–116 (1979). doi:10.1007/BF02764907

28. Bruck, RE: On the convex approximation property and the asymptotic behavior of nonlinear contractions in Banach spaces. Israel J Math.38, 304–314 (1981). doi:10.1007/BF02762776

doi:10.1186/1687-1812-2011-12

Cite this article as:Peng:Some extragradient methods for common solutions of generalized equilibrium problems and fixed points of nonexpansive mappings.Fixed Point Theory and Applications20112011:12.

Submit your manuscript to a

journal and benefi t from:

7 Convenient online submission 7 Rigorous peer review

7 Immediate publication on acceptance 7 Open access: articles freely available online 7 High visibility within the fi eld

7 Retaining the copyright to your article

References

Related documents

What are the driving factors leading companies to request sales tax outsourcing services:. • Complexity of returns at the local level of tax (County

worked on this paper during a visit to the Faculty of Computing and Mathematical Sciences of the University of Waikato in Hamilton, New Zealand in December of 2011 and during a visit

Unless stated otherwise, we shall use small letters such as x to denote positive inte- gers or functions or elements of a set, capital letters such as X to denote sets, and

Sauer and Spencer in their work [5] conjectured that if the minimum degree of G is at least 2n/3 then G contains every graph of order n with maximum degree of at most 2..

Consider the following question: given n coins with distinct integer weights between 1 gram and n grams, each labeled by a distinct integer label between 1 and n, what is the

By restricting Fan’s condition to some induced subgraphs of 2- connected graphs, Ning and Zhang [9] extended Theorem 1 as follows.... This can be easily deduced from the

(4) Extension theorems are often used for optimal linear codes problem, especially to prove the nonexistence of linear codes with certain parameters.. Moreover, the extended matrix of

Corr´ adi and Hajnal [2] proved that if G is a graph of order at least 3k with minimum degree at least 2k, then G contains k independent cycles.. This result has inspired much