SlideShare a Scribd company logo
1 of 11
Download to read offline
Dynamic Systems and Applications 17 (2008) 503-514
APPROXIMATION METHODS OF SOLUTIONS FOR
EQUILIBRIUM PROBLEM IN HILBERT SPACES
SHIH-SEN CHANG, YEOL JE CHO, AND JONG KYU KIM
Department of Mathematics, Yibin University, Yibin, Sichuan 644007, China
sszhang 1@yahoo.com.cn
Department of Mathematics Education and the RINS, Gyeongsang National
University, Chinju 660-701, Korea yjcho@gsnu.ac.kr
Department of Mathematics Education, Kyungnam University
Masan 631-701, Korea jongkyuk@kyungnam.ac.kr
ABSTRACT. The purpose of this paper is, by using viscosity approximation methods, to find
a common element of the set of solutions of an equilibrium problem and the set of fixed point of
a nonexpansive mappings in a Hilbert space and to prove, under suitable conditions, some strong
convergence theorems for approximating a solution of the problem under consideration.
AMS (MOS) Subject Classification. 47H09, 47H10
1. INTRODUCTION PRELIMINARIES
Throughout this paper, we always assume that H is a real Hilbert space, C is a
nonempty closed convex subset of H and φ : C × C → R is a real functional with
φ(x, x) = 0 for all x ∈ C. The “so called” equilibrium problem for functional φ is to
finding a point x∗
∈ C such that
(1.1) φ(x∗
, y) ≥ 0, ∀y ∈ C.
Denote the set of solutions of the equilibrium problem (1.1) by EP(φ).
This equilibrium problem contains fixed point problem, optimization problem,
variational inequality problem and Nash equilibrium problem as its special cases (see,
for example, Blum and Oetti [2]).
Recently, Antipin and Flam [1], Blum and Oettli [2], Moudafi [7], Moudafi et al.
[8], Combettes and Hirstoaga [4] introduced and studied iterative schemes of finding
the best approximation to the initial data when EP(φ) is nonempty and proved some
strong convergence theorems in Hilbert spaces.
Very recently, Takahashi and Takahashi [10] introduced a new iterative scheme by
using the viscosity approximation methods (see Moudafi [7] and Xu [11]) for finding
a common element of the set of solutions of the equilibrium problem (1.1) and the set
Received April 14, 2007 1056-2176 $15.00 c Dynamic Publishers, Inc.
504 S. CHANG, Y. J. CHO, AND J. K. KIM
of fixed points of a nonexpansive mapping in a Hilbert space and proved some strong
convergence theorems. Their results extend and improve the corresponding results
given in [4, 7].
Motivated and inspired by Combettes-Histoaga [4], Takahashi and Takahashi
[10], the purpose of this paper is, by using viscosity approximation methods, to find
a common element of the set of solutions of equilibrium problem (1.1) and the set
of fixed points of a nonexpamsive mappings in Hilbert spaces and to establish some
strong convergence theorems.
For this purpose, first, we recall some definitions, lemmas and notations.
In the sequel, we use xn ⇀ x and xn → x to denote the weak convergence and
strong convergence of the sequence {xn} in H, respectively.
In a Hilbert space H, for any x ∈ H, there exists a unique nearest point in C,
denoted by PC(x), such that
||x − PCx|| ≤ ||x − y||, ∀y ∈ C.
Such a mapping PC from H onto C is called the metric projection. We know that PC
is nonexpansive. Further, for any x ∈ H and z ∈ C,
z = PC(x) ⇔ hx − z, z − yi ≥ 0, ∀y ∈ C.
For solving the equilibrium problem (1.1) for the functional φ : C × C → R, let us
assume that φ satisfies the following conditions:
(A1) φ(x, x) = 0, ∀x ∈ C;
(A2) φ is monotone, i.e.,
φ(x, y) + φ(y, x) ≤ 0, ∀x, y ∈ C;
(A3) for any x, y, z ∈ C the functional x 7→ φ(x, y) is upper-hemicontinuous, i.e.,
lim sup
t→0+
φ(tz + (1 − t)x, y) ≤ φ(x, y), ∀x, y z ∈ C;
(A4) y 7→ φ(x, y) is convex and lower semi-continuous.
The following lemmas will be needed in proving our main results:
Lemma 1.1. ([2]) Let H be a real Hilbert space, C be a nonempty closed convex
subset of H, φ : C × C → R be a functional satisfying the conditions (A1)–(A4).
Then, for any given x ∈ H and r > 0, there exists z ∈ C such that
φ(z, y) +
1
r
hy − z, z − xi ≥ 0, ∀y ∈ C.
APPROXIMATING METHODS FOR EQUILIBRIUM PROBLEM 505
Lemma 1.2. ([4]) Let all the conditions in Lemma 1.1 are satisfied. For any
r > 0 and x ∈ C, define a mapping Tr : H → C as follows:
Tr(x) = {z ∈ C : φ(z, y) +
1
r
hy − z, z − xi ≥ 0, ∀y ∈ C}, ∀x ∈ H.
Then the following holds:
(1) Tr is single-valued;
(2) Tr is firmly nonexpansive, i.e.,
||Trx − Try||2
≤ hTrx − Try, x − yi, ∀x, y ∈ H,
and so ||Trx − Try|| ≤ ||x − y||, ∀x, y ∈ H.
(3) F(Tr) = EP(φ), ∀r > 0;
(4) EP(φ) is a closed and convex set.
Lemma 1.3. ([9]) Let X be a Banach space, {xn}, {yn} be two bounded sequences
in X and {βn} be a sequence in [0, 1] satisfying
0 < lim inf
n→∞
βn ≤ lim sup
n→∞
βn < 1.
Suppose that xn+1 = βnxn + (1 − βn)yn, ∀n ≥ 0 and
lim sup
n→∞
{||yn+1 − yn|| − ||xn+1 − xn||} ≤ 0,
then limn→∞ ||yn − xn|| = 0.
Lemma 1.4. ([6]) Let {an} and {bn} be two nonnegative real sequences satisfying
the following condition:
an+1 ≤ (1 − λn)an + bn, ∀n ≥ n0,
where n0 is some nonnegative integer, {λn} is a sequence in (0, 1) with
P∞
n=0 λn = ∞
and bn = ◦(λn). Then limn→∞ an = 0.
Lemma 1.5. ([5]) Let X be a uniformly convex Banach space, C be a nonempty
closed convex subset of X and T : C → X be a nonexpansive mapping with a fixed
point. Then I − T is demiclosed in the sense that if {xn} is a sequence in C and if
xn ⇀ x and (I − T)xn → 0, then (I − T)x = 0.
Lemma 1.6. ([3]) Let E be a real Banach space, J : E → 2E∗
be the normalized
duality mapping and x, y be any given points in E. Then the following conclusion
holds:
||x + y||2
≤ ||x||2
+ 2hy, j(x + y)i, ∀j(x + y) ∈ J(x + y).
Especially, if E = H is a real Hilbert space, then
||x + y||2
≤ ||x||2
+ 2hy, x + yi, ∀x, y ∈ H.
506 S. CHANG, Y. J. CHO, AND J. K. KIM
2. MAIN RESULTS
In this section, we shall prove our main theorems in this paper:
Theorem 2.1. Let H be a real Hilbert space, C be a nonempty closed convex
subset of H, φ : C × C → R be a functional satisfying the conditions (A1)–(A4),
T : C → H be a nonexpansive mapping with F(T)
T
EP(φ) 6= ∅ and f : H → H
be a contraction mapping with a contractive constant α ∈ (0, 1). Let {αn}, {βn} be
two sequences in [0, 1] and {rn} ⊂ (0, ∞) be a real sequence satisfying the following
conditions:
(i) αn → 0;
P∞
n=0 αn = ∞; |1 − αn
αn+1
| → 0;
(ii) There exist a, b ∈ (0, 1) such that a ≤ βn ≤ b for all n ≥ 0;
(iii) 0 < r < rn for all n ≥ 0 and |rn − rn+1| → 0 as n → ∞.
where r, a and b are some positive constants. For any x0 ∈ H, let {xn} and {un} be
the sequences defined by
(2.1)









φ(un, y) +
1
rn
hy − un un − xni ≥ 0, ∀y ∈ C,
xn+1 = βnxn + (1 − βn)zn,
zn = αnf(un) + (1 − αn)Tun, ∀n ≥ 0.
Then xn → x∗
∈ F(T)
T
EP(φ), where x∗
= PF (T)∩EP (φ)f(x∗
).
Proof. We divide the proof into six steps:
(I) We first prove that the mapping PF (T)∩EP (φ)f : H → C has a unique fixed
point.
In fact, since f : H → H is a contraction and PF (T)∩EP (φ) : H → F(T) ∩ EP(φ)
is also a contraction, we have
||PF (T)∩EP (φ)f(x) − PF (T)∩EP (φ)f(y)|| ≤ α||x − y||, ∀x, y ∈ H.
Therefore, there exists a unique x∗
∈ C such that x∗
= PF (T)∩EP (φ)f(x∗
).
(II) Now we prove that the sequences {xn} and {un} are bounded in H and C,
respectively.
In fact, from the definition of Tr in Lemma 1.2, we know that un = Trn xn.
Therefore, for any p ∈ F(T)
T
EP(φ), we have
(2.2) ||un − p|| = ||Trn xn − Trn p|| ≤ ||xn − p||.
Therefore, it follows from (2.1) and (2.2) that
||xn+1 − p||
≤ βn||xn − p|| + (1 − βn)||zn − p||
≤ βn||xn − p|| + (1 − βn)||αn(f(un) − p) + (1 − αn)(Tun − p)||
APPROXIMATING METHODS FOR EQUILIBRIUM PROBLEM 507
≤ βn||xn − p|| + (1 − βn){αn||f(un) − f(p)||
+ αn||f(p) − p|| + (1 − αn)||Tun − p||}
≤ βn||xn − p|| + (1 − βn)αnα||un − p||
+ (1 − βn)αn||f(p) − p|| + (1 − βn)(1 − αn)||un − p||
≤ βn||xn − p|| + (1 − βn)(1 − αn(1 − α))||xn − p|| + (1 − βn)αn||f(p) − p||
≤ max{||xn − p||,
||f(p) − p||
1 − α
}
≤ · · ·
≤ max{||x0 − p||,
||f(p) − p||
1 − α
}.
This implies that {xn} is a bounded sequence in H. By (2.2), we know that {un} is
a bounded sequence in C and so {Tun}, {f(un)}, {zn} all are bounded sequences in
H. Let
(2.3) M = sup
n≥0
{||un − xn|| + ||xn − y||2
+ ||f(un)|| + ||T(un)||},
where y ∈ H is some given point.
(III) Now, we make an estimation for {||un+1 − un||}.
By the definition of Tr, un = Trn xn and un+1 = Trn+1 xn+1. Hence we have
(2.4) φ(un+1, y) +
1
rn+1
hy − un+1, un+1 − xn+1i ≥ 0, ∀y ∈ C,
(2.5) φ(un, y) +
1
rn
hy − un, un − xni ≥ 0, ∀y ∈ C.
Take y = un+1 in (2.5) and y = un in (2.4). Then, adding the resulting inequalities
and noting the condition (A2), we have
hun+1 − un,
un − xn
rn
−
un+1 − xn+1
rn+1
i ≥ 0
and hence
hun+1 − un, un − un+1 + un+1 − xn −
rn
rn+1
(un+1 − xn+1)i ≥ 0.
This implies that
||un+1 − un||2
≤ hun+1 − un, xn+1 − xn + (1 −
rn
rn+1
)(un+1 − xn+1)i
≤ ||un+1 − un||{||xn+1 − xn|| + |1 −
rn
rn+1
| · ||un+1 − xn+1||}
Thus, by the condition (iii), we have
(2.6)
||un+1 − un|| ≤ ||xn+1 − xn|| + |1 −
rn
rn+1
|||un+1 − xn+1||
≤ ||xn+1 − xn|| +
1
r
|rn+1 − rn| · M.
508 S. CHANG, Y. J. CHO, AND J. K. KIM
(IV) Now we prove that ||Tun − un|| → 0.
In fact, it follows from (2.1) and (2.6) that
||zn+1 − zn||
= ||αn+1f(un+1) + (1 − αn+1)Tun+1 − αnf(un) − (1 − αn)Tun||
= ||αn+1f(un+1) − αn+1f(un) + αn+1f(un) − αnf(un)
+ (1 − αn+1)Tun+1 − (1 − αn+1)Tun + (1 − αn+1)Tun − (1 − αn)Tun||
≤ αn+1||f(un+1) − f(un)|| + 2|αn − αn+1|M + (1 − αn+1)||Tun+1 − Tun||
≤ αn+1α||un+1 − un|| + 2|αn − αn+1|M + (1 − αn+1)||un+1 − un||
≤ ||un+1 − un|| + 2|αn − αn+1|M
≤ ||xn+1 − xn|| +
1
r
|rn+1 − rn||M + 2|1 −
αn
αn+1
|M
It follows from the conditions (i) and (iii) that
lim sup
n→∞
{||zn+1 − zn|| − ||xn+1 − xn||} ≤ 0.
By virtue of Lemma 1.3, we obtain that
(2.7) ||xn − zn|| → 0 as n → ∞.
From (2.1) and (2.7), we have
(2.8) ||xn+1 − xn|| = (1 − βn)||xn − zn|| → 0, as n → ∞.
It follows from (2.6), (2.8) and the condition (iii) that
(2.9) ||un+1 − un|| → 0, as n → ∞.
Since αn → 0 and {zn}, {f(un)}, {Tun} all are bounded, from (2.7), we have
(2.10)
||xn − Tun|| ≤ ||xn − zn|| + ||zn − Tun||
≤ ||xn − zn|| + αn||f(un) − Tun|| → 0.
Furthermore, for any p ∈ F(T)
T
EP(φ), we have
||un − p||2
= ||Trn xn − Trn p||2
≤ hTrn xn − Trn p, xn − pi
= hun − p, xn − pi
=
1
2
{||un − p||2
+ ||xn − p||2
− ||xn − un||2
}.
Hence we have
(2.11) ||un − p||2
≤ ||xn − p||2
− ||xn − un||2
.
APPROXIMATING METHODS FOR EQUILIBRIUM PROBLEM 509
From the convexity of function x 7→ ||x||2
and (2.11), we have
||xn+1 − p||2
= ||βnxn + (1 − βn)zn − p||2
≤ βn||xn − p||2
+ (1 − βn)||zn − p||2
≤ βn||xn − p||2
+ (1 − βn){αn||f(un) − p||2
+ (1 − αn)||Tun − p||2
}
≤ βn||xn − p||2
+ (1 − βn)αn||f(un) − p||2
+ (1 − αn)(1 − βn)||un − p||2
≤ βn||xn − p||2
+ (1 − βn)αn||f(un) − p||2
+ (1 − βn)||un − p||2
≤ βn||xn − p||2
+ (1 − βn)αn||f(un) − p||2
+ (1 − βn){||xn − p||2
− ||xn − un||2
}
and so
(1 − βn)||xn − un||2
≤ ||xn − p||2
− ||xn+1 − p||2
+ (1 − βn)αn||f(un) − p||2
≤ (||xn − p|| − ||xn+1 − p||)(||xn − p|| + ||xn+1 − p||) + αn||f(un) − p||2
≤ (||xn − xn+1||)(||xn − p|| + ||xn+1 − p||) + αn||f(un) − p||2
.
Since αn → 0, {xn} and {f(un)} are bounded and ||xn − xn+1|| → 0, we have
(2.12) ||xn − un|| → 0 as n → ∞
and so
(2.13) ||Tun − un|| ≤ ||Tun − xn|| + ||xn − un|| → 0.
The desired conclusion is proved.
(V) Now, we prove that
lim sup
n→∞
hf(x∗
) − x∗
, xn − x∗
i ≤ 0,
where x∗
= PF (T)∩EP (φ)f(x∗
).
In fact, we can choose a subsequence {xnj
} ⊂ {xn} such that
(2.14) lim
nj→∞
hf(x∗
) − x∗
, xnj
− x∗
, i = lim sup
n→∞
hf(x∗
) − x∗
, xn − x∗
i.
Since {unj
} is bounded, without loss of generality, we can assume that unj
⇀ w ∈ C.
By (2.13), ||Tun − un|| → 0 and hence ||Tunj
− unj
|| → 0. It follows from the
demiclosed principle (see Lemma 1.4) that Tw = w and Tunj
⇀ w.
Next, we prove that w ∈ F(T)∩EP(φ). It is sufficient to prove that w ∈ EP(φ).
In fact, since un = Trn xn, we have
φ(un, y) +
1
rn
hy − un, un − xni ≥ 0, ∀y ∈ C.
510 S. CHANG, Y. J. CHO, AND J. K. KIM
It follows from the condition (A2) that
1
rn
hy − un, un − xni ≥ φ(y, un)
and so
(2.15) hy − unj
,
unj
− xnj
rnj
i ≥ φ(y, unj
).
Since
||unj −xnj ||
rnj
≤
||unj −xnj ||
r
→ 0 and unj
⇀ w, by virtue of the condition (A4), we
have
lim inf
nj →∞
φ(y, unj
) ≤ lim
nj→∞
hy − unj
,
unj
− xnj
rnj
i = 0,
that is,
(2.16) φ(y, w) ≤ 0, ∀y ∈ C.
For any t ∈ (0, 1) and y ∈ C, let yt = ty + (1 − t)w. Then yt ∈ C and so we have
φ(yt, w) ≤ 0. It follows from the conditions (A1), (A4) and (2.16) that
0 = φ(yt, yt)
≤ tφ(yt, y) + (1 − t)φ(yt, w)
≤ tφ(yt, y).
This implies that φ(yt, y) ≥ 0 for all t ∈ (0, 1). Letting t → 0+
, by the condition (A3),
we have
φ(w, y) ≥ 0, ∀y ∈ C.
This shows that w ∈ EP(φ) and so w ∈ F(T) ∩ EP(φ).
Since x∗
= PF (T)∩EP (φ)f(x∗
), unj
⇀ w and ||un − xn|| → 0 (see (2.12)), we have
(2.17)
lim sup
n→∞
hf(x∗
) − x∗
, xn − x∗
i = lim
nj→∞
hf(x∗
) − x∗
, xnj
− x∗
i
= lim
nj→∞
hf(x∗
) − x∗
, unj
− (unj
− xnj
) − x∗
i
= hf(x∗
) − x∗
, w − x∗
i ≤ 0.
The desired conclusion is proved.
(VI) Finally, we prove that xn → x∗
as n → ∞.
In fact, it follows form (2.1) and Lemma 1.6 that
||zn − x∗
||2
= ||αn(f(un) − x∗
) + (1 − αn)(Tun − x∗
)||2
≤ (1 − αn)2
||Tun − x∗
||2
+ 2αnhf(un) − x∗
, zn − x∗
i
≤ (1 − αn)2
||un − x∗
||2
+ 2αnhf(un) − f(x∗
) + f(x∗
) − x∗
, zn − x∗
i
≤ (1 − αn)2
||un − x∗
||2
+ 2αnα||un − x∗
|| · ||zn − x∗
||
+ 2αnhf(x∗
) − x∗
, zn − x∗
i
≤ (1 − αn)2
||un − x∗
||2
+ αnα{||un − x∗
||2
+ ||zn − x∗
||2
}
APPROXIMATING METHODS FOR EQUILIBRIUM PROBLEM 511
+ 2αnhf(x∗
) − x∗
, zn − x∗
i
and so, from (2.2),
(2.18)
||zn − x∗
||2
≤
(1 − αn)2
+ αnα
1 − αnα
||un − x∗
||2
+
2αnhf(x∗
) − x∗
, zn − x∗
i
1 − αnα
≤
(1 − αn)2
+ αnα
1 − αnα
||xn − x∗
||2
+
2αnhf(x∗
) − x∗
, zn − x∗
i
1 − αnα
.
Since αn → 0, for any ε > 0, there exists a nonnegative integer n0 such that 1−ααn >
1
2
for all n ≥ n0. Note that
(2.19)
(1 − αn)2
+ αnα
1 − αnα
≤
1 − αn + α2
n
1 − αnα
≤ (1 − αn(1 − α)) +
α2
n
1 − αnα
≤ (1 − αn(1 − α)) + 2α2
n, ∀n ≥ n0.
Thus, substituting (2.19) into (2.18) and noting (2.3), we have
(2.20)
||zn − x∗
||2
≤ (1 − αn(1 − α))||xn − x∗
||2
+ 2α2
nM
+
2αnhf(x∗
) − x∗
, zn − x∗
i
1 − αnα
, ∀n ≥ n0,
where M = supn≥0 ||xn − x∗
||2
. And so, from (2.1), (2.20) and the convexity of
x 7→ ||x||2
, we have
(2.21)
||xn+1 − x∗
||2
≤ βn||xn − x∗
||2
+ (1 − βn)||zn − x∗
||2
≤ βn||xn − x∗
||2
+ (1 − βn){(1 − αn(1 − α))||xn − x∗
||2
+ 2α2
nM +
2αnhf(x∗
) − x∗
, zn − x∗
i
1 − αnα
}
≤ (1 − (1 − βn)αn(1 − α))||xn − x∗
||2
+ 2α2
nM + (1 − βn)
2αnhf(x∗
) − x∗
, zn − x∗
i
1 − αnα
≤ (1 − (1 − b)αn(1 − α))||xn − x∗
||2
+ 2α2
nM + (1 − βn)
2αnhf(x∗
) − x∗
, zn − x∗
i
1 − αnα
, ∀n ≥ n0
From (2.7), since we have ||xn − zn|| → 0, it follows from (2.17) that
(2.22)
lim sup
n→∞
hf(x∗
) − x∗
, zn − x∗
i
= lim sup
n→∞
hf(x∗
) − x∗
, zn − xn + xn − x∗
i
= lim sup
n→∞
hf(x∗
) − x∗
, xn − x∗
i ≤ 0.
Let
γn = max{0, hf(x∗
) − x∗
, zn − x∗
i}.
Then γn ≥ 0.
512 S. CHANG, Y. J. CHO, AND J. K. KIM
Next, we prove that
(2.23) γn → 0.
In fact, it follows from (2.22) that for any given ε > 0, there exists n1 ≥ n0 such
that
hf(x∗
) − x∗
, zn − x∗
i < ε.
and so we have
0 ≤ γn < ε as n → ∞.
By the arbitrariness of ε > 0, we get γn → 0. By virtue of {γn}, we can rewrite (2.21)
as follows:
(2.24)
||xn+1 − x∗
||2
≤ (1 − (1 − b)αn(1 − α))||xn − x∗
||2
+ 2α2
nM + 4αnγn, ∀n ≥ n0.
Therefore, taking an = ||xn − x∗
||2
, λn = (1 − b)αn(1 − α) and bn = 2α2
nM + 4αnγn,
by Lemma 1.4 and the conditions (i)–(iii), the sequence xn → x∗
as n → ∞. This
completes the proof.
From Theorem 2.1, we can obtain the following:
Theorem 2.2. Let H be a real Hilbert space, C be a nonempty closed convex
subset of H, T : C → H be a nonexpansive mapping with F(T) 6= ∅ and f : H → H
be a contraction mapping with a contractive constant α ∈ (0, 1). Let {αn}, {βn} be
two sequences in [0, 1] satisfying the following conditions:
(i) αn → 0;
P∞
n=0 αn = ∞; |1 − αn
αn+1
| → 0;
(ii) There exist a, b ∈ (0, 1) such that a ≤ βn ≤ b for all n ≥ 0.
For any x0 ∈ H, let {xn} be the sequences defined by
(2.25)
(
xn+1 = βnxn + (1 − βn)zn,
zn = αnf(un) + (1 − αn)T(un), ∀n ≥ 0,
where un = PCxn for all n ≥ 0 and PC is the metric projection from H onto C. Then
xn → x∗
∈ F(T) as n → ∞, where x∗
= PF (T)f(x∗
).
Proof. Taking φ(x, y) = 0 for all x, y ∈ C and rn = 1 for all n ≥ 1 in Theorem 2.1,
then we have
hy − un, un − xni ≥ 0, ∀y ∈ C.
This implies that un = PCxn. Therefore, the conclusion of Theorem 2.2 can be
obtained from Theorem 2.1 immediately.
Theorem 2.3. Let H be a real Hilbert space, C be a nonempty closed convex
subset of H, φ : C × C → R be a functional satisfying the conditions (A1)–(A4) such
that EP(φ) 6= ∅ and f : H → H be a contraction mapping with a contractive constant
α ∈ (0, 1). Let {αn}, {βn} be two sequences in [0, 1] and {rn} ⊂ (0, ∞) be a real
sequence satisfying the following conditions:
APPROXIMATING METHODS FOR EQUILIBRIUM PROBLEM 513
(i) αn → 0;
P∞
n=0 αn = ∞; |1 − αn
αn+1
| → 0;
(ii) There exist a, b ∈ (0, 1) such that a ≤ βn ≤ b for all n ≥ 0;
(iii) 0 < r < rn for all n ≥ 0 and |rn − rn+1| → 0 as n → ∞.
For any x0 ∈ H, let {xn} and {un} be the sequences defined by
(2.26)









φ(un, y) +
1
rn
hy − un un − xni ≥ 0, ∀y ∈ C,
xn+1 = βnxn + (1 − βn)zn,
zn = αnf(xn) + (1 − αn)un, ∀n ≥ 0.
Then xn → x∗
∈ EP(φ) as n → ∞, where x∗
= PEP (φ)f(x∗
).
Proof. Taking T = I in Theorem 2.1, then F(T) = H and so PF (T)∩EP (φ) =
PEP (φ). Therefore, the conclusion of Theorem 2.3 can be obtained from Theorem 2.1.
ACKNOWLEDGEMENTS: The first author was supported by the Natural Sci-
ence foundation of Yibin University (No 2005-Z003) and the third author was sup-
ported by the Korea Research Foundation Grant funded by the Korea Government
(MOEHRD, Basic Research Promotion Fund) (KRF-2006-311-C00201).
REFERENCES
[1] A. S. Antipin and S. Flam, Equilibrium programming using proximal-like algorithms, Math.
Program, 78(1):29–41, 1997.
[2] E. Blum and S. Oettli, From optimization and variational inequalities to equilibrium problems,
The Math. Student, 63(1-4):123–145, 1994.
[3] S. S. Chang, Some results for asymptotically pseudo-contractive mappings and asymptotically
nonexpansive mappings, Proc. Amer. Math. Soc., 129:845–853, 2001.
[4] P. L. Combettes and S. A. Hirstoaga, Equilibrium programming in Hilbert spaces, J. Nonlinear
Convex Anal., 6:117–135, 2005.
[5] K. Goebel and W. A. Kirk, Topics in Metric Fixed Point Theory,Cambridge Studies in Advanced
Mathematics, 28: Cambridge Univ., Press, 1990.
[6] L. S. Liu, Ishikawa and Manniterative processes with errors for nonlinear strongly accretive
mappings in Banach spaces, J. Math. Anal. Appl., 194:114–125, 1995.
[7] A. Moudafi, Viscosity methods for fixed points problems, J. Math. Anal. Appl., 241:46–55, 2000.
[8] A. Moudafi and M. Thera, Proximal and dynamical approaches to equilibrium problems, Lecture
Notes in Econom. and Math. Systems, Springer-Verlag, Berlin, 1990, 187–201.
[9] T. Suzuki, Strong convergence of Krasnoselskii and Mann’s type sequences for one parameter
nonexpansive semigroups without Bochner integrals, J. Math. Anal. Appl., 305:227–229, 2005.
[10] S. Takahashi and W. Takahashi, Viscosity approximation methods for Equilibrium problems and
fixed point problems in Hilbert spaces, J. Math. Anal. Appl., 2006, doi:10.1016/j.jmaa.2006.08.
036.
[11] H. K. Xu, Viscosity approximation methods for nonexpansive mappings, J. Math. Anal. Appl.,
298:279–291, 2004.

More Related Content

Similar to Approximation Methods Of Solutions For Equilibrium Problem In Hilbert Spaces

Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)IJERA Editor
 
Finance Enginering from Columbia.pdf
Finance Enginering from Columbia.pdfFinance Enginering from Columbia.pdf
Finance Enginering from Columbia.pdfCarlosLazo45
 
International Journal of Mathematics and Statistics Invention (IJMSI)
International Journal of Mathematics and Statistics Invention (IJMSI) International Journal of Mathematics and Statistics Invention (IJMSI)
International Journal of Mathematics and Statistics Invention (IJMSI) inventionjournals
 
The existence of common fixed point theorems of generalized contractive mappi...
The existence of common fixed point theorems of generalized contractive mappi...The existence of common fixed point theorems of generalized contractive mappi...
The existence of common fixed point theorems of generalized contractive mappi...Alexander Decker
 
Existance Theory for First Order Nonlinear Random Dfferential Equartion
Existance Theory for First Order Nonlinear Random Dfferential EquartionExistance Theory for First Order Nonlinear Random Dfferential Equartion
Existance Theory for First Order Nonlinear Random Dfferential Equartioninventionjournals
 
A common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spacesA common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spacesAlexander Decker
 
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastavaBIOLOGICAL FORUM
 
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...BRNSS Publication Hub
 
Numarical values
Numarical valuesNumarical values
Numarical valuesAmanSaeed11
 

Similar to Approximation Methods Of Solutions For Equilibrium Problem In Hilbert Spaces (20)

Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
 
Finance Enginering from Columbia.pdf
Finance Enginering from Columbia.pdfFinance Enginering from Columbia.pdf
Finance Enginering from Columbia.pdf
 
International Journal of Mathematics and Statistics Invention (IJMSI)
International Journal of Mathematics and Statistics Invention (IJMSI) International Journal of Mathematics and Statistics Invention (IJMSI)
International Journal of Mathematics and Statistics Invention (IJMSI)
 
AJMS_402_22_Reprocess_new.pdf
AJMS_402_22_Reprocess_new.pdfAJMS_402_22_Reprocess_new.pdf
AJMS_402_22_Reprocess_new.pdf
 
The existence of common fixed point theorems of generalized contractive mappi...
The existence of common fixed point theorems of generalized contractive mappi...The existence of common fixed point theorems of generalized contractive mappi...
The existence of common fixed point theorems of generalized contractive mappi...
 
Existance Theory for First Order Nonlinear Random Dfferential Equartion
Existance Theory for First Order Nonlinear Random Dfferential EquartionExistance Theory for First Order Nonlinear Random Dfferential Equartion
Existance Theory for First Order Nonlinear Random Dfferential Equartion
 
05_AJMS_300_21.pdf
05_AJMS_300_21.pdf05_AJMS_300_21.pdf
05_AJMS_300_21.pdf
 
Stochastic Assignment Help
Stochastic Assignment Help Stochastic Assignment Help
Stochastic Assignment Help
 
1. I. Hassairi.pdf
1.  I. Hassairi.pdf1.  I. Hassairi.pdf
1. I. Hassairi.pdf
 
1. I. Hassairi.pdf
1.  I. Hassairi.pdf1.  I. Hassairi.pdf
1. I. Hassairi.pdf
 
A common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spacesA common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spaces
 
E42012426
E42012426E42012426
E42012426
 
Puy chosuantai2
Puy chosuantai2Puy chosuantai2
Puy chosuantai2
 
05_AJMS_332_21.pdf
05_AJMS_332_21.pdf05_AJMS_332_21.pdf
05_AJMS_332_21.pdf
 
QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...
QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...
QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...
 
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava
 
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...
 
02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf
 
02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf
 
Numarical values
Numarical valuesNumarical values
Numarical values
 

More from Lisa Garcia

Writing Citations MLA Vs APA In 2023 - AtOnce
Writing Citations MLA Vs APA In 2023 - AtOnceWriting Citations MLA Vs APA In 2023 - AtOnce
Writing Citations MLA Vs APA In 2023 - AtOnceLisa Garcia
 
Pin By Kathleen Jones Ward On School Libraries Librar
Pin By Kathleen Jones Ward On School Libraries LibrarPin By Kathleen Jones Ward On School Libraries Librar
Pin By Kathleen Jones Ward On School Libraries LibrarLisa Garcia
 
College Thesis Template - Googl. Online assignment writing service.
College Thesis Template - Googl. Online assignment writing service.College Thesis Template - Googl. Online assignment writing service.
College Thesis Template - Googl. Online assignment writing service.Lisa Garcia
 
Term Paper On Money MyPaperWriter Custom Term Paper Writing Service
Term Paper On Money MyPaperWriter Custom Term Paper Writing ServiceTerm Paper On Money MyPaperWriter Custom Term Paper Writing Service
Term Paper On Money MyPaperWriter Custom Term Paper Writing ServiceLisa Garcia
 
Antique Images Digital Background Vintage Hand
Antique Images Digital Background Vintage HandAntique Images Digital Background Vintage Hand
Antique Images Digital Background Vintage HandLisa Garcia
 
Blank Paper To Type On Blank Paper By Montroytan
Blank Paper To Type On Blank Paper By MontroytanBlank Paper To Type On Blank Paper By Montroytan
Blank Paper To Type On Blank Paper By MontroytanLisa Garcia
 
2,000 No Essay Scholarship Grants For Col
2,000 No Essay Scholarship Grants For Col2,000 No Essay Scholarship Grants For Col
2,000 No Essay Scholarship Grants For ColLisa Garcia
 
Essay Writing Introduction. 24. Online assignment writing service.
Essay Writing Introduction. 24. Online assignment writing service.Essay Writing Introduction. 24. Online assignment writing service.
Essay Writing Introduction. 24. Online assignment writing service.Lisa Garcia
 
5 Types Of Technical Writing Technical Writer HQ
5 Types Of Technical Writing Technical Writer HQ5 Types Of Technical Writing Technical Writer HQ
5 Types Of Technical Writing Technical Writer HQLisa Garcia
 
015 Cheap Descriptive Ess. Online assignment writing service.
015 Cheap Descriptive Ess. Online assignment writing service.015 Cheap Descriptive Ess. Online assignment writing service.
015 Cheap Descriptive Ess. Online assignment writing service.Lisa Garcia
 
003 Essay For Master Degree Application Exampl
003 Essay For Master Degree Application Exampl003 Essay For Master Degree Application Exampl
003 Essay For Master Degree Application ExamplLisa Garcia
 
Best Quality Term Paper Writing Service - Expert
Best Quality Term Paper Writing Service - ExpertBest Quality Term Paper Writing Service - Expert
Best Quality Term Paper Writing Service - ExpertLisa Garcia
 
Essay Examples Self Evaluation Essay. Online assignment writing service.
Essay Examples Self Evaluation Essay. Online assignment writing service.Essay Examples Self Evaluation Essay. Online assignment writing service.
Essay Examples Self Evaluation Essay. Online assignment writing service.Lisa Garcia
 
Writing A Paper-Giffer Tenor. Online assignment writing service.
Writing A Paper-Giffer Tenor. Online assignment writing service.Writing A Paper-Giffer Tenor. Online assignment writing service.
Writing A Paper-Giffer Tenor. Online assignment writing service.Lisa Garcia
 
How To Write A Conversation In An Essay. Conversation Essay (600 Words
How To Write A Conversation In An Essay. Conversation Essay (600 WordsHow To Write A Conversation In An Essay. Conversation Essay (600 Words
How To Write A Conversation In An Essay. Conversation Essay (600 WordsLisa Garcia
 
Custom Essay Writing Professionals Help To Serv
Custom Essay Writing Professionals Help To ServCustom Essay Writing Professionals Help To Serv
Custom Essay Writing Professionals Help To ServLisa Garcia
 
Cheapest Custom Research Papers. Cheap Research Papers
Cheapest Custom Research Papers. Cheap Research PapersCheapest Custom Research Papers. Cheap Research Papers
Cheapest Custom Research Papers. Cheap Research PapersLisa Garcia
 
Examples Of Legal Writing . Online assignment writing service.
Examples Of Legal Writing . Online assignment writing service.Examples Of Legal Writing . Online assignment writing service.
Examples Of Legal Writing . Online assignment writing service.Lisa Garcia
 
How To Write An Expository Essa. Online assignment writing service.
How To Write An Expository Essa. Online assignment writing service.How To Write An Expository Essa. Online assignment writing service.
How To Write An Expository Essa. Online assignment writing service.Lisa Garcia
 
What Is A Narrative Essay - MarcostaroWarner
What Is A Narrative Essay - MarcostaroWarnerWhat Is A Narrative Essay - MarcostaroWarner
What Is A Narrative Essay - MarcostaroWarnerLisa Garcia
 

More from Lisa Garcia (20)

Writing Citations MLA Vs APA In 2023 - AtOnce
Writing Citations MLA Vs APA In 2023 - AtOnceWriting Citations MLA Vs APA In 2023 - AtOnce
Writing Citations MLA Vs APA In 2023 - AtOnce
 
Pin By Kathleen Jones Ward On School Libraries Librar
Pin By Kathleen Jones Ward On School Libraries LibrarPin By Kathleen Jones Ward On School Libraries Librar
Pin By Kathleen Jones Ward On School Libraries Librar
 
College Thesis Template - Googl. Online assignment writing service.
College Thesis Template - Googl. Online assignment writing service.College Thesis Template - Googl. Online assignment writing service.
College Thesis Template - Googl. Online assignment writing service.
 
Term Paper On Money MyPaperWriter Custom Term Paper Writing Service
Term Paper On Money MyPaperWriter Custom Term Paper Writing ServiceTerm Paper On Money MyPaperWriter Custom Term Paper Writing Service
Term Paper On Money MyPaperWriter Custom Term Paper Writing Service
 
Antique Images Digital Background Vintage Hand
Antique Images Digital Background Vintage HandAntique Images Digital Background Vintage Hand
Antique Images Digital Background Vintage Hand
 
Blank Paper To Type On Blank Paper By Montroytan
Blank Paper To Type On Blank Paper By MontroytanBlank Paper To Type On Blank Paper By Montroytan
Blank Paper To Type On Blank Paper By Montroytan
 
2,000 No Essay Scholarship Grants For Col
2,000 No Essay Scholarship Grants For Col2,000 No Essay Scholarship Grants For Col
2,000 No Essay Scholarship Grants For Col
 
Essay Writing Introduction. 24. Online assignment writing service.
Essay Writing Introduction. 24. Online assignment writing service.Essay Writing Introduction. 24. Online assignment writing service.
Essay Writing Introduction. 24. Online assignment writing service.
 
5 Types Of Technical Writing Technical Writer HQ
5 Types Of Technical Writing Technical Writer HQ5 Types Of Technical Writing Technical Writer HQ
5 Types Of Technical Writing Technical Writer HQ
 
015 Cheap Descriptive Ess. Online assignment writing service.
015 Cheap Descriptive Ess. Online assignment writing service.015 Cheap Descriptive Ess. Online assignment writing service.
015 Cheap Descriptive Ess. Online assignment writing service.
 
003 Essay For Master Degree Application Exampl
003 Essay For Master Degree Application Exampl003 Essay For Master Degree Application Exampl
003 Essay For Master Degree Application Exampl
 
Best Quality Term Paper Writing Service - Expert
Best Quality Term Paper Writing Service - ExpertBest Quality Term Paper Writing Service - Expert
Best Quality Term Paper Writing Service - Expert
 
Essay Examples Self Evaluation Essay. Online assignment writing service.
Essay Examples Self Evaluation Essay. Online assignment writing service.Essay Examples Self Evaluation Essay. Online assignment writing service.
Essay Examples Self Evaluation Essay. Online assignment writing service.
 
Writing A Paper-Giffer Tenor. Online assignment writing service.
Writing A Paper-Giffer Tenor. Online assignment writing service.Writing A Paper-Giffer Tenor. Online assignment writing service.
Writing A Paper-Giffer Tenor. Online assignment writing service.
 
How To Write A Conversation In An Essay. Conversation Essay (600 Words
How To Write A Conversation In An Essay. Conversation Essay (600 WordsHow To Write A Conversation In An Essay. Conversation Essay (600 Words
How To Write A Conversation In An Essay. Conversation Essay (600 Words
 
Custom Essay Writing Professionals Help To Serv
Custom Essay Writing Professionals Help To ServCustom Essay Writing Professionals Help To Serv
Custom Essay Writing Professionals Help To Serv
 
Cheapest Custom Research Papers. Cheap Research Papers
Cheapest Custom Research Papers. Cheap Research PapersCheapest Custom Research Papers. Cheap Research Papers
Cheapest Custom Research Papers. Cheap Research Papers
 
Examples Of Legal Writing . Online assignment writing service.
Examples Of Legal Writing . Online assignment writing service.Examples Of Legal Writing . Online assignment writing service.
Examples Of Legal Writing . Online assignment writing service.
 
How To Write An Expository Essa. Online assignment writing service.
How To Write An Expository Essa. Online assignment writing service.How To Write An Expository Essa. Online assignment writing service.
How To Write An Expository Essa. Online assignment writing service.
 
What Is A Narrative Essay - MarcostaroWarner
What Is A Narrative Essay - MarcostaroWarnerWhat Is A Narrative Essay - MarcostaroWarner
What Is A Narrative Essay - MarcostaroWarner
 

Recently uploaded

Roles & Responsibilities in Pharmacovigilance
Roles & Responsibilities in PharmacovigilanceRoles & Responsibilities in Pharmacovigilance
Roles & Responsibilities in PharmacovigilanceSamikshaHamane
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxpboyjonauth
 
Final demo Grade 9 for demo Plan dessert.pptx
Final demo Grade 9 for demo Plan dessert.pptxFinal demo Grade 9 for demo Plan dessert.pptx
Final demo Grade 9 for demo Plan dessert.pptxAvyJaneVismanos
 
DATA STRUCTURE AND ALGORITHM for beginners
DATA STRUCTURE AND ALGORITHM for beginnersDATA STRUCTURE AND ALGORITHM for beginners
DATA STRUCTURE AND ALGORITHM for beginnersSabitha Banu
 
Painted Grey Ware.pptx, PGW Culture of India
Painted Grey Ware.pptx, PGW Culture of IndiaPainted Grey Ware.pptx, PGW Culture of India
Painted Grey Ware.pptx, PGW Culture of IndiaVirag Sontakke
 
MARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized GroupMARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized GroupJonathanParaisoCruz
 
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxProudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxthorishapillay1
 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxNirmalaLoungPoorunde1
 
AmericanHighSchoolsprezentacijaoskolama.
AmericanHighSchoolsprezentacijaoskolama.AmericanHighSchoolsprezentacijaoskolama.
AmericanHighSchoolsprezentacijaoskolama.arsicmarija21
 
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfEnzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfSumit Tiwari
 
Blooming Together_ Growing a Community Garden Worksheet.docx
Blooming Together_ Growing a Community Garden Worksheet.docxBlooming Together_ Growing a Community Garden Worksheet.docx
Blooming Together_ Growing a Community Garden Worksheet.docxUnboundStockton
 
Procuring digital preservation CAN be quick and painless with our new dynamic...
Procuring digital preservation CAN be quick and painless with our new dynamic...Procuring digital preservation CAN be quick and painless with our new dynamic...
Procuring digital preservation CAN be quick and painless with our new dynamic...Jisc
 
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdfFraming an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdfUjwalaBharambe
 
Earth Day Presentation wow hello nice great
Earth Day Presentation wow hello nice greatEarth Day Presentation wow hello nice great
Earth Day Presentation wow hello nice greatYousafMalik24
 
Historical philosophical, theoretical, and legal foundations of special and i...
Historical philosophical, theoretical, and legal foundations of special and i...Historical philosophical, theoretical, and legal foundations of special and i...
Historical philosophical, theoretical, and legal foundations of special and i...jaredbarbolino94
 
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptxECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptxiammrhaywood
 
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsPresiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsanshu789521
 

Recently uploaded (20)

Roles & Responsibilities in Pharmacovigilance
Roles & Responsibilities in PharmacovigilanceRoles & Responsibilities in Pharmacovigilance
Roles & Responsibilities in Pharmacovigilance
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptx
 
Final demo Grade 9 for demo Plan dessert.pptx
Final demo Grade 9 for demo Plan dessert.pptxFinal demo Grade 9 for demo Plan dessert.pptx
Final demo Grade 9 for demo Plan dessert.pptx
 
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953330565 Low Rate Call Girls In Rohini  Delhi NCR9953330565 Low Rate Call Girls In Rohini  Delhi NCR
9953330565 Low Rate Call Girls In Rohini Delhi NCR
 
ESSENTIAL of (CS/IT/IS) class 06 (database)
ESSENTIAL of (CS/IT/IS) class 06 (database)ESSENTIAL of (CS/IT/IS) class 06 (database)
ESSENTIAL of (CS/IT/IS) class 06 (database)
 
DATA STRUCTURE AND ALGORITHM for beginners
DATA STRUCTURE AND ALGORITHM for beginnersDATA STRUCTURE AND ALGORITHM for beginners
DATA STRUCTURE AND ALGORITHM for beginners
 
Painted Grey Ware.pptx, PGW Culture of India
Painted Grey Ware.pptx, PGW Culture of IndiaPainted Grey Ware.pptx, PGW Culture of India
Painted Grey Ware.pptx, PGW Culture of India
 
MARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized GroupMARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized Group
 
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxProudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptx
 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
 
AmericanHighSchoolsprezentacijaoskolama.
AmericanHighSchoolsprezentacijaoskolama.AmericanHighSchoolsprezentacijaoskolama.
AmericanHighSchoolsprezentacijaoskolama.
 
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfEnzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
 
Blooming Together_ Growing a Community Garden Worksheet.docx
Blooming Together_ Growing a Community Garden Worksheet.docxBlooming Together_ Growing a Community Garden Worksheet.docx
Blooming Together_ Growing a Community Garden Worksheet.docx
 
Procuring digital preservation CAN be quick and painless with our new dynamic...
Procuring digital preservation CAN be quick and painless with our new dynamic...Procuring digital preservation CAN be quick and painless with our new dynamic...
Procuring digital preservation CAN be quick and painless with our new dynamic...
 
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdfFraming an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
 
Earth Day Presentation wow hello nice great
Earth Day Presentation wow hello nice greatEarth Day Presentation wow hello nice great
Earth Day Presentation wow hello nice great
 
Historical philosophical, theoretical, and legal foundations of special and i...
Historical philosophical, theoretical, and legal foundations of special and i...Historical philosophical, theoretical, and legal foundations of special and i...
Historical philosophical, theoretical, and legal foundations of special and i...
 
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptxECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
 
Presiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha electionsPresiding Officer Training module 2024 lok sabha elections
Presiding Officer Training module 2024 lok sabha elections
 
TataKelola dan KamSiber Kecerdasan Buatan v022.pdf
TataKelola dan KamSiber Kecerdasan Buatan v022.pdfTataKelola dan KamSiber Kecerdasan Buatan v022.pdf
TataKelola dan KamSiber Kecerdasan Buatan v022.pdf
 

Approximation Methods Of Solutions For Equilibrium Problem In Hilbert Spaces

  • 1. Dynamic Systems and Applications 17 (2008) 503-514 APPROXIMATION METHODS OF SOLUTIONS FOR EQUILIBRIUM PROBLEM IN HILBERT SPACES SHIH-SEN CHANG, YEOL JE CHO, AND JONG KYU KIM Department of Mathematics, Yibin University, Yibin, Sichuan 644007, China sszhang 1@yahoo.com.cn Department of Mathematics Education and the RINS, Gyeongsang National University, Chinju 660-701, Korea yjcho@gsnu.ac.kr Department of Mathematics Education, Kyungnam University Masan 631-701, Korea jongkyuk@kyungnam.ac.kr ABSTRACT. The purpose of this paper is, by using viscosity approximation methods, to find a common element of the set of solutions of an equilibrium problem and the set of fixed point of a nonexpansive mappings in a Hilbert space and to prove, under suitable conditions, some strong convergence theorems for approximating a solution of the problem under consideration. AMS (MOS) Subject Classification. 47H09, 47H10 1. INTRODUCTION PRELIMINARIES Throughout this paper, we always assume that H is a real Hilbert space, C is a nonempty closed convex subset of H and φ : C × C → R is a real functional with φ(x, x) = 0 for all x ∈ C. The “so called” equilibrium problem for functional φ is to finding a point x∗ ∈ C such that (1.1) φ(x∗ , y) ≥ 0, ∀y ∈ C. Denote the set of solutions of the equilibrium problem (1.1) by EP(φ). This equilibrium problem contains fixed point problem, optimization problem, variational inequality problem and Nash equilibrium problem as its special cases (see, for example, Blum and Oetti [2]). Recently, Antipin and Flam [1], Blum and Oettli [2], Moudafi [7], Moudafi et al. [8], Combettes and Hirstoaga [4] introduced and studied iterative schemes of finding the best approximation to the initial data when EP(φ) is nonempty and proved some strong convergence theorems in Hilbert spaces. Very recently, Takahashi and Takahashi [10] introduced a new iterative scheme by using the viscosity approximation methods (see Moudafi [7] and Xu [11]) for finding a common element of the set of solutions of the equilibrium problem (1.1) and the set Received April 14, 2007 1056-2176 $15.00 c Dynamic Publishers, Inc.
  • 2. 504 S. CHANG, Y. J. CHO, AND J. K. KIM of fixed points of a nonexpansive mapping in a Hilbert space and proved some strong convergence theorems. Their results extend and improve the corresponding results given in [4, 7]. Motivated and inspired by Combettes-Histoaga [4], Takahashi and Takahashi [10], the purpose of this paper is, by using viscosity approximation methods, to find a common element of the set of solutions of equilibrium problem (1.1) and the set of fixed points of a nonexpamsive mappings in Hilbert spaces and to establish some strong convergence theorems. For this purpose, first, we recall some definitions, lemmas and notations. In the sequel, we use xn ⇀ x and xn → x to denote the weak convergence and strong convergence of the sequence {xn} in H, respectively. In a Hilbert space H, for any x ∈ H, there exists a unique nearest point in C, denoted by PC(x), such that ||x − PCx|| ≤ ||x − y||, ∀y ∈ C. Such a mapping PC from H onto C is called the metric projection. We know that PC is nonexpansive. Further, for any x ∈ H and z ∈ C, z = PC(x) ⇔ hx − z, z − yi ≥ 0, ∀y ∈ C. For solving the equilibrium problem (1.1) for the functional φ : C × C → R, let us assume that φ satisfies the following conditions: (A1) φ(x, x) = 0, ∀x ∈ C; (A2) φ is monotone, i.e., φ(x, y) + φ(y, x) ≤ 0, ∀x, y ∈ C; (A3) for any x, y, z ∈ C the functional x 7→ φ(x, y) is upper-hemicontinuous, i.e., lim sup t→0+ φ(tz + (1 − t)x, y) ≤ φ(x, y), ∀x, y z ∈ C; (A4) y 7→ φ(x, y) is convex and lower semi-continuous. The following lemmas will be needed in proving our main results: Lemma 1.1. ([2]) Let H be a real Hilbert space, C be a nonempty closed convex subset of H, φ : C × C → R be a functional satisfying the conditions (A1)–(A4). Then, for any given x ∈ H and r > 0, there exists z ∈ C such that φ(z, y) + 1 r hy − z, z − xi ≥ 0, ∀y ∈ C.
  • 3. APPROXIMATING METHODS FOR EQUILIBRIUM PROBLEM 505 Lemma 1.2. ([4]) Let all the conditions in Lemma 1.1 are satisfied. For any r > 0 and x ∈ C, define a mapping Tr : H → C as follows: Tr(x) = {z ∈ C : φ(z, y) + 1 r hy − z, z − xi ≥ 0, ∀y ∈ C}, ∀x ∈ H. Then the following holds: (1) Tr is single-valued; (2) Tr is firmly nonexpansive, i.e., ||Trx − Try||2 ≤ hTrx − Try, x − yi, ∀x, y ∈ H, and so ||Trx − Try|| ≤ ||x − y||, ∀x, y ∈ H. (3) F(Tr) = EP(φ), ∀r > 0; (4) EP(φ) is a closed and convex set. Lemma 1.3. ([9]) Let X be a Banach space, {xn}, {yn} be two bounded sequences in X and {βn} be a sequence in [0, 1] satisfying 0 < lim inf n→∞ βn ≤ lim sup n→∞ βn < 1. Suppose that xn+1 = βnxn + (1 − βn)yn, ∀n ≥ 0 and lim sup n→∞ {||yn+1 − yn|| − ||xn+1 − xn||} ≤ 0, then limn→∞ ||yn − xn|| = 0. Lemma 1.4. ([6]) Let {an} and {bn} be two nonnegative real sequences satisfying the following condition: an+1 ≤ (1 − λn)an + bn, ∀n ≥ n0, where n0 is some nonnegative integer, {λn} is a sequence in (0, 1) with P∞ n=0 λn = ∞ and bn = ◦(λn). Then limn→∞ an = 0. Lemma 1.5. ([5]) Let X be a uniformly convex Banach space, C be a nonempty closed convex subset of X and T : C → X be a nonexpansive mapping with a fixed point. Then I − T is demiclosed in the sense that if {xn} is a sequence in C and if xn ⇀ x and (I − T)xn → 0, then (I − T)x = 0. Lemma 1.6. ([3]) Let E be a real Banach space, J : E → 2E∗ be the normalized duality mapping and x, y be any given points in E. Then the following conclusion holds: ||x + y||2 ≤ ||x||2 + 2hy, j(x + y)i, ∀j(x + y) ∈ J(x + y). Especially, if E = H is a real Hilbert space, then ||x + y||2 ≤ ||x||2 + 2hy, x + yi, ∀x, y ∈ H.
  • 4. 506 S. CHANG, Y. J. CHO, AND J. K. KIM 2. MAIN RESULTS In this section, we shall prove our main theorems in this paper: Theorem 2.1. Let H be a real Hilbert space, C be a nonempty closed convex subset of H, φ : C × C → R be a functional satisfying the conditions (A1)–(A4), T : C → H be a nonexpansive mapping with F(T) T EP(φ) 6= ∅ and f : H → H be a contraction mapping with a contractive constant α ∈ (0, 1). Let {αn}, {βn} be two sequences in [0, 1] and {rn} ⊂ (0, ∞) be a real sequence satisfying the following conditions: (i) αn → 0; P∞ n=0 αn = ∞; |1 − αn αn+1 | → 0; (ii) There exist a, b ∈ (0, 1) such that a ≤ βn ≤ b for all n ≥ 0; (iii) 0 < r < rn for all n ≥ 0 and |rn − rn+1| → 0 as n → ∞. where r, a and b are some positive constants. For any x0 ∈ H, let {xn} and {un} be the sequences defined by (2.1)          φ(un, y) + 1 rn hy − un un − xni ≥ 0, ∀y ∈ C, xn+1 = βnxn + (1 − βn)zn, zn = αnf(un) + (1 − αn)Tun, ∀n ≥ 0. Then xn → x∗ ∈ F(T) T EP(φ), where x∗ = PF (T)∩EP (φ)f(x∗ ). Proof. We divide the proof into six steps: (I) We first prove that the mapping PF (T)∩EP (φ)f : H → C has a unique fixed point. In fact, since f : H → H is a contraction and PF (T)∩EP (φ) : H → F(T) ∩ EP(φ) is also a contraction, we have ||PF (T)∩EP (φ)f(x) − PF (T)∩EP (φ)f(y)|| ≤ α||x − y||, ∀x, y ∈ H. Therefore, there exists a unique x∗ ∈ C such that x∗ = PF (T)∩EP (φ)f(x∗ ). (II) Now we prove that the sequences {xn} and {un} are bounded in H and C, respectively. In fact, from the definition of Tr in Lemma 1.2, we know that un = Trn xn. Therefore, for any p ∈ F(T) T EP(φ), we have (2.2) ||un − p|| = ||Trn xn − Trn p|| ≤ ||xn − p||. Therefore, it follows from (2.1) and (2.2) that ||xn+1 − p|| ≤ βn||xn − p|| + (1 − βn)||zn − p|| ≤ βn||xn − p|| + (1 − βn)||αn(f(un) − p) + (1 − αn)(Tun − p)||
  • 5. APPROXIMATING METHODS FOR EQUILIBRIUM PROBLEM 507 ≤ βn||xn − p|| + (1 − βn){αn||f(un) − f(p)|| + αn||f(p) − p|| + (1 − αn)||Tun − p||} ≤ βn||xn − p|| + (1 − βn)αnα||un − p|| + (1 − βn)αn||f(p) − p|| + (1 − βn)(1 − αn)||un − p|| ≤ βn||xn − p|| + (1 − βn)(1 − αn(1 − α))||xn − p|| + (1 − βn)αn||f(p) − p|| ≤ max{||xn − p||, ||f(p) − p|| 1 − α } ≤ · · · ≤ max{||x0 − p||, ||f(p) − p|| 1 − α }. This implies that {xn} is a bounded sequence in H. By (2.2), we know that {un} is a bounded sequence in C and so {Tun}, {f(un)}, {zn} all are bounded sequences in H. Let (2.3) M = sup n≥0 {||un − xn|| + ||xn − y||2 + ||f(un)|| + ||T(un)||}, where y ∈ H is some given point. (III) Now, we make an estimation for {||un+1 − un||}. By the definition of Tr, un = Trn xn and un+1 = Trn+1 xn+1. Hence we have (2.4) φ(un+1, y) + 1 rn+1 hy − un+1, un+1 − xn+1i ≥ 0, ∀y ∈ C, (2.5) φ(un, y) + 1 rn hy − un, un − xni ≥ 0, ∀y ∈ C. Take y = un+1 in (2.5) and y = un in (2.4). Then, adding the resulting inequalities and noting the condition (A2), we have hun+1 − un, un − xn rn − un+1 − xn+1 rn+1 i ≥ 0 and hence hun+1 − un, un − un+1 + un+1 − xn − rn rn+1 (un+1 − xn+1)i ≥ 0. This implies that ||un+1 − un||2 ≤ hun+1 − un, xn+1 − xn + (1 − rn rn+1 )(un+1 − xn+1)i ≤ ||un+1 − un||{||xn+1 − xn|| + |1 − rn rn+1 | · ||un+1 − xn+1||} Thus, by the condition (iii), we have (2.6) ||un+1 − un|| ≤ ||xn+1 − xn|| + |1 − rn rn+1 |||un+1 − xn+1|| ≤ ||xn+1 − xn|| + 1 r |rn+1 − rn| · M.
  • 6. 508 S. CHANG, Y. J. CHO, AND J. K. KIM (IV) Now we prove that ||Tun − un|| → 0. In fact, it follows from (2.1) and (2.6) that ||zn+1 − zn|| = ||αn+1f(un+1) + (1 − αn+1)Tun+1 − αnf(un) − (1 − αn)Tun|| = ||αn+1f(un+1) − αn+1f(un) + αn+1f(un) − αnf(un) + (1 − αn+1)Tun+1 − (1 − αn+1)Tun + (1 − αn+1)Tun − (1 − αn)Tun|| ≤ αn+1||f(un+1) − f(un)|| + 2|αn − αn+1|M + (1 − αn+1)||Tun+1 − Tun|| ≤ αn+1α||un+1 − un|| + 2|αn − αn+1|M + (1 − αn+1)||un+1 − un|| ≤ ||un+1 − un|| + 2|αn − αn+1|M ≤ ||xn+1 − xn|| + 1 r |rn+1 − rn||M + 2|1 − αn αn+1 |M It follows from the conditions (i) and (iii) that lim sup n→∞ {||zn+1 − zn|| − ||xn+1 − xn||} ≤ 0. By virtue of Lemma 1.3, we obtain that (2.7) ||xn − zn|| → 0 as n → ∞. From (2.1) and (2.7), we have (2.8) ||xn+1 − xn|| = (1 − βn)||xn − zn|| → 0, as n → ∞. It follows from (2.6), (2.8) and the condition (iii) that (2.9) ||un+1 − un|| → 0, as n → ∞. Since αn → 0 and {zn}, {f(un)}, {Tun} all are bounded, from (2.7), we have (2.10) ||xn − Tun|| ≤ ||xn − zn|| + ||zn − Tun|| ≤ ||xn − zn|| + αn||f(un) − Tun|| → 0. Furthermore, for any p ∈ F(T) T EP(φ), we have ||un − p||2 = ||Trn xn − Trn p||2 ≤ hTrn xn − Trn p, xn − pi = hun − p, xn − pi = 1 2 {||un − p||2 + ||xn − p||2 − ||xn − un||2 }. Hence we have (2.11) ||un − p||2 ≤ ||xn − p||2 − ||xn − un||2 .
  • 7. APPROXIMATING METHODS FOR EQUILIBRIUM PROBLEM 509 From the convexity of function x 7→ ||x||2 and (2.11), we have ||xn+1 − p||2 = ||βnxn + (1 − βn)zn − p||2 ≤ βn||xn − p||2 + (1 − βn)||zn − p||2 ≤ βn||xn − p||2 + (1 − βn){αn||f(un) − p||2 + (1 − αn)||Tun − p||2 } ≤ βn||xn − p||2 + (1 − βn)αn||f(un) − p||2 + (1 − αn)(1 − βn)||un − p||2 ≤ βn||xn − p||2 + (1 − βn)αn||f(un) − p||2 + (1 − βn)||un − p||2 ≤ βn||xn − p||2 + (1 − βn)αn||f(un) − p||2 + (1 − βn){||xn − p||2 − ||xn − un||2 } and so (1 − βn)||xn − un||2 ≤ ||xn − p||2 − ||xn+1 − p||2 + (1 − βn)αn||f(un) − p||2 ≤ (||xn − p|| − ||xn+1 − p||)(||xn − p|| + ||xn+1 − p||) + αn||f(un) − p||2 ≤ (||xn − xn+1||)(||xn − p|| + ||xn+1 − p||) + αn||f(un) − p||2 . Since αn → 0, {xn} and {f(un)} are bounded and ||xn − xn+1|| → 0, we have (2.12) ||xn − un|| → 0 as n → ∞ and so (2.13) ||Tun − un|| ≤ ||Tun − xn|| + ||xn − un|| → 0. The desired conclusion is proved. (V) Now, we prove that lim sup n→∞ hf(x∗ ) − x∗ , xn − x∗ i ≤ 0, where x∗ = PF (T)∩EP (φ)f(x∗ ). In fact, we can choose a subsequence {xnj } ⊂ {xn} such that (2.14) lim nj→∞ hf(x∗ ) − x∗ , xnj − x∗ , i = lim sup n→∞ hf(x∗ ) − x∗ , xn − x∗ i. Since {unj } is bounded, without loss of generality, we can assume that unj ⇀ w ∈ C. By (2.13), ||Tun − un|| → 0 and hence ||Tunj − unj || → 0. It follows from the demiclosed principle (see Lemma 1.4) that Tw = w and Tunj ⇀ w. Next, we prove that w ∈ F(T)∩EP(φ). It is sufficient to prove that w ∈ EP(φ). In fact, since un = Trn xn, we have φ(un, y) + 1 rn hy − un, un − xni ≥ 0, ∀y ∈ C.
  • 8. 510 S. CHANG, Y. J. CHO, AND J. K. KIM It follows from the condition (A2) that 1 rn hy − un, un − xni ≥ φ(y, un) and so (2.15) hy − unj , unj − xnj rnj i ≥ φ(y, unj ). Since ||unj −xnj || rnj ≤ ||unj −xnj || r → 0 and unj ⇀ w, by virtue of the condition (A4), we have lim inf nj →∞ φ(y, unj ) ≤ lim nj→∞ hy − unj , unj − xnj rnj i = 0, that is, (2.16) φ(y, w) ≤ 0, ∀y ∈ C. For any t ∈ (0, 1) and y ∈ C, let yt = ty + (1 − t)w. Then yt ∈ C and so we have φ(yt, w) ≤ 0. It follows from the conditions (A1), (A4) and (2.16) that 0 = φ(yt, yt) ≤ tφ(yt, y) + (1 − t)φ(yt, w) ≤ tφ(yt, y). This implies that φ(yt, y) ≥ 0 for all t ∈ (0, 1). Letting t → 0+ , by the condition (A3), we have φ(w, y) ≥ 0, ∀y ∈ C. This shows that w ∈ EP(φ) and so w ∈ F(T) ∩ EP(φ). Since x∗ = PF (T)∩EP (φ)f(x∗ ), unj ⇀ w and ||un − xn|| → 0 (see (2.12)), we have (2.17) lim sup n→∞ hf(x∗ ) − x∗ , xn − x∗ i = lim nj→∞ hf(x∗ ) − x∗ , xnj − x∗ i = lim nj→∞ hf(x∗ ) − x∗ , unj − (unj − xnj ) − x∗ i = hf(x∗ ) − x∗ , w − x∗ i ≤ 0. The desired conclusion is proved. (VI) Finally, we prove that xn → x∗ as n → ∞. In fact, it follows form (2.1) and Lemma 1.6 that ||zn − x∗ ||2 = ||αn(f(un) − x∗ ) + (1 − αn)(Tun − x∗ )||2 ≤ (1 − αn)2 ||Tun − x∗ ||2 + 2αnhf(un) − x∗ , zn − x∗ i ≤ (1 − αn)2 ||un − x∗ ||2 + 2αnhf(un) − f(x∗ ) + f(x∗ ) − x∗ , zn − x∗ i ≤ (1 − αn)2 ||un − x∗ ||2 + 2αnα||un − x∗ || · ||zn − x∗ || + 2αnhf(x∗ ) − x∗ , zn − x∗ i ≤ (1 − αn)2 ||un − x∗ ||2 + αnα{||un − x∗ ||2 + ||zn − x∗ ||2 }
  • 9. APPROXIMATING METHODS FOR EQUILIBRIUM PROBLEM 511 + 2αnhf(x∗ ) − x∗ , zn − x∗ i and so, from (2.2), (2.18) ||zn − x∗ ||2 ≤ (1 − αn)2 + αnα 1 − αnα ||un − x∗ ||2 + 2αnhf(x∗ ) − x∗ , zn − x∗ i 1 − αnα ≤ (1 − αn)2 + αnα 1 − αnα ||xn − x∗ ||2 + 2αnhf(x∗ ) − x∗ , zn − x∗ i 1 − αnα . Since αn → 0, for any ε > 0, there exists a nonnegative integer n0 such that 1−ααn > 1 2 for all n ≥ n0. Note that (2.19) (1 − αn)2 + αnα 1 − αnα ≤ 1 − αn + α2 n 1 − αnα ≤ (1 − αn(1 − α)) + α2 n 1 − αnα ≤ (1 − αn(1 − α)) + 2α2 n, ∀n ≥ n0. Thus, substituting (2.19) into (2.18) and noting (2.3), we have (2.20) ||zn − x∗ ||2 ≤ (1 − αn(1 − α))||xn − x∗ ||2 + 2α2 nM + 2αnhf(x∗ ) − x∗ , zn − x∗ i 1 − αnα , ∀n ≥ n0, where M = supn≥0 ||xn − x∗ ||2 . And so, from (2.1), (2.20) and the convexity of x 7→ ||x||2 , we have (2.21) ||xn+1 − x∗ ||2 ≤ βn||xn − x∗ ||2 + (1 − βn)||zn − x∗ ||2 ≤ βn||xn − x∗ ||2 + (1 − βn){(1 − αn(1 − α))||xn − x∗ ||2 + 2α2 nM + 2αnhf(x∗ ) − x∗ , zn − x∗ i 1 − αnα } ≤ (1 − (1 − βn)αn(1 − α))||xn − x∗ ||2 + 2α2 nM + (1 − βn) 2αnhf(x∗ ) − x∗ , zn − x∗ i 1 − αnα ≤ (1 − (1 − b)αn(1 − α))||xn − x∗ ||2 + 2α2 nM + (1 − βn) 2αnhf(x∗ ) − x∗ , zn − x∗ i 1 − αnα , ∀n ≥ n0 From (2.7), since we have ||xn − zn|| → 0, it follows from (2.17) that (2.22) lim sup n→∞ hf(x∗ ) − x∗ , zn − x∗ i = lim sup n→∞ hf(x∗ ) − x∗ , zn − xn + xn − x∗ i = lim sup n→∞ hf(x∗ ) − x∗ , xn − x∗ i ≤ 0. Let γn = max{0, hf(x∗ ) − x∗ , zn − x∗ i}. Then γn ≥ 0.
  • 10. 512 S. CHANG, Y. J. CHO, AND J. K. KIM Next, we prove that (2.23) γn → 0. In fact, it follows from (2.22) that for any given ε > 0, there exists n1 ≥ n0 such that hf(x∗ ) − x∗ , zn − x∗ i < ε. and so we have 0 ≤ γn < ε as n → ∞. By the arbitrariness of ε > 0, we get γn → 0. By virtue of {γn}, we can rewrite (2.21) as follows: (2.24) ||xn+1 − x∗ ||2 ≤ (1 − (1 − b)αn(1 − α))||xn − x∗ ||2 + 2α2 nM + 4αnγn, ∀n ≥ n0. Therefore, taking an = ||xn − x∗ ||2 , λn = (1 − b)αn(1 − α) and bn = 2α2 nM + 4αnγn, by Lemma 1.4 and the conditions (i)–(iii), the sequence xn → x∗ as n → ∞. This completes the proof. From Theorem 2.1, we can obtain the following: Theorem 2.2. Let H be a real Hilbert space, C be a nonempty closed convex subset of H, T : C → H be a nonexpansive mapping with F(T) 6= ∅ and f : H → H be a contraction mapping with a contractive constant α ∈ (0, 1). Let {αn}, {βn} be two sequences in [0, 1] satisfying the following conditions: (i) αn → 0; P∞ n=0 αn = ∞; |1 − αn αn+1 | → 0; (ii) There exist a, b ∈ (0, 1) such that a ≤ βn ≤ b for all n ≥ 0. For any x0 ∈ H, let {xn} be the sequences defined by (2.25) ( xn+1 = βnxn + (1 − βn)zn, zn = αnf(un) + (1 − αn)T(un), ∀n ≥ 0, where un = PCxn for all n ≥ 0 and PC is the metric projection from H onto C. Then xn → x∗ ∈ F(T) as n → ∞, where x∗ = PF (T)f(x∗ ). Proof. Taking φ(x, y) = 0 for all x, y ∈ C and rn = 1 for all n ≥ 1 in Theorem 2.1, then we have hy − un, un − xni ≥ 0, ∀y ∈ C. This implies that un = PCxn. Therefore, the conclusion of Theorem 2.2 can be obtained from Theorem 2.1 immediately. Theorem 2.3. Let H be a real Hilbert space, C be a nonempty closed convex subset of H, φ : C × C → R be a functional satisfying the conditions (A1)–(A4) such that EP(φ) 6= ∅ and f : H → H be a contraction mapping with a contractive constant α ∈ (0, 1). Let {αn}, {βn} be two sequences in [0, 1] and {rn} ⊂ (0, ∞) be a real sequence satisfying the following conditions:
  • 11. APPROXIMATING METHODS FOR EQUILIBRIUM PROBLEM 513 (i) αn → 0; P∞ n=0 αn = ∞; |1 − αn αn+1 | → 0; (ii) There exist a, b ∈ (0, 1) such that a ≤ βn ≤ b for all n ≥ 0; (iii) 0 < r < rn for all n ≥ 0 and |rn − rn+1| → 0 as n → ∞. For any x0 ∈ H, let {xn} and {un} be the sequences defined by (2.26)          φ(un, y) + 1 rn hy − un un − xni ≥ 0, ∀y ∈ C, xn+1 = βnxn + (1 − βn)zn, zn = αnf(xn) + (1 − αn)un, ∀n ≥ 0. Then xn → x∗ ∈ EP(φ) as n → ∞, where x∗ = PEP (φ)f(x∗ ). Proof. Taking T = I in Theorem 2.1, then F(T) = H and so PF (T)∩EP (φ) = PEP (φ). Therefore, the conclusion of Theorem 2.3 can be obtained from Theorem 2.1. ACKNOWLEDGEMENTS: The first author was supported by the Natural Sci- ence foundation of Yibin University (No 2005-Z003) and the third author was sup- ported by the Korea Research Foundation Grant funded by the Korea Government (MOEHRD, Basic Research Promotion Fund) (KRF-2006-311-C00201). REFERENCES [1] A. S. Antipin and S. Flam, Equilibrium programming using proximal-like algorithms, Math. Program, 78(1):29–41, 1997. [2] E. Blum and S. Oettli, From optimization and variational inequalities to equilibrium problems, The Math. Student, 63(1-4):123–145, 1994. [3] S. S. Chang, Some results for asymptotically pseudo-contractive mappings and asymptotically nonexpansive mappings, Proc. Amer. Math. Soc., 129:845–853, 2001. [4] P. L. Combettes and S. A. Hirstoaga, Equilibrium programming in Hilbert spaces, J. Nonlinear Convex Anal., 6:117–135, 2005. [5] K. Goebel and W. A. Kirk, Topics in Metric Fixed Point Theory,Cambridge Studies in Advanced Mathematics, 28: Cambridge Univ., Press, 1990. [6] L. S. Liu, Ishikawa and Manniterative processes with errors for nonlinear strongly accretive mappings in Banach spaces, J. Math. Anal. Appl., 194:114–125, 1995. [7] A. Moudafi, Viscosity methods for fixed points problems, J. Math. Anal. Appl., 241:46–55, 2000. [8] A. Moudafi and M. Thera, Proximal and dynamical approaches to equilibrium problems, Lecture Notes in Econom. and Math. Systems, Springer-Verlag, Berlin, 1990, 187–201. [9] T. Suzuki, Strong convergence of Krasnoselskii and Mann’s type sequences for one parameter nonexpansive semigroups without Bochner integrals, J. Math. Anal. Appl., 305:227–229, 2005. [10] S. Takahashi and W. Takahashi, Viscosity approximation methods for Equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl., 2006, doi:10.1016/j.jmaa.2006.08. 036. [11] H. K. Xu, Viscosity approximation methods for nonexpansive mappings, J. Math. Anal. Appl., 298:279–291, 2004.