# Approximations for Equilibrium Problems and Nonexpansive Semigroups

Authors: Huan-chun Wu; Cao-zong Cheng
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

We introduce a new iterative method for finding a common element of the set of solutions of an equilibrium problem and the set of all common fixed points of a nonexpansive semigroup and prove the strong convergence theorem in Hilbert spaces. Our result extends the recent result of Zegeye and Shahzad (2013). In the last part of the paper, by the way, we point out that there is a slight flaw in the proof of the main result in Shehu's paper (2012) and perfect the proof.


---

## Body

## 1. Introduction

LetH be a real Hilbert space, and let C be a nonempty closed convex subset of H. A mapping T:C→C is called nonexpansive if ∥Tx-Ty∥≤∥x-y∥ for all x,y∈C. We denote the set of fixed points of T by F(T). It is known that F(T) is closed and convex. A family 𝒮={T(t):0≤t<∞} of mappings from C into itself is called a nonexpansive semigroup on C if it satisfies the following conditions:(i)
T(0)x=x for all x∈C;(ii)
T(s+t)=T(s)T(t) for all s,t≥0;(iii)
∥T(s)x-T(s)y∥≤∥x-y∥ for all x,y∈C and s≥0;(iv)
for allx∈C,s↦T(s)x is continuous.We denote by F(𝒮) the set of all common fixed points of 𝒮; that is, F(𝒮)=⋂0≤t<∞‍F(T(t)). It is clear that F(𝒮) is a closed convex subset.The equilibrium problem forf:C×C→ℝ is to find x¯∈C such that f(x¯,y)≥0 for all y∈C. The set of such solutions is denoted by EP⁡(f). Numerous problems in physics, optimization, and economics can be reduced to find a solution of the equilibrium problem (for instance, see [1]).For solving equilibrium problem, we assume that the bifunctionf satisfies the following conditions:(A1)
f(x,x)=0 for all x∈C;(A2)
f is monotone; that is, f(x,y)+f(y,x)≤0 for any x,y∈C;(A3)
for eachx,y,z∈C, limsup⁡t↓0⁡f(tz+(1-t)x,y)≤f(x,y);(A4)
f(x,·) is convex and lower semicontinuous for each x∈C.Several methods have been proposed to solve the equilibrium problem; see [1–7]. For finding common fixed points of a nonexpansive semigroup, Nakajo and Takahashi [8] introduced a convergent sequence for nonexpansive semigroup 𝒮={T(t):0≤t<∞} as follows:
(1)x0=x∈C,yn=αnxn+(1-αn)1tn∫0tn‍T(s)xnds,Cn={z∈C:∥yn-z∥≤∥xn-z∥},Qn={z∈C:〈xn-z,x0-xn〉≥0},xn+1=PCn⋂Qn(x0).Some authors have paid more attention to find an elementp∈F(𝒮)∩EP⁡(f). Buong and Duong [9] constructed the following iterative sequence and proved the weak convergence theorem for an equilibrium problem and a nonexpansive semigroup in Hilbert spaces:
(2)x0∈H,uk∈C,f(uk,y)+1rk〈y-uk,uk-xk〉≥0∀y∈C,xk+1=μkxk+(1-μk)1tk∫0tk‍T(s)ukds.In 2012, Shehu [10] studied iterative methods for fixed point problem, variational inequality, and generalized mixed equilibrium problem and introduced a new algorithm which does not involve the CQ algorithm and viscosity approximation method. However, we discover that there is a slight flaw in the proof of Theorem 3.1 in [10].Motivated by Nakajo and Takahashi [8], Buong and Duong [9], and especially Shehu [10] and Zegeye and Shahzad [11], we present a new iterative method for finding a common element of the set of solutions of an equilibrium problem and the set of all common fixed points of a nonexpansive semigroup and prove the strong convergence theorem in Hilbert spaces. Our result extends the recent result of [11]. In the last part of the paper, we perfect and simplify the proof of Theorem 3.1 in [10].


## 2. Preliminaries

Throughout this paper, letH be a real Hilbert space with inner product 〈·,·〉 and norm ∥·∥, and let C be a nonempty closed convex subset of H. We write xn→x to indicate that the sequence {xn} converges strongly to x. Similarly, xn⇀x will symbolize weak convergence. It is well known that H satisfies Opial’s condition; that is, for any sequence {xn}⊂H with xn⇀x, we have
(3)liminf⁡n→∞∥xn-x∥<liminf⁡n→∞∥xn-y∥,∀y≠x.
For any x∈H, there exists a unique point PCx∈C such that
(4)∥x-PCx∥≤∥x-y∥,∀y∈C.PC is called the metric projection of H onto C. We know that PC is a nonexpansive mapping of H onto C and PC satisfies
(5)〈x-y,PCx-PCy〉≥∥PCx-PCy∥2,∀x,y∈H.
For x∈H and z∈C, we have
(6)z=PCx⟺〈x-z,y-z〉≤0,for everyy∈C.The following lemmas will be used in the proof of our results.Lemma 1 (see [1]).
LetC be a nonempty closed convex subset of H, and let f be a bifunction from C×C to ℝ satisfying (A1)–(A4). If r>0 and x∈H, then there exists z∈C such that
(7)f(z,y)+1r〈y-z,z-x〉≥0,∀y∈C.Lemma 2 (see [2]).
Forr>0, define a mapping  Tr:H→2C as follows:
(8)Tr(x)={z∈C:f(z,y)+1r〈y-z,z-x〉≥0,∀y∈C}.
Then the following hold:(i)
Tr is single valued;(ii)
Tr is firmly nonexpansive; that is, for any x,y∈H, 〈x-y,Trx-Try〉≥∥Trx-Try∥2;(iii)
F(Tr)=EP(f);(iv)
EP(f) is closed and convex.Lemma 3 (see [12]).
Suppose that (A1)–(A4) hold. Ifx,y∈H and r1,r2>0, then
(9)∥Tr2y-Tr1x∥≤∥y-x∥+|r2-r1|r2∥Tr2y-y∥.Lemma 4 (see [13]).
LetC be a nonempty bounded closed subset of H, and let {T(s):0≤s<∞} be a nonexpansive semigroup on C. Then, for every h≥0,
(10)lim⁡t→+∞⁡sup⁡x∈C⁡∥1t∫0t‍T(s)xds-T(h)1t∫0t‍T(s)xds∥=0.Lemma 5 (see [14]).
Let{xn} and {yn} be bounded sequences in a Banach space X, and let {βn} be a sequence in [0,1] with 0<liminf⁡n→∞⁡βn≤limsup⁡n→∞⁡βn<1. Suppose that xn+1=(1-βn)xn+βnyn  for all integers n≥1 and limsup⁡n→∞(∥yn+1-yn∥-∥xn+1-xn∥)≤0. Then, lim⁡n→∞⁡∥yn-xn∥=0.Lemma 6 (see [15]).
Let{an} be a sequence of nonnegative real numbers satisfying an+1≤(1-αn)an+αnβn, where(i)
{αn}⊂(0,1), ∑n=1∞αn=∞;(ii)
limsup⁡n→∞⁡βn≤0.Then, lim⁡n→∞an=0.


## 3. Strong Convergence Theorems

In this section, we introduce a new iterative method for finding a common element of the set of solutions of an equilibrium problem and the set of all common fixed points of a nonexpansive semigroup and prove the strong convergence theorem in Hilbert spaces.Theorem 7.
LetC be a nonempty closed convex subset of a real Hilbert space H, and let f be a bifunction from C×C to ℝ satisfying (A1)–(A4). Suppose that 𝒮={T(t):0≤t<∞} is a nonexpansive semigroup on C such that F(𝒮)∩EP(f)≠∅. For u∈H, let {xn}, {yn}, and {zn} be generated by
(11)x1∈Cchosen arbitrarily,yn=αnu+(1-αn)xn,zn∈C,such thatf(zn,y)+1rn〈y-zn,zn-yn〉≥0∀y∈C,xn+1=(1-βn)xn+βn1tn∫0tn‍T(s)znds,
where the real sequences {αn}, {βn} in (0,1) and {rn}⊂(0,∞) satisfy the following conditions:(1)
lim⁡n→∞⁡αn=0 and ∑n=1∞αn=∞;(2)
0<liminf⁡n→∞⁡βn≤limsup⁡n→∞⁡βn<1;(3)
0<c≤rn<∞,lim⁡n→∞|rn+1-rn|=0;(4)
{tn}⊂(0,∞), lim⁡n→∞tn=∞ and lim⁡n→∞(|tn+1-tn|/tn+1)=0.Then, the sequence {xn} converges strongly to PF(𝒮)∩EP(f)u.Proof.
Note that the setF(𝒮)∩EP⁡(f) is closed and convex since F(𝒮) and EP⁡(f) are closed and convex. For simplicity, we write Ω:=F(𝒮)∩EP⁡(f).
From Lemmas1 and 2, we have zn=Trnyn, and, for any p∈Ω,
(12)∥zn-p∥=∥Trnyn-Trnp∥≤∥yn-p∥.
Observe that
(13)∥yn-p∥≤αn∥u-p∥+(1-αn)∥xn-p∥.
It follows that
(14)∥xn+1-p∥=∥(1-βn)xn+βn1tn∫0tn‍T(s)znds-p∥≤(1-βn)∥xn-p∥≤+βn1tn∫0tn‍∥T(s)zn-T(s)p∥ds≤(1-βn)∥xn-p∥+βn∥zn-p∥≤(1-βn)∥xn-p∥≤+βn[αn∥u-p∥+(1-αn)∥xn-p∥]≤(1-αnβn)∥xn-p∥+αnβn∥u-p∥≤max⁡⁡{∥xn-p∥,∥u-p∥}.
From a simple inductive process, one has
(15)∥xn+1-p∥≤max⁡⁡{∥x1-p∥,∥u-p∥},
which yields that {xn} is bounded. So are {yn} and {zn}.
Setσn=(1/tn)∫0tnT(s)znds. For any p∈Ω, we have
(16)∥σn+1-σn∥=∥1tn+1∫0tn+1‍T(s)zn+1ds-1tn∫0tn‍T(s)znds∥=∥1tn+1∫0tn+1‍T(s)zn+1ds-1tn+1∫0tn+1‍T(s)znds+1tn+1∫0tn+1‍T(s)znds-1tn∫0tn‍T(s)znds∥=∥1tn+1∫0tn+1‍(T(s)zn+1-T(s)zn)ds+(1tn+1-1tn)∫0tn‍T(s)znds+1tn+1∫tntn+1‍T(s)znds∥=∥1tn+1∫0tn+1‍(T(s)zn+1-T(s)zn)ds+(1tn+1-1tn)∫0tn‍(T(s)zn-T(s)p)ds+(1tn+1-1tn)∫0tn‍T(s)pds+1tn+1∫tntn+1‍T(s)znds∥=∥1tn+1∫0tn+1(T(s)zn+1-T(s)zn)ds+(1tn+1-1tn)∫0tn‍(T(s)zn-T(s)p)ds+1tn+1∫tntn+1‍(T(s)zn-T(s)p)ds∥≤∥zn+1-zn∥+2|tn+1-tn|tn+1∥zn-p∥.
It follows from Lemma 3 that
(17)∥zn+1-zn∥≤∥yn+1-yn∥+|rn+1-rn|rn+1∥zn+1-yn+1∥.
Hence,
(18)∥σn+1-σn∥≤∥yn+1-yn∥+|rn+1-rn|rn+1∥zn+1-yn+1∥≤+2|tn+1-tn|tn+1∥zn-p∥≤∥αn+1u+(1-αn+1)xn+1-αnu-(1-αn)xn∥≤+|rn+1-rn|rn+1∥zn+1-yn+1∥+2|tn+1-tn|tn+1∥zn-p∥≤∥xn+1-xn∥+αn+1(∥u∥+∥xn+1∥)+αn(∥u∥+∥xn∥)≤+|rn+1-rn|c∥zn+1-yn+1∥+2|tn+1-tn|tn+1∥zn-p∥.
This implies that
(19)limsup⁡n→∞(∥σn+1-σn∥-∥xn+1-xn∥)≤0.
It follows from Lemma 5 that lim⁡n→∞∥σn-xn∥=0. Thus,
(20)lim⁡n→∞∥xn+1-xn∥=lim⁡n→∞βn∥σn-xn∥=0.
For anyp∈Ω, we have
(21)∥zn-p∥2=∥Trnyn-Trnp∥2≤〈yn-p,zn-p〉=12[∥yn-p∥2+∥zn-p∥2-∥zn-yn∥2].
Thus
(22)∥zn-p∥2≤∥yn-p∥2-∥zn-yn∥2.
From the convexity of ∥·∥2, it follows that
(23)∥xn+1-p∥2=∥(1-βn)(xn-p)+βn(1tn∫0tn‍T(s)znds-p)∥2≤(1-βn)∥xn-p∥2≤+βn∥1tn∫0tn‍(T(s)zn-T(s)p)ds∥2≤(1-βn)∥xn-p∥2+βn∥zn-p∥2≤(1-βn)∥xn-p∥2+βn[∥yn-p∥2-∥zn-yn∥2]≤(1-βn)∥xn-p∥2+βn[∥αnu+(1-αn)xn-p∥2-∥zn-yn∥2]≤(1-βn)∥xn-p∥2+βn[(1-αn)∥xn-p∥2+αn∥u-p∥2-∥zn-yn∥2].
Hence
(24)βn∥zn-yn∥2≤∥xn-p∥2-∥xn+1-p∥2+αnβn∥u-p∥2≤∥xn-xn+1∥(∥xn-p∥+∥xn+1-p∥)≤+αnβn∥u-p∥2.
Since lim⁡n→∞∥xn+1-xn∥=0 and lim⁡n→∞αn=0, one has
(25)lim⁡n→∞∥zn-yn∥=0.
Observe that
(26)lim⁡n→∞∥yn-xn∥=lim⁡n→∞αn∥u-xn∥=0.
As ∥zn-xn∥≤∥zn-yn∥+∥yn-xn∥, the following equality holds:
(27)lim⁡n→∞∥zn-xn∥=0.
Now we show that(28)lim⁡n→∞∥T(s)zn-zn∥=0,∀0≤s<∞.
In fact, we have
(29)∥T(s)zn-zn∥=∥T(s)zn-T(s)1tn∫0tn‍T(s)znds=+T(s)1tn∫0tn‍T(s)znds-1tn∫0tn‍T(s)znds=+1tn∫0tn‍T(s)znds-zn∥≤∥T(s)zn-T(s)1tn∫0tn‍T(s)znds∥≤+∥T(s)1tn∫0tn‍T(s)znds-1tn∫0tn‍T(s)znds∥≤+∥1tn∫0tn‍T(s)znds-zn∥≤2∥1tn∫0tn‍T(s)znds-zn∥≤+∥T(s)1tn∫0tn‍T(s)znds-1tn∫0tn‍T(s)znds∥.
Notice that
(30)∥1tn∫0tn‍T(s)znds-zn∥≤∥1tn∫0tn‍T(s)znds-xn∥+∥xn-zn∥=1βn∥xn+1-xn∥+∥xn-zn∥⟶0,asn⟶∞.
For any p∈Ω, let G={x∈C:∥x-p∥≤max⁡⁡{∥x1-p∥,∥u-p∥}}. It is easy to see that G is a bounded closed convex subset and T(s)G is a subset of G. Since
(31)∥zn-p∥=∥Trnyn-p∥≤(1-αn)∥xn-p∥+αn∥u-p∥≤max⁡⁡{∥x1-p∥,∥u-p∥},
the sequence {zn} is contained in G. It follows from Lemma 4 that
(32)lim⁡n→∞∥1tn∫0tn‍T(s)znds-T(s)1tn∫0tn‍T(s)znds∥=0.
From (29), (30), and (32), the expression (28) is obtained.
Next we prove that(33)limsup⁡n→∞〈u-x¯,xn-x¯〉≤0,
where x¯=PΩu. In order to show this inequality, we can choose a subsequence {xnj} of {xn} such that
(34)limsup⁡n→∞〈u-x¯,xn-x¯〉=lim⁡j→∞〈u-x¯,xnj-x¯〉.
Due to the boundedness of {xnj}, there exists a subsequence {xnji} of {xnj} such that xnji⇀ω. Without loss of generality, we assume that xnj⇀ω. From (27), we see that znj⇀ω. Since {znj}⊂C and C is closed and convex, we get ω∈C.
We first show thatω∈EP⁡(f). By zn=Trnyn, we have
(35)f(zn,y)+1rn〈y-zn,zn-yn〉≥0,∀y∈C.
It follows from the monotonicity of f that
(36)1rn〈y-zn,zn-yn〉≥f(y,zn),∀y∈C.
Replacing n by nj, we obtain
(37)〈y-znj,znj-ynjrnj〉≥f(y,znj),∀y∈C.
From (25), (27), and (A4), we have
(38)f(y,ω)≤0,∀y∈C.
For 0<t≤1, y∈C, set yt=ty+(1-t)ω. We have yt∈C and f(yt,ω)≤0. Hence
(39)0=f(yt,yt)≤tf(yt,y)+(1-t)f(yt,ω)≤tf(yt,y).
Dividing by t, we see that
(40)f(yt,y)≥0.
Letting t↓0 and from (A3), we get
(41)f(ω,y)≥0,∀y∈C.
That is, ω∈EP⁡(f).
Second, we prove thatω∈F(𝒮). Note that the equality (27) implies that znj⇀ω. Suppose for contradiction that ω∉F(𝒮); that is,
(42)there existss0>0such thatT(s0)ω≠ω.
Then from Opial’s condition and (28), we obtain
(43)liminf⁡j→∞∥znj-ω∥<liminf⁡j→∞∥znj-T(s0)ω∥=liminf⁡j→∞∥znj-T(s0)znj+T(s0)znj-T(s0)ω∥=liminf⁡j→∞∥T(s0)znj-T(s0)ω∥≤liminf⁡j→∞∥znj-ω∥,
which is a contradiction. Therefore, ω∈F(𝒮). Consequently, one gets ω∈Ω.
From (34) and the property of metric projection, we have
(44)limsup⁡n→∞〈u-x¯,xn-x¯〉=lim⁡j→∞〈u-x¯,xnj-x¯〉=〈u-x¯,ω-x¯〉≤0.
The inequality (33) arrives.
Finally we show thatxn→x¯. From (11), we have
(45)∥xn+1-x¯∥2=∥(1-βn)xn+βn1tn∫0tn‍T(s)znds-x¯∥2≤(1-βn)∥xn-x¯∥2+βn∥zn-x¯∥2≤(1-βn)∥xn-x¯∥2+βn∥yn-x¯∥2≤(1-αnβn)∥xn-x¯∥2≤+αnβn[2(1-αn)〈u-x¯,xn-x¯〉+αn∥u-x¯∥2].
It follows from (33) and Lemma 6 that {xn} converges strongly to x¯.Remark 8.
LetH=ℝ and C=[0,1]. Setting f(x,y)=y2-x2, we see that f(x,y) satisfies (A1)–(A4). For 0≤t<+∞, let
(46)T(t)x=x1+tx,∀x∈[0,1].
Thus, it follows that 𝒮={T(t):0≤t<∞} is a nonexpansive semigroup such that F(𝒮)∩EP⁡(f)={0}. If we take
(47)αn=1n+1,β1=β2=12,βn=12-1n,∀n≥3,rn≡c>0,tn=n,
then all assumptions and conditions in Theorem 7 are satisfied.Remark 9.
Takingu=0 in Theorem 7, we obtain the iterative method for minimum-norm solution of an equilibrium problem and a nonexpansive semigroup.
As a direct consequence of Theorem7, we obtain the following corollary.Corollary 10.
LetC be a nonempty closed convex subset of a real Hilbert space H, and assume that 𝒮={T(t):0≤t<∞} is a nonexpansive semigroup on C such that F(𝒮)≠∅. Let {αn} and {βn} be real sequences in (0,1), and let {xn} and {zn} be generated by
(48)x1∈Cchosen arbitrarily,zn=PC[(1-αn)xn],xn+1=(1-βn)xn+βn1tn∫0tn‍T(s)znds.
Suppose that the following conditions are satisfied:(1)
lim⁡n→∞αn=0 and ∑n=1∞αn=∞;(2)
0<liminf⁡n→∞βn≤limsup⁡n→∞βn<1;(3)
{tn}⊂(0,∞), lim⁡n→∞tn=∞, and lim⁡n→∞(|tn+1-tn|/tn+1)=0.Then the sequence {xn} converges strongly to PF(𝒮)0.Proof.
Lettingf(x,y)=0 for all x,y∈C, rn=1, and u=0 in Theorem 7, we get the result.Remark 11.
Corollary10 extends the recent results of Zegeye and Shahzad [11, Corollaries 3.2 and 3.3] from finite family of nonexpansive mappings to a nonexpansive semigroup.


## 4. A Note on Shehu’s Paper “Iterative Method for Fixed Point Problem, Variational Inequality and Generalized Mixed Equilibrium Problems with Applications”

In 2012, Shehu [10] studied iterative methods for fixed point problem, variational inequality, and generalized mixed equilibrium problem and gave an interesting convergence theorem. However, there is a slight flaw in the proof of the main result (Theorem 3.1 in [10]).Shehu obtained the following result (for more details, see [10]).Theorem 12 (see [10]).
LetK be a closed convex subset of a real Hilbert space H, let F be a bifunction from K×K satisfying (A1)–(A4), let φ:K→ℝ∪{+∞} be a proper lower semicontinuous and convex function with assumption (B1) or (B2), let A be a μ-Lipschitzian, relaxed (λ,γ)-cocoercive mapping of K into H, and let ψ be an α-inverse, strongly monotone mapping of K into H. Suppose that T:K→K is a nonexpansive mapping of K into itself such that Ω:=F(T)∩VI(K,A)∩GMEP≠∅. Let {αn} and {βn} be two real sequences in (0,1) and {rn},{sn}⊂(0,∞). Let {xn}, {yn}, and {un} be generated by x1∈K,
(49)yn=PK[(1-αn)xn],un=Trn(F,φ)(yn-rnψyn),xn+1=(1-βn)xn+βnTPK(un-snAun).
Suppose that the following conditions are satisfied:(a)
lim⁡n→∞⁡αn=0 and ∑n=1∞αn=∞;(b)
0<lim⁡inf⁡n→∞⁡βn≤lim⁡sup⁡n→∞⁡βn<1;(c)
0<a≤sn≤b<2(γ-λμ2)/μ2,lim⁡n→∞⁡|sn+1-sn|=0;(d)
0<c≤rn≤d<2α,lim⁡n→∞⁡|rn+1-rn|=0.Then, the sequence {xn} converges strongly to an element of F(T)∩VI(K,A)∩GMEP.This theorem is proved in [10] by the following steps.Step 1.
The sequence{xn} is bounded.Step 2.
The following equalities hold:(50)lim⁡n→∞∥Aun-Ax*∥=0,lim⁡n→∞∥ψyn-ψx*∥=0,∀x*∈Ω.Step 3.
Ifω is a weak limit of {xnj} which is a subsequence of {xn}, then ω∈Ω.Step 4.
The sequence{xn} converges strongly to ω.In Step4, in order to show that the sequence {xn} converges strongly to ω, the author shows the inequality limsup⁡n→∞⁡〈-ω,xn-ω〉≤0 by defining a mapping ϕ:H→R as follows: ϕ(x)=μn∥xn-x∥2, where μ is a Banach limit. It is proved that the set K*={x∈H:ϕ(x)=min⁡u∈H⁡ϕ(u)}≠∅ and K*∩F(T)≠∅. An element of K*∩F(T) is taken arbitrarily and is denoted by ω. Of course, the element ω is not necessarily the weak sequential cluster point of {xn}. However, in Step 3, the symbol ω stands for the weak limit of {xnj} which is a subsequence of {xn}. In the sequel, the author obtains
(51)∥xn+1-ω∥2≤(1-βn)∥xn-ω∥2+βn∥yn-ω∥2.
The meaning of the element ω in (51) is ambiguous. It is difficult to ensure consistency.Now, we perfect and simplify the proof of Step4. According to the equality in Step 2, lim⁡n→∞⁡∥Aun-Ax*∥=0, for all x*∈Ω, we see that the set {Ax*:x*∈Ω} contains only one element. Since A is a relaxed (λ,γ)-cocoercive mapping of K into H, that is, there exist λ,γ>0 such that
(52)〈Ax-Ay,x-y〉≥-λ∥Ax-Ay∥2+γ∥x-y∥2,∀x,y∈K,
it follows that the mapping A is one-to-one. Therefore, the set Ω is a singleton. By Step 3, the sequence {xn} possesses only one weak sequential cluster point. It follows from Lemma 2.38 in [16] that {xn} converges weakly to ω and so
(53)∥xn+1-ω∥2≤(1-βn)∥xn-ω∥2+βn∥yn-ω∥2≤(1-βn)∥xn-ω∥2+βn∥(1-αn)xn-ω∥2≤(1-βn)∥xn-ω∥2≤+βn[(1-αn)∥xn-ω∥2≤+βn+2αn(1-αn)〈-ω,xn-ω〉+αn2∥ω∥2]≤(1-αnβn)∥xn-ω∥2≤+αnβn[2(1-αn)〈-ω,xn-ω〉+αn∥ω∥2].
Since {xn} converges weakly to ω, it follows from Lemma 2.2 in [10] or Lemma 6 in this paper that {xn} converges strongly to ω∈Ω.



---

*Source: 351372-2014-03-16.xml*