An equilibrium problem and a strictly pseudocontractive nonself-mapping are investigated. Strong convergence theorems of common elements are established based on hybrid projection algorithms in the framework of real Hilbert spaces.
1. Introduction
Bifunction equilibrium problems which were considered by Blum and Oettli [1] have intensively been studied. It has been shown that the bifunction equilibrium problem covers fixed point problems, variational inequalities, inclusion problems, saddle problems, complementarity problem, minimization problem, and the Nash equilibrium problem; see [1–4] and the references therein. Iterative methods have emerged as an effective and powerful tool for studying a wide class of problems which arise in economics, finance, image reconstruction, ecology, transportation, network, elasticity, and optimization; see [5–16] and the references therein. In this paper, we investigate an equilibrium problem and a strictly pseudocontractive nonself-mapping based on hybrid projection algorithms. Strong convergence theorems of common elements lie in the solution set of the equilibrium problem and the fixed point set of the strictly pseudocontractive nonself-mapping.
Throughout this paper, we always assume that H is a real Hilbert space with the inner product 〈·,·〉 and the norm ∥·∥. Let C be a nonempty closed convex subset of H and F a bifunction of C×C into ℝ, where ℝ denotes the set of real numbers. In this paper, we consider the following equilibrium problem:
(1.1)Findx∈CsuchthatF(x,y)≥0,∀y∈C.
The set of such an x∈C is denoted by EP(F), that is,
(1.2)EP(F)={x∈C:F(x,y)≥0,∀y∈C}.
Given a mapping T:C→H, let F(x,y)=〈Tx,y-x〉 for all x,y∈C. Then z∈EP(F) if and only if 〈Tz,y-z〉≥0 for all y∈C, that is, z is a solution of the variational inequality.
To study the equilibrium problem (1.1), we may assume that F satisfies the following conditions:
F(x,x)=0 for all x∈C;
F is monotone, that is, F(x,y)+F(y,x)≤0 for all x,y∈C;
for each x,y,z∈C,
(1.3)limsupt↓0F(tz+(1-t)x,y)≤F(x,y);
for each x∈C, y↦F(x,y) is convex and lower semicontinuous.
If H is an Euclidean space, then we see that F(x,y)=x-y is a simple example satisfying the above assumptions. See [2] for more details. Let S:D(S)→R(S), where D(S) and R(S) denote the domain and the range of the mapping S. If D(S)=R(S), then the mapping S is said to be a self-mapping. If D(S)≠R(S), then the mapping S is said to be a nonself-mapping. Let S:C→H be a nonself-mapping. In this paper, we use F(S) to denote the fixed point set of S. Recall the following definitions. S is said to be nonexpansive if
(1.4)∥Sx-Sy∥≤∥x-y∥,∀x,y∈C.
S is said to be strictly pseudocontractive if there exists a constant κ∈[0,1) such that
(1.5)∥Sx-Sy∥2≤∥x-y∥2+κ∥(I-S)x-(I-S)y∥2,∀x,y∈C.
For such a case, S is also said to be κ-strict pseudocontraction. It is clear that (1.5) is equivalent to
(1.6)〈Sx-Sy,x-y〉≤∥x-y∥2-1-κ2∥(x-Sx)-(y-Sy)∥2,∀x,y∈C.
S is said to be pseudocontractive if
(1.7)∥Sx-Sy∥2≤∥x-y∥2+∥(I-S)x-(I-S)y∥2,∀x,y∈C.
It is clear that (1.7) is equivalent to
(1.8)〈Sx-Sy,x-y〉≤∥x-y∥2,∀x,y∈C.
The class of κ-strict pseudocontractions which was introduced by Browder and Petryshyn [17] in 1967 has been considered by many authors. It is easy to see that the class of strict pseudocontractions falls into the one between the class of nonexpansive mappings and the class of pseudocontractions. For studying the class of strict pseudocontractions, Zhou [18] proposed the following convex combination method: define a mapping St:C→H by
(1.9)Stx=tx+(1-t)Sx,∀x∈C.
He showed that St is nonexpansive if t∈[κ,1); see [18] for more details.
Recently, many authors considered the problem of finding a common element in the fixed point set of a nonexpansive mapping and in the solution set of the equilibrium problem (1.1) based on iterative methods; see, for instance, [19–27].
In 2007, Tada and Takahashi [23] considered an iterative method for the equilibrium problem (1.1) and a nonexpansive nonself-mapping. To be more precise, they obtained the following results.
Theorem TT.
Let C be a closed convex subset of a real Hilbert space H, let f:C×C→ℝ be a bifunction satisfying (A1)–(A4), and let S be a nonexpansive mapping of C into H such that F(S)∩EP(f)≠∅. Let {xn} and {un} be sequences generated by x1=x∈H, and let
(1.10)un∈C
suchthat
f(un,y)+1rn〈y-un,un-xn〉≥0,∀y∈C,wn=(1-αn)xn+αnSun,Cn={z∈H:∥wn-z∥≤∥xn-z∥},Qn={z∈H:〈xn-z,x-xn〉≥0},xn+1=PCn∩Qnx,
for every n∈ℕ, where {αn}⊂[a,1], for some a∈(0,1) and {rn}⊂(0,∞) satisfies liminfn→∞rn>0. Then the sequence {xn} converges strongly to PF(S)∩EP(f)(x).
We remark that the iterative process (1.10) is called the hybrid projection iterative process. Recently, the hybrid projection iterative process which was first considered by Haugazeau [28] in 1968 has been studied for fixed point problem of nonlinear mappings and equilibrium problems by many authors. Since the sequence generated in the hybrid projection iterative process depends on the sets Cn and Qn, the hybrid projection iterative process is also known as “CQ” iterative process; see [29] and the reference therein.
Recently, Takahashi et al. [30] considered the shrinking projection process for the fixed point problem of nonexpansive self-mapping. More precisely, they obtain the iterative sequence monontonely without the help of the set Qn; see [30] for more details.
In this paper, we reconsider the same shrinking projection process for the equilibrium problem (1.1) and a strictly pseudocontractive nonself-mapping. We show that the sequence generated in the proposed iterative process converges strongly to some common element in the fixed point set of a strictly pseudocontractive nonself-mapping and in the solution set of the equilibrium problem (1.1). The main results presented in this paper mainly improved the corresponding results in Tada and Takahashi [23].
2. Preliminaries
Let C be a nonempty closed and convex subset of a real Hilbert space H. Let PC be the metric projection from H onto C. That is, for x∈H,PCx is the only point in C such that ∥x-PCx∥=inf{∥x-z∥:z∈C}. We know that the mapping PC is firmly nonexpansive, that is,
(2.1)∥PCx-PCy∥2≤〈PCx-PCy,x-y〉,∀x,y∈H.
The following lemma can be found in [1, 2].
Lemma 2.1.
Let C be a nonempty closed convex subset of H, and let F:C×C→ℝ be a bifunction satisfying (A1)–(A4). Then, for any r>0 and x∈H, there exists z∈C such that (2.2)F(z,y)+1r〈y-z,z-x〉≥0,∀y∈C.
Tr is firmly nonexpansive, that is,
(2.4)∥Trx-Try∥2≤〈Trx-Try,x-y〉,∀x,y∈H;
F(Tr)=EP(F);
EP(F) is closed and convex.
Lemma 2.2 (see [18]).
Let H be a real Hilbert space, C a nonempty closed convex subset of H, and S:C→H a strict pseudocontraction. Then the mapping I-S is demiclosed at zero, that is, if {xn} is a sequence in C such that xn⇀x- and xn-Sxn→0, then x-∈F(S).
Lemma 2.3 (see [18]).
Let C be a nonempty closed convex subset of a real Hilbert space H and S:C→H a κ-strict pseudocontraction. Define a mapping Sαx=αx+(1-α)Sx for all x∈C. If α∈[κ,1), then the mapping Sα is a nonexpansive mapping such that F(Sα)=F(S).
3. Main ResultsTheorem 3.1.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let F1 and F2 be two bifunctions from C×C to ℝ which satisfy (A1)–(A4), respectively. Let S:C→H be a κ-strict pseudocontraction. Assume that ℱ:=EP(F1)∩EP(F2)∩F(S)≠∅. Let {αn}, {βn}, and {γn} be sequences in [0,1]. Let {xn} be a sequence generated in the following manner:
(Δ)x1∈H,C1=H,zn=γnun+(1-γn)vn,yn=αnxn+(1-αn)(βnzn+(1-βn)Szn),Cn+1={w∈Cn:∥yn-w∥≤∥xn-w∥},xn+1=PCn+1x1,n≥0,
where un is chosen such that
(3.1)F1(un,u)+1rn〈u-un,un-xn〉≥0,∀u∈C,
and vn is chosen such that
(3.2)F2(vn,v)+1sn〈v-vn,vn-xn〉≥0,∀v∈C.
Assume that the control sequences {αn}, {βn}, {γn}, {rn}, and {sn} satisfy the following restrictions:
0≤αn≤a<1,κ≤βn≤b<1,0<c≤γn≤d<1;
0<e≤rn,0<f≤sn
for some a,b,c,d,e,f∈ℝ. Then the sequence {xn} generated in the (Δ) converges strongly to some point x-, where x-=Pℱx1.
Proof.
First, we show that Cn is closed and convex for each n≥1. It is easy to see that Cn is closed for each n≥1. We only show that Cn is convex for each n≥1. Note that C1=H is convex. Suppose that Cm is convex for some positive integer m. Next, we show that Cm+1 is convex for the same m. Note that ∥yn-w∥≤∥xn-w∥ is equivalent to
(3.3)2〈xn-yn,w〉≤∥xn∥2-∥yn∥2.
Take w1 and w2 in Cm+1, and put w-=tw1+(1-t)w2. It follows that w1∈Cm,w2∈Cm,
(3.4)2〈xn-yn,w1〉≤∥xn∥2-∥yn∥2,2〈xn-yn,w2〉≤∥xn∥2-∥yn∥2.
Combining (3.4), we can obtain that 2〈xn-yn,w-〉≤∥xn∥2-∥yn∥2, that is, ∥yn-w-∥≤∥xn-w-∥. In view of the convexity of Cm, we see that w-∈Cm. This shows that w-∈Cm+1. This concludes that Cn is closed and convex for each n≥1.
Define a mapping Sn:C→H by Snx=βnx+(1-βn)Sx for all x∈C. It follows from Lemma 2.3 that Sn is nonexpansive and F(Sn)=F(S) for all n≥1. Next, we show that ℱ⊂Cn for all n≥1. It is easy to see that ℱ⊂C1=H. Suppose that ℱ⊂Ck for some integer k≥1. We intend to claim that ℱ⊂Ck+1 for the same k. For any p∈ℱ⊂Ck, we have
(3.5)∥yk-p∥≤αk∥xk-p∥+(1-αk)∥Skzk-p∥∥yk-p∥≤αk∥xk-p∥+(1-αk)∥zk-p∥≤αk∥xk-p∥+(1-αk)(γk∥uk-p∥+(1-γk)∥vk-p∥)=αk∥xk-p∥+(1-αk)(γk∥Trkxk-p∥+(1-γk)∥Tskxk-p∥)≤αk∥xk-p∥+(1-αk)(γk∥xk-p∥+(1-γk)∥xk-p∥)=∥xk-p∥.
This shows that p∈Ck+1. This proves that ℱ⊂Cn for all n≥1.
Since xn=PCnx1 and xn+1=PCn+1x1∈Cn+1⊂Cn, we have that
(3.6)0≤〈x1-xn,xn-xn+1〉=〈x1-xn,xn-x1+x1-xn+1〉≤-∥x1-xn∥2+∥x1-xn∥∥x1-xn+1∥.
It follows that
(3.7)∥x1-xn∥≤∥x1-xn+1∥.
On the other hand, for any p∈ℱ⊂Cn, we see that ∥x1-xn∥≤∥x1-p∥. In particular, we have
(3.8)∥x1-xn∥≤∥x1-Pℱx1∥.
This shows that the sequence {xn} is bounded. In view of (3.7), we see that limn→∞∥xn-x1∥ exists. It follows from (3.6) that
(3.9)∥xn-xn+1∥2=∥xn-x1+x1-xn+1∥2=∥xn-x1∥2+2〈xn-x1,x1-xn+1〉+∥x1-xn+1∥2=∥xn-x1∥2+2〈xn-x1,x1-xn+xn-xn+1〉+∥x1-xn+1∥2=∥xn-x1∥2-2∥xn-x1∥2+2〈xn-x1,xn-xn+1〉+∥x1-xn+1∥2≤∥x1-xn+1∥2-∥xn-x1∥2.
This yields that
(3.10)limn→∞∥xn-xn+1∥=0.
Since xn+1=PCn+1x1∈Cn+1, we see that
(3.11)∥yn-xn+1∥≤∥xn-xn+1∥.
It follows that
(3.12)∥yn-xn∥≤∥yn-xn+1∥+∥xn+1-xn∥≤2∥xn-xn+1∥.
From (3.10), we obtain that
(3.13)limn→∞∥xn-yn∥=0.
On the other hand, we have
(3.14)∥xn-yn∥=∥xn-αnxn-(1-αn)Snzn∥=(1-αn)∥xn-Snzn∥.
From the restriction (a), we obtain from (3.13) that
(3.15)limn→∞∥xn-Snzn∥=0.
For any p∈ℱ, we have that
(3.16)∥un-p∥2=∥Trnxn-Trnp∥2≤〈Trnxn-Trnp,xn-p〉=〈un-p,xn-p〉=12(∥un-p∥2+∥xn-p∥2-∥un-xn∥2).
This implies that
(3.17)∥un-p∥2≤∥xn-p∥2-∥un-xn∥2.
In a similar way, we get that
(3.18)∥vn-p∥2≤∥xn-p∥2-∥vn-xn∥2.
It follows from (3.17) and (3.18) that
(3.19)∥yn-p∥2≤αn∥xn-p∥2+(1-αn)∥Snzn-p∥2≤αn∥xn-p∥2+(1-αn)∥zn-p∥2≤αn∥xn-p∥2+(1-αn)(γn∥un-p∥2+(1-γn)∥vn-p∥2)≤∥xn-p∥2-(1-αn)γn∥un-xn∥2-(1-αn)(1-γn)∥vn-xn∥2.
This implies that
(3.20)(1-αn)γn∥un-xn∥2≤∥xn-p∥2-∥yn-p∥2≤(∥xn-p∥+∥yn-p∥)∥xn-yn∥.
In view of the restriction (a), we obtain from (3.13) that
(3.21)limn→∞∥un-xn∥=0.
It also follows from (3.19) that
(3.22)(1-αn)(1-γn)∥vn-xn∥2≤∥xn-p∥2-∥yn-p∥2≤(∥xn-p∥+∥yn-p∥)∥xn-yn∥.
In view of the restriction (a), we obtain from (3.13) that
(3.23)limn→∞∥vn-xn∥=0.
Since {xn} is bounded, there exists a subsequence {xni} of {xn} such that xni⇀q. From (3.21) and (3.23), we see that uni⇀q and vni⇀q, respectively. From (3.21) and the restriction (b), we see that
(3.24)limn→∞∥un-xn∥rn=0.
Now, we are in a position to show that q∈EP(F1). Note that
(3.25)F1(un,u)+1rn〈u-un,un-xn〉≥0,∀u∈C.
From (A2), we see that
(3.26)1rn〈u-un,un-xn〉≥F1(u,un).
Replacing n by ni, we arrive at
(3.27)〈u-uni,uni-xnirni〉≥F1(u,uni).
In view of (3.24) and (A4), we get that
(3.28)F1(u,q)≤0,∀u∈C.
For any t with 0<t≤1 and u∈C, let ut=tu+(1-t)q. Since u∈C and q∈C, we have ut∈C and hence F1(ut,q)≤0. It follows that
(3.29)0=F1(ut,ut)≤tF1(ut,u)+(1-t)F1(ut,q)≤tF1(ut,u),
which yields that
(3.30)F1(ut,u)≥0,∀u∈C.
Letting t↓0, we obtain from (A3) that
(3.31)F1(q,u)≥0,∀u∈C.
This means that q∈EP(F1). In the same way, we can obtain that q∈EP(F2). Next, we show that q∈F(S). Note that
(3.32)∥zn-xn∥≤γn∥un-xn∥+(1-γn)∥vn-xn∥.
It follows from (3.21) and (3.23) that
(3.33)limn→∞∥zn-xn∥=0.
On the other hand, we have
(3.34)∥xn-Snxn∥≤∥Snxn-Snzn∥+∥Snzn-xn∥≤∥xn-zn∥+∥Snzn-xn∥.
It follows from (3.15) and (3.33) that
(3.35)limn→∞∥xn-Snxn∥=0.
Note that
(3.36)∥Sxn-xn∥≤∥Sxn-Snxn∥+∥Snxn-xn∥≤βn∥Sxn-xn∥+∥Snxn-xn∥,
which yields that
(3.37)(1-βn)∥Sxn-xn∥≤∥Snxn-xn∥.
This implies from the restriction (a) and (3.35) that
(3.38)limn→∞∥Sxn-xn∥=0.
It follows from Lemma 2.2 that q∈F(S). This shows that q∈ℱ. Since x-=Pℱx1, we obtain that
(3.39)∥x1-x-∥≤∥x1-q∥≤liminfi→∞∥x1-xni∥≤limsupi→∞∥x1-xni∥≤∥x1-x-∥,
which yields that
(3.40)limi→∞∥x1-xni∥=∥x1-q∥=∥x1-x-∥.
It follows that {xni} converges strongly to x-. Therefore, we can conclude that the sequence {xn} converges strongly to x-=Pℱx1. This completes the proof.
From Theorem 3.1, we have the following results.
Corollary 3.2.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let F be a bifunction from C×C to ℝ which satisfies (A1)–(A4). Let S:C→H be a κ-strict pseudocontraction. Assume that ℱ:=EP(F)∩F(S)≠∅. Let {αn} and {βn} be sequences in [0,1]. Let {xn} be a sequence generated in the following manner:
(3.41)x1∈H,C1=H,yn=αnxn+(1-αn)(βnun+(1-βn)Sun),Cn+1={w∈Cn:∥yn-w∥≤∥xn-w∥},xn+1=PCn+1x1,n≥0,
where un is chosen such that
(3.42)F(un,u)+1rn〈u-un,un-xn〉≥0,∀u∈C.
Assume that the control sequences {αn}, {βn}, and {rn} satisfy the following restrictions:
0≤αn≤a<1,κ≤βn≤b<1;
0<e≤rn
for some a,b,e∈ℝ. Then the sequence {xn} converges strongly to some point x-, where x-=Pℱx1.
Proof.
Putting F1≡F2≡F and rn≡sn in Theorem 3.1, we see that zn≡un. From the proof of Theorem 3.1, we can conclude the desired conclusion immediately.
Remark 3.3.
Corollary 3.2 improves Theorem TT in the following aspects.
From the viewpoint of mappings, the class of nonexpansive mappings is extended to the class of strict pseudocontractions.
From the viewpoint of computation, the set Qn is removed.
Corollary 3.4.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let S:C→H be a κ-strict pseudocontraction with fixed points. Let {αn} and {βn} be sequences in [0,1]. Let {xn} be a sequence generated in the following manner:
(3.43)x1∈H,C1=H,yn=αnxn+(1-αn)(βnPCxn+(1-βn)SPCxn),Cn+1={w∈Cn:∥yn-w∥≤∥xn-w∥},xn+1=PCn+1x1,n≥0.
Assume that the control sequences {αn} and {βn} satisfy the restrictions 0≤αn≤a<1 and κ≤βn≤b<1 for some a,b∈ℝ. Then the sequence {xn} converges strongly to some point x-, where x-=PF(S)x1.
Proof.
Putting F1≡F2≡0 and rn≡sn≡1, we can obtain from Theorem 3.1 the desired conclusion easily.
If S is nonexpansive and βn≡0, then Corollary 3.4 is reduced to the following.
Corollary 3.5.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let S:C→H be a nonexpansive mapping with fixed points. Let {αn} be a sequence in [0,1]. Let {xn} be a sequence generated in the following manner:
(3.44)x1∈H,C1=H,yn=αnxn+(1-αn)SPCxn,Cn+1={w∈Cn:∥yn-w∥≤∥xn-w∥},xn+1=PCn+1x1,n≥0.
Assume that the control sequence {αn} satisfies the restriction 0≤αn≤a<1 for some a∈ℝ. Then the sequence {xn} converges strongly to some point x-, where x-=PF(S)x1.
Recently, many authors studied the following convex feasibility problem (CFP):
(3.45)
findingan
x∈⋂m=1NCm,
where N≥1 is an integer and each Cm is a nonempty closed and convex subset of a real Hilbert space H. There is a considerable investigation on CFP in the setting of Hilbert spaces which captures applications in various disciplines such as image restoration, computer tomography, and radiation therapy treatment planning.
Next, we consider the case that each Cm is the solution set of an equilibrium problem.
Theorem 3.6.
Let C be a nonempty closed convex subset of a real Hilbert space H. Let Fm be a bifunction from C×C to ℝ which satisfies (A1)–(A4) for each 1≤m≤N. Assume that ℱ:=∩m=1NEP(Fm)≠∅. Let {αn}, {γ(n,1)},…, and {γ(n,N)} be sequences in [0,1]. Let r(n,1),…, and r(n,N) be sequences in (0,∞). Let {xn} be a sequence generated in the following manner:
(3.46)x1∈H,C1=H,Fm(u(n,m),u)+1r(n,m)〈u-u(n,m),u(n,m)-xn〉≥0,∀u∈C,yn=αnxn+(1-αn)∑m=1Nγ(n,m)u(n,m),Cn+1={w∈Cn:∥yn-w∥≤∥xn-w∥},xn+1=PCn+1x1,n≥0.
Assume that the control sequences satisfy the following restrictions:
0≤αn≤a<1,∑m=1Nγ(n,m)=1, 0<cm≤γ(n,m)≤dm<1;
0<em≤r(n,m),
where a,c1,…,cm,d1,…,dm,e1,…,em∈ℝ. Then the sequence {xn} generated in the above iterative process converges strongly to some point x-, where x-=Pℱx1.
Proof.
Let S be the identity mapping and βn≡0, then we can obtain from Theorem 3.1 the desired conclusion easily.
Acknowledgment
This work was supported by Natural Science Foundation of Zhejiang Province (Y6110270).
BlumE.OettliW.From optimization and variational inequalities to equilibrium problems1994631–41231451292380ZBL0888.49007CombettesP. L.HirstoagaS. A.Equilibrium programming in Hilbert spaces2005611171362138105ZBL1109.90079ParkS.Some equilibrium problems in generalized convex spaces20012633493641916173ZBL1020.46026AnsariQ. H.SchaibleS.YaoJ.-C.The system of generalized vector equilibrium problems with applications2002221–431610.1023/A:10138579243931878132ZBL1041.90069QinX.ChangS.-S.ChoY. J.Iterative methods for generalized equilibrium problems and fixed point problems with applications20101142963297210.1016/j.nonrwa.2009.10.0172661959ZBL1192.58010LinL.-J.YuZ.-T.AnsariQ. H.LaiL.-P.Fixed point and maximal element theorems with applications to abstract economies and minimax inequalities2003284265667110.1016/S0022-247X(03)00385-81998659ZBL1033.47039ChoS. Y.KangS. M.Approximation of common solutions of variational inequalities via strict pseudocontractions20123241607161810.1016/S0252-9602(12)60127-12927448ChoS. Y.KangS. M.Approximation of fixed points of pseudocontraction semigroups based on a viscosity iterative process201124222422810.1016/j.aml.2010.09.0082735146KotzerT.CohenN.ShamirJ.Image restoration by a novel method of parallel projection onto constraint sets19952017721774ByrneC.A unified treatment of some iterative algorithms in signal processing and image reconstruction200420110312010.1088/0266-5611/20/1/0062044608ZBL1051.65067IusemA. N.SosaW.Iterative algorithms for equilibrium problems200352330131610.1080/02331930310001200391995678ZBL1176.90640CensorY.ElfvingT.KopfN.BortfeldT.The multiple-sets split feasibility problem and its applications for inverse problems20052162071208410.1088/0266-5611/21/6/0172183668ZBL1089.65046ChoY. J.QinX.Systems of generalized nonlinear variational inequalities and its projection methods200869124443445110.1016/j.na.2007.11.0012467242ZBL1153.49009LopezG.MartinV.XuH.-K.Perturbation techniques for nonexpansive mappings with applications20091042369238310.1016/j.nonrwa.2008.04.0202508445ZBL1163.47306QinX.SuY.Strong convergence theorems for relatively nonexpansive mappings in a Banach space20076761958196510.1016/j.na.2006.08.0212326043ZBL1124.47046KangS. M.ChoS. Y.LiuZ.Convergence of iterative sequences for generalized equilibrium problems involving inverse-strongly monotone mappings201020101682708210.1155/2010/8270822592859ZBL1187.47050BrowderF. E.PetryshynW. V.Construction of fixed points of nonlinear mappings in Hilbert space196720197228021765810.1016/0022-247X(67)90085-6ZBL0153.45701ZhouH.Convergence theorems of fixed points for κ-strict pseudo-contractions in Hilbert spaces200869245646210.1016/j.na.2007.05.0322426262QinX.ChoY. J.KangS. M.Convergence theorems of common elements for equilibrium problems and fixed point problems in Banach spaces20092251203010.1016/j.cam.2008.06.0112490167ZBL1165.65027QinX.ChoS. Y.KangS. M.Strong convergence of shrinking projection methods for quasi-φ-nonexpansive mappings and equilibrium problems2010234375076010.1016/j.cam.2010.01.0152606662ZBL1189.47068YeJ.HuangJ.Strong convergence theorems for fixed point problems and generalized equilibrium problems of three relatively quasi-nonexpansive mappings in Banach spaces2011111182913374KimJ. K.ChoS. Y.QinX.Some results on generalized equilibrium problems involving strictly pseudocontractive mappings20113152041205710.1016/S0252-9602(11)60380-92884969TadaA.TakahashiW.Weak and strong convergence theorems for a nonexpansive mapping and an equilibrium problem2007133335937010.1007/s10957-007-9187-z2333820ZBL1147.47052KimJ. K.Strong convergence theorems by hybrid projection methods for equilibrium problems and fixed point problems of the asymptotically quasi-ϕ-nonexpansive mappings20112011, article 102820314QinX.ChoS. Y.KangS. M.On hybrid projection methods for asymptotically quasi-φ-nonexpansive mappings2010215113874388310.1016/j.amc.2009.11.0312578853ZBL1225.47105YangS.LiW.Iterative solutions of a system of equilibrium problems in Hilbert spaces201111526MoudafiA.Weak convergence theorems for nonexpansive mappings and equilibrium problems20089137432408333ZBL1167.47049HaugazeauY.1968Paris, FranceUniversité de ParisMartinez-YanesC.XuH.-K.Strong convergence of the CQ method for fixed point iteration processes200664112400241110.1016/j.na.2005.08.0182215815ZBL1105.47060TakahashiW.TakeuchiY.KubotaR.Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert spaces2008341127628610.1016/j.jmaa.2007.09.0622394082ZBL1134.47052