Strong Convergence Theorem by An Extragradient Method For Fixed Point Problems and Variational Inequality Problems

TAIWANESE JOURNAL OF MATHEMATICS
Vol. 10, No. 5, pp. 1293-1303, September 2006

This paper is available online at http://www.math.nthu.edu.tw/tjm/
STRONG CONVERGENCE THEOREM BY AN EXTRAGRADIENT

METHOD FOR FIXED POINT PROBLEMS AND
VARIATIONAL INEQUALITY PROBLEMS
Lu-Chuan Zeng and Jen-Chih Yao
Abstract. In this paper we introduce an iterative process for finding a common

element of the set of fixed points of a nonexpansive mapping and the set
of solutions of a variational inequality problem for a monotone, Lipschitz
continuous mapping. The iterative process is based on so-called extragradient
method. We obtain a strong convergence theorem for two sequences generated
by this process.
1. INTRODUCTION
Let H be a real Hilbert space with inner product ·, · and norm ·, respectively.
Let C be a nonempty closed convex subset of H and let PC : H → C be the metric
projection of H onto C.
Definition 1.1. Let A : C → H be a mapping of C into H.

(i) A is called monotone if
Au − Av, u − v ≥ 0 ∀u, v ∈ C;
(ii) A is called α-inverse-strongly-monotone (see [1], [3]) if there exists a positive

real number α such that
Au − Av, u − v ≥ αAu − Av2 ∀u, v ∈ C.

Received November 5, 2004; accepted February 3, 2005.
Communicated by Wen-Wei Lin.
2000 Mathematics Subject Classification: 49J30, 47H09, 47J20.
Key words and phrases: Extragradient method, Fixed point, Monotone mapping, Nonexpansive map-
ping, Variational inequality.
1
This research was partially supported by a grant from the National Science Council.
2
This research was partially supported by the Teaching and Research Award Fund for Outstanding
Young Teachers in Higher Education Institutions of MOE, China and the Dawn Program Foundation
in Shanghai.
1293
1294 Lu-Chuan Zeng and Jen-Chih Yao
It is easy to see that an α-inverse-strongly-monotone mapping A is monotone

and Lipschitz continuous. We consider the following variational inequality problem
(VI(A, C)): find a u ∈ C such that
Au, v − u ≥ 0 ∀v ∈ C.
The set of solutions of the variational inequality problem is denoted by Ω. A mapping

S : C → C is called nonexpansive (see [7]) if
Su − Sv ≤ u − v ∀u, v ∈ C.
We denote by F (S) the set of fixed points of S.

For finding an element of F (S) ∩ Ω under the assumption that a set C ⊂ H
is nonempty, closed and convex, a mapping S : C → C is nonexpansive and a
mapping A : C → H is α-inverse-strongly-monotone, Takahashi and Toyoda [8]
introduced the following iterative scheme:
xn+1 = αn xn + (1 − αn )SPC (xn − λn Axn ) ∀n ≥ 0, (1.1)
where x0 = x ∈ C, {αn } is a sequence in (0, 1) and {λ n } is a sequence in (0, 2α).

They proved that if F (S) ∩ Ω is nonempty, then the sequence {xn } generated by
(1.1) converges weakly to some z ∈ F (S) ∩ Ω. On the other hand for solving the
variational inequality problem in a finite-dimensional Euclidean space R n under the
assumption that a set C ⊂ R n is nonempty, closed and convex, a mapping A : C →
Rn is monotone and k-Lipschitz continuous and Ω is nonempty, Korpelevich [2]
introduced the following so-called extragradient method:


 x0 = x ∈ Rn ,

(1.2) x̄n = PC (xn − λAxn ),



xn+1 = PC (xn − λAx̄n ) ∀n ≥ 0
where λ ∈ (0, 1/k). He showed that the sequences {x n } and {x̄n } generated by
(1.2) converge to the same point z ∈ Ω.
Further motivated by the idea of Korpelevich’s extragradient method, Nadezhk-
ina and Takahashi [10] introduced an iterative process for finding a common element
of the set of fixed points of a nonexpansive mapping and the set of solutions of
a variational inequality problem. They proved the following weak convergence
theorem for two sequences generated by this process.
Theorem 1.1 [10, Theorem 3.1]. Let C be a nonempty closed convex subset of
a real Hilbert space H. Let A : C → H be a monotone, k-Lipschitz continuous
Extragradient Method for Fixed Point Problems and VIP 1295
mapping and S : C → C be a nonexpansive mapping such that F (S) ∩ Ω = ∅. Let

{xn }, {yn } be the sequences generated by


 x0 = x ∈ H,

(1.3) yn = PC (xn − λn Axn ),



xn+1 = αn xn + (1 − αn )SPC (xn − λn Ayn ) ∀n ≥ 0
where {λn} ⊂ [a, b] for some a, b ∈ (0, 1/k) and {α n } ⊂ [c, d] for some c, d ∈
(0, 1). Then the sequences {xn }, {yn } converge weakly to the same point z ∈
F (S) ∩ Ω where
z = lim PF (S)∩Ω xn .
n→∞
In this paper inspired by Nadezhkina and Takahashi’s iterative process (1.3), we

introduce the following iterative process


 x0 = x ∈ H,

(∗) yn = PC (xn − λn Axn ),



xn+1 = αn x0 + (1 − αn )SPC (xn − λn Ayn ) ∀n ≥ 0
where {λn } and {αn } satisfy the conditions:

(a) {λn k} ⊂ (0, 1 − δ) for some δ ∈ (0, 1);
∞
(b) {αn } ⊂ (0, 1), n=0 αn = ∞, limn→∞ αn = 0.
It is shown that the sequences {x n }, {yn } generated by (∗) converge strongly to

the same point PF (S)∩Ω (x0 ) provided limn→∞ xn − xn+1 = 0.
2. PRELIMINARIES
Let H be a real Hilbert space with inner product ·, · and norm ·, respectively.
Let C be a nonempty closed convex subset of H. We write xn x to indicate
that the sequence {x n } converges weakly to x and xn → x to indicate that {x n }
converges strongly to x. For every point x ∈ H, there exists a unique nearest point
in C, denoted by PC x, such that x − PC x ≤ x − y ∀y ∈ C. PC is called the
metric projection of H onto C. It is known that PC is a nonexpansive mapping of
H onto C. It is also known that PC is characterized by the following properties
(see [7] for more details): PC x ∈ C and for all x ∈ H, y ∈ C,
(2.1) x − PC x, PC x − y ≥ 0,
(2.2) x − y2 ≥ x − PC x2 + y − PC x2 .

Let A : C → H be a mapping. It is easy to see from (2.2) that the following
implications hold:
(2.3) u ∈ Ω ⇔ u = PC (u − λAu) ∀λ > 0.
A set-valued mapping T : H → 2H is called monotone if for all x, y ∈ H, f ∈
T x and g ∈ T y, we have x − y, f − g ≥ 0. A monotone mapping T : H → 2H
is maximal if its graph G(T ) is not properly contained in the graph of any other
monotone mapping. It is known that a monotone mapping T is maximal if and only
if for (x, f ) ∈ H × H, x − y, f − g ≥ 0 for all (y, g) ∈ G(T ), then f ∈ T x.
Let A : C → H be a monotone, k-Lipschitz continuous mapping and NC v be the
normal cone to C at v ∈ C, i.e., NC v = {w ∈ H : v − u, w ≥ 0, ∀u ∈ C}.
Define
Av + NC v, if v ∈ C,
Tv =
∅, if v ∈
/ C.
Then T is maximal monotone and 0 ∈ T v if and only if v ∈ Ω; see [5].
In order to prove the main result in Section 3, we shall use the following lemmas
in the sequel.
Lemma 2.1 [6, Lemma 2.1]. Let {sn } be a sequence of nonnegative numbers
satisfying the conditions: s n+1 ≤ (1 − αn )sn + αn βn , ∀ n ≥ 0 where {αn } and
{βn } are sequences of real numbers such that

(i) {αn } ⊂ [0, 1] and ∞ n=0 αn = ∞, or equivalently,
∞ n
n=0 (1 − αn ) := limn→∞ k=0 (1 − αk ) = 0;
(ii) limsupn→∞ βn ≤ 0, or

(ii) n αn βn is convergent.
Then limn→∞ sn = 0.
Lemma 2.2 [4]. Demiclosedness Principle. Assume that S is a nonexpansive

self-mapping of a nonempty closed convex subset C of a real Hilbert space H. If
F (S) = ∅, then I − S is demiclosed; that is, whenever {x n } is a sequence in C
weakly converging to some x ∈ C and the sequence {(I −S)x n} strongly converges
to some y, it follows that (I − S)x = y. Here I is the identity operator of H.
The following lemma is an immediate consequence of an inner product.
Lemma 2.3. In a real Hilbert space H, there holds the inequality:

x + y2 ≤ x2 + 2y, x + y ∀x, y ∈ H.
3. STRONG CONVERGENCE THEOREM
Now we can state and prove the main result in this paper.
Theorem 3.1. Let C be a nonempty closed convex subset of a real Hilbert

space H. Let A : C → H be a monotone, k-Lipschitz continuous mapping and
S : C → C be a nonexpansive mapping such that F (S) ∩ Ω = ∅. Let {x n }, {yn }
be the sequences generated by


 x0 = x ∈ H,

(∗) yn = PC (xn − λn Axn ),



xn+1 = αn x0 + (1 − αn )SPC (xn − λn Ayn ) ∀n ≥ 0
where {λn} and {αn } satisfy the conditions:
(a) {λn k} ⊂ (0, 1 − δ) for some δ ∈ (0, 1);
∞
(b) {αn } ⊂ (0, 1), n=0 αn = ∞, limn→∞ αn = 0.
Then the sequences {x n }, {yn } converge strongly to the same point PF (S)∩Ω (x0 )
provided
lim xn − xn+1 = 0.
n→∞
Proof. We divide the proof into several steps.
Step 1. {xn } is bounded and so is {t n } where tn = PC (xn − λn Ayn ) ∀n ≥ 0.

Indeed let u ∈ F (S) ∩ Ω. From (2.2) it follows that
tn − u2 ≤ xn − λn Ayn − u2 − xn − λn Ayn − tn 2

= xn − u2 − xn − tn 2 + 2λn Ayn , u − tn
= xn − u2 − xn − tn 2
+2λn (Ayn − Au, u − yn + Au, u − yn + Ayn , yn − tn )
≤ xn − u2 − xn − tn 2 + 2λn Ayn , yn − tn
= xn − u2 − xn − yn 2 − 2xn − yn , yn − tn − yn − tn 2
+2λn Ayn , yn − tn
= xn − u2 − xn − yn 2 −yn −tn 2 +2xn −λn Ayn −yn , tn −yn .
Further from (2.1) we obtain
xn − λn Ayn − yn , tn − yn
= xn − λn Axn − yn , tn − yn + λn Axn − λn Ayn , tn − yn
≤ λn Axn − λn Ayn , tn − yn

≤ λn kxn − yn tn − yn .
Hence we have
tn −u2 ≤ xn −u2 −xn −yn 2 −yn −tn 2 +2λn kxn −yn tn −yn
≤ xn −u2 −xn −yn 2 −yn −tn 2 +λ2n k 2 xn −yn 2 +yn −tn 2
(3.1)
≤ xn −u2 +(λ2n k 2 −1)xn −yn 2
≤ xn −u2 .
Now by induction, we have
(3.2) xn −u ≤ x0 − u ∀n ≥ 0.
Indeed when n = 0, it follows from (3.1) that
x1 − u = α0 x0 +(1 − α0 )St0 − u

= α0 (x0 − u) + (1 − α0 )(St0 − u)
≤ α0 x0 − u + (1 − α0 )t0 − u
≤ α0 x0 − u + (1 − α0 )x0 − u
= x0 − u
which implies that (3.2) holds for n = 0. Suppose that (3.2) holds for n ≥ 1. Then
we have xn − u ≤ x0 − u. This together with (3.1) implies that
xn+1 − u = αn x0 + (1 − αn )Stn − u

= αn (x0 − u) + (1 − αn )(Stn − u)
≤ αn x0 − u + (1 − αn )Stn − u
≤ αn x0 − u + (1 − αn )tn − u
≤ αn x0 − u + (1 − αn )xn − u
≤ αn x0 − u + (1 − αn )x0 − u
= x0 − u.
This shows that (3.2) holds for n + 1. Therefore (3.2) holds for all n ≥ 0; i.e., {xn }
is bounded. So it follows from (3.1) that tn − u ≤ x0 − u ∀n ≥ 0, i.e., {tn }
is also bounded.
Step 2. limn→∞ xn − yn = 0. Indeed from (∗) and (3.1) we get
xn+1 − u2 = αn x0 + (1 − αn )Stn − u2

= αn (x0 − u) + (1 − αn )(Stn − u)2
≤ αn x0 − u2 + (1 − αn )Stn − u2
≤ αn x0 − u2 + (1 − αn )tn − u2
≤ αn x0 − u2 + (1 − αn )(xn − u2 + (λ2nk2 − 1)xn − yn 2 )
≤ αn x0 − u2 + xn − u2 + (λ2n k2 − 1)xn − yn 2
which implies that
δxn −yn 2 ≤ (1−λ2n k 2 )xn −yn 2

(3.3) ≤ αn x0 −u2 +xn −u2 −xn+1 −u2
≤ αn x0 −u2 +(xn −u−xn+1 −u)(xn −u+xn+1 −u).
Since limn→∞ xn − xn+1 = 0, we have
|xn − u − xn+1 − u| ≤ xn − xn+1 → 0 as n → ∞.
Thus combining with (3.3), the boundedness of {x n } and limn→∞ αn = 0, we

obtain
lim xn − yn = 0.
n→∞
Step 3. limn→∞ Sxn − xn = 0. Indeed, observe that
yn − tn = PC (xn − λn Axn ) − PC (xn − λn Ayn )

(3.4) ≤ λn Axn − Ayn
≤ λn kxn − yn → 0 as n → ∞,
Syn − xn+1 ≤ Syn − Stn + Stn − xn+1

≤ yn − tn + αn Stn − x0
(3.5) ≤ yn − tn + αn [Stn − u + x0 − u]
≤ yn − tn + αn [tn − u + x0 − u]
≤ yn − tn + 2αn x0 − u → 0 as n → ∞,
and
(3.6) Sxn − Stn ≤ xn − tn ≤ xn − yn + yn − tn → 0 as n → ∞.
Consequently, from (3.4)-(3.6), we can infer that
Sxn − xn = Sxn − Stn + Stn − Syn + Syn − xn+1 + xn+1 − xn

≤ Sxn − Stn + tn − yn + Syn − xn+1
+xn+1 − xn → 0 as n → ∞.
Step 4. lim supn→∞ x0 − u∗ , xn − u∗ ≤ 0 where u∗ = PF (S)∩Ω (x0 ). Indeed

we pick a subsequence {x ni } of {xn } so that
(3.7) lim supx0 − u∗ , xn − u∗ = lim x0 − u∗ , xni − u∗ .

n→∞ i→∞
Without loss of generality, we may further assume that {xni } converges weakly to
ũ for some ũ ∈ H. Hence (3.7) reduces to
(3.8) lim supx0 − u∗ , xn − u∗ = x0 − u∗ , ũ − u∗ .

n→∞
In order to prove x0 − u∗ , ũ− u∗ ≤ 0, it suffices to show that ũ ∈ F (S) ∩ Ω. Note

that by Lemma 2.2 and Step 3, we have ũ ∈ F (S). Now we show ũ ∈ Ω. Since
from (3.4) and (3.6) we obtain xn − tn → 0 and yn − tn → 0, we have tni ũ
and yni ũ. Let

Av + NC v, if v ∈ C,
Tv =
∅, if v ∈
/ C.
Then T is maximal monotone and 0 ∈ T v if and only if v ∈ Ω; see [5]. Let(v, w) ∈

G(T ). Then we have w ∈ T v = Av + NC v and hence w − Av ∈ NC v. Therefore
we have v − u, w − Av ≥ 0 for all u ∈ C. On the other hand, from tn =
PC (xn − λn Ayn ) and v ∈ C we have
xn − λn Ayn − tn , tn − v ≥ 0
and hence
tn − xn
v − tn , + Ayn ≥ 0.
λn
Therefore according to the fact that w − Av ∈ NC v and tn ∈ C, we have

v − tni , w ≥ v − tni , Av
tni − xni
≥ v − tni , Av − v − tni , + Ayni
λni
= v − tni , Av − Atni + v − tni , Atni − Ayni
tni − xni
−v − tni ,
λni
tni − xni
≥ v − tni , Atni − Ayni − v − tni , .
λni
Thus we get v − ũ, w ≥ 0 as i → ∞. Since T is maximal monotone, we have
ũ ∈ T −1 0 and hence ũ ∈ Ω. This shows that ũ ∈ F (S) ∩ Ω. Therefore by the
property of the metric projection, we derive x0 − u∗ , ũ − u∗ ≤ 0.
Step 5. xn → u∗ and yn → u∗ where u∗ = PF (S)∩Ω (x0 ). Indeed combining

Lemma 2.3 with (3.1), we get
(3.9)
xn+1 − u∗ 2 = (1 − αn )(Stn − u∗ ) + αn (x0 − u∗ )2
≤ (1 − αn )2 Stn − u∗ 2 + 2αn (1 − αn )x0 − u∗ , xn+1 − u∗
≤ (1 − αn )tn − u∗ 2 + 2αn x0 − u∗ , xn+1 − u∗
≤ (1 − αn )xn − u∗ 2 + αn βn ,
where βn = 2x0 − u∗ , xn+1 − u∗ . Thus an application of Lemma 2.1 combined
with Step 4 yields that x n − u∗ → 0 as n → ∞. Since xn − yn → 0, we have
yn → u∗ .
4. APPLICATIONS
As in Nadezhkina and Takahashi [10], we give two applications of Theorem

3.1.
Theorem 4.1. Let H be a real Hilbert space. Let A : H → H be a monotone,

k-Lipschitz continuous mapping and S : H → H be a nonexpansive mapping such
that F (S) ∩ A−1 0 = ∅. Let {xn } be a sequence generated by


 x0 = x ∈ H,

yn = xn − λn Axn ,



xn+1 = αn x0 + (1 − αn )S(xn − λn Ayn ) ∀n ≥ 0
where {λn} and {αn } satisfy the conditions:
(a) {λnk} ⊂ (0, 1 − δ) for some δ ∈ (0, 1);

∞
(b) {αn } ⊂ (0, 1), n=0 αn = ∞, limn→∞ αn = 0.
Then the sequence {xn } converges strongly to P F (S)∩A−1 0 (x0 ) provided
lim xn − xn+1 = 0.

n→∞
Proof. We have A−1 0 = Ω and PH = I. By Theorem 3.1, we obtain the

desired result.
Remark 4.1. See Yamada [9] and Xu and Kim [6] for the case when A : H →
H is a strongly monotone and Lipschitz continuous mapping on a real Hilbert space
H and S : H → H is a nonexpansive mapping.
Theorem 4.2. Let H be a real Hilbert space. Let A : H → H be a monotone,

k-Lipschitz continuous mapping and B : H → 2 H be a maximal monotone mapping
such that A −1 0 ∩ B −1 0 = ∅. Let JrB be the resolvent of B for each r > 0. Let
{xn } be a sequence generated by


 x0 = x ∈ H,

yn = xn − λn Axn ,



xn+1 = αn x0 + (1 − αn )JrB (xn − λn Ayn ) ∀n ≥ 0
where {λn } and {αn } satisfy the conditions:

(a) {λnk} ⊂ (0, 1 − δ) for some δ ∈ (0, 1);
∞
(b) {αn } ⊂ (0, 1), n=0 αn = ∞, limn→∞ αn = 0.
Then the sequence {xn } converges strongly to P A−1 0∩B −10 (x0 ) provided
lim xn − xn+1 = 0.

n→∞
Proof. We have A−1 0 = Ω and F (JrB ) = B −1 0. Putting PH = I, by Theorem

3.1 we obtain the desired result.
REFERENCES
1. F. E. Browder and W. V. Petryshyn, Construction of fixed points of nonlinear map-

pings in Hilbert space, J. Math. Anal. Appl., 20 (1967), 197-228.
2. G. M. Korpelevich, The extragradient method for finding saddle points and other
problems, Matecon, 12 (1976), 747-756.
3. F. Liu and M. Z. Nashed, Regularization of nonlinear ill-posed variational inequalities
and convergence rates, Set-Valued Anal., 6 (1998), 313-344.
4. K. Goebel and W. A. Kirk, Topics on Metric Fixed-Point Theory, Cambridge Uni-
versity Press, Cambridge, England, 1990.
5. R. T. Rockafellar, On the maximality of sums of nonlinear monotone operators, Trans.
Amer. Math. Soc., 149 (1970), 75-88.
6. H. K. Xu and T. H. Kim, Convergence of hybrid steepest-descent methods for vari-
ational inequalities, J. Optim. Theory Appl., 119 (2003), 185-201.
7. W. Takahashi, Nonlinear Functional Analysis, Yokohama Publishers, Yokohama,
Japan, 2000.
8. W. Takahashi and M. Toyoda, Weak convergence theorems for nonepxansive map-
pings and monotone mappings, J. Optim. Theory Appl., 118 (2003), 417-428.
9. I. Yamada, The hybrid steepest-descent method for the variational inequality problem
over the intersection of fixed-point sets of nonexpansive mappings, in Inherently Par-
allel Algorithms in Feasibility and Optimization and Their Applications (D. Butnariu,
Y. Censor and S. Reich Eds.), Kluwer Academic Publishers, Dordrecht, Holland,
2001.
10. N. Nadezhkina and W. Takahashi, Weak convergence theorem by an extragradient
method for nonexpansive mappings and monotone mappings, J. Optim. Theory Appl.,
128 (2006), 191-201.
Lu-Chuan Zeng
Department of Mathematics,
Shanghai Normal University,
Shanghai 200234, China.
E-mail: zenglc@hotmail.com
Jen-Chih Yao∗
Department of Applied Mathematics,
National Sun Yat-sen University,
Kaohsiung 804, Taiwan
E-mail: yaojc@math.nsysu.edu.tw

Strong Convergence Theorem by An Extragradient Method For Fixed Point Problems and Variational Inequality Problems

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Strong Convergence Theorem by An Extragradient Method For Fixed Point Problems and Variational Inequality Problems

Загружено:

Авторское право:

Доступные форматы

TAIWANESE JOURNAL OF MATHEMATICS

Vol. 10, No. 5, pp. 1293-1303, September 2006

STRONG CONVERGENCE THEOREM BY AN EXTRAGRADIENT

Lu-Chuan Zeng and Jen-Chih Yao

Abstract. In this paper we introduce an iterative process for finding a common

Definition 1.1. Let A : C → H be a mapping of C into H.

Au − Av, u − v ≥ 0 ∀u, v ∈ C;

(ii) A is called α-inverse-strongly-monotone (see [1], [3]) if there exists a positive

Au − Av, u − v ≥ αAu − Av2 ∀u, v ∈ C.

It is easy to see that an α-inverse-strongly-monotone mapping A is monotone

The set of solutions of the variational inequality problem is denoted by Ω. A mapping

Su − Sv ≤ u − v ∀u, v ∈ C.

We denote by F (S) the set of fixed points of S.

xn+1 = αn xn + (1 − αn )SPC (xn − λn Axn ) ∀n ≥ 0, (1.1)

where x0 = x ∈ C, {αn } is a sequence in (0, 1) and {λ n } is a sequence in (0, 2α).

mapping and S : C → C be a nonexpansive mapping such that F (S) ∩ Ω = ∅. Let

In this paper inspired by Nadezhkina and Takahashi’s iterative process (1.3), we

where {λn } and {αn } satisfy the conditions:

It is shown that the sequences {x n }, {yn } generated by (∗) converge strongly to

(2.2) x − y2 ≥ x − PC x2 + y − PC x2 .

Lemma 2.2 [4]. Demiclosedness Principle. Assume that S is a nonexpansive

The following lemma is an immediate consequence of an inner product.

Lemma 2.3. In a real Hilbert space H, there holds the inequality:

3. STRONG CONVERGENCE THEOREM

Theorem 3.1. Let C be a nonempty closed convex subset of a real Hilbert

Proof. We divide the proof into several steps.

Step 1. {xn } is bounded and so is {t n } where tn = PC (xn − λn Ayn ) ∀n ≥ 0.

tn − u2 ≤ xn − λn Ayn − u2 − xn − λn Ayn − tn 2

≤ λn Axn − λn Ayn , tn − yn

Now by induction, we have

(3.2) xn −u ≤ x0 − u ∀n ≥ 0.

Indeed when n = 0, it follows from (3.1) that

x1 − u = α0 x0 +(1 − α0 )St0 − u

xn+1 − u = αn x0 + (1 − αn )Stn − u

Step 2. limn→∞ xn − yn = 0. Indeed from (∗) and (3.1) we get

xn+1 − u2 = αn x0 + (1 − αn )Stn − u2

which implies that

δxn −yn 2 ≤ (1−λ2n k 2 )xn −yn 2

Since limn→∞ xn − xn+1 = 0, we have

|xn − u − xn+1 − u| ≤ xn − xn+1 → 0 as n → ∞.

Thus combining with (3.3), the boundedness of {x n } and limn→∞ αn = 0, we

Step 3. limn→∞ Sxn − xn = 0. Indeed, observe that

yn − tn = PC (xn − λn Axn ) − PC (xn − λn Ayn )

Syn − xn+1 ≤ Syn − Stn + Stn − xn+1

(3.6) Sxn − Stn ≤ xn − tn ≤ xn − yn + yn − tn → 0 as n → ∞.

Consequently, from (3.4)-(3.6), we can infer that

Sxn − xn = Sxn − Stn + Stn − Syn + Syn − xn+1 + xn+1 − xn

Step 4. lim supn→∞ x0 − u∗ , xn − u∗ ≤ 0 where u∗ = PF (S)∩Ω (x0 ). Indeed

(3.7) lim supx0 − u∗ , xn − u∗ = lim x0 − u∗ , xni − u∗ .

(3.8) lim supx0 − u∗ , xn − u∗ = x0 − u∗ , ũ − u∗ .

In order to prove x0 − u∗ , ũ− u∗ ≤ 0, it suffices to show that ũ ∈ F (S) ∩ Ω. Note

Then T is maximal monotone and 0 ∈ T v if and only if v ∈ Ω; see [5]. Let(v, w) ∈

Therefore according to the fact that w − Av ∈ NC v and tn ∈ C, we have

Step 5. xn → u∗ and yn → u∗ where u∗ = PF (S)∩Ω (x0 ). Indeed combining

As in Nadezhkina and Takahashi [10], we give two applications of Theorem

Theorem 4.1. Let H be a real Hilbert space. Let A : H → H be a monotone,

(a) {λnk} ⊂ (0, 1 − δ) for some δ ∈ (0, 1);

Then the sequence {xn } converges strongly to P F (S)∩A−1 0 (x0 ) provided

lim xn − xn+1 = 0.

Proof. We have A−1 0 = Ω and PH = I. By Theorem 3.1, we obtain the

Theorem 4.2. Let H be a real Hilbert space. Let A : H → H be a monotone,

where {λn } and {αn } satisfy the conditions:

lim xn − xn+1 = 0.