# Strong Convergence Algorithm for Split Equilibrium Problems and Hierarchical Fixed Point Problems

Authors: Abdellah Bnouhachem
Journal: The Scientific World Journal
 (2014)

---

## Abstract

The purpose of this paper is to investigate the problem of finding the approximate element of the common set of solutions of a split equilibrium problem and a hierarchical fixed point problem in a real Hilbert space. We establish the strong convergence of the proposed method under some mild conditions. Several special cases are also discussed. Our main result extends and improves some well-known results in the literature.


---

## Body

## 1. Introduction

LetH be a real Hilbert space, whose inner product and norm are denoted by 〈
·
,
·
〉 and ∥
·
∥. Let C be a nonempty closed convex subset of H. We introduce the following definitions which are useful in the following analysis.Definition 1.
The mappingT
:
C
→
H is said to be (a)
monotone, if(1)
〈
T
x
-
T
y
,
x
-
y
〉
≥
0
,
∀
x
,
y
∈
C
;
(b)
strongly monotone, if there existsα
>
0 such that
(2)
〈
T
x
-
T
y
,
x
-
y
〉
≥
α
∥
x
-
y
∥
2
,
∀
x
,
y
∈
C
;
(c)
α-inverse strongly monotone, if there exists α
>
0 such that
(3)
〈
T
x
-
T
y
,
x
-
y
〉
≥
α
∥
T
x
-
T
y
∥
2
,
∀
x
,
y
∈
C
;
(d)
nonexpansive, if(4)
∥
T
x
-
T
y
∥
≤
∥
x
-
y
∥
,
∀
x
,
y
∈
C
;
(e)
k-Lipschitz continuous, if there exists a constant k
>
0 such that
(5)
∥
T
x
-
T
y
∥
≤
k
∥
x
-
y
∥
,
∀
x
,
y
∈
C
;
(f)
contraction onC, if there exists a constant 0
≤
k
<
1 such that
(6)
∥
T
x
-
T
y
∥
≤
k
∥
x
-
y
∥
,
∀
x
,
y
∈
C
.It is easy to observe that every α-inverse strongly monotone T is monotone and Lipschitz continuous. It is well known that every nonexpansive operator T
:
H
→
H satisfies, for all (
x
,
y
)
∈
H
×
H, the inequality
(7)
〈
(
x
-
T
(
x
)
)
-
(
y
-
T
(
y
)
)
,
T
(
y
)
-
T
(
x
)
〉
≤
1
2
∥
(
T
(
x
)
-
x
)
-
(
T
(
y
)
-
y
)
∥
2
and therefore, we get, for all (
x
,
y
)
∈
H
×
Fix
⁡
(
T
),
(8)
〈
x
-
T
(
x
)
,
y
-
T
(
x
)
〉
≤
1
2
∥
T
(
x
)
-
x
∥
2
.
See, for example, [1, Theorem 1], and [2, Theorem 3].The fixed point problem for the mappingT is to find x
∈
C such that
(9)
T
x
=
x
.
We denote by F
(
T
) the set of solutions of (9). It is well known that F
(
T
) is closed and convex and P
F
(
T
) is well defined (see [3]).The equilibrium problem denoted by EP is to findx
∈
C such that
(10)
F
(
x
,
y
)
≥
0
,
∀
y
∈
C
.
The solution set of (10) is denoted by EP
⁡
(
F
). Numerous problems in physics, optimization, and economics reduce to finding a solution of (10); see [4–7]. In 1997, Combettes and Hirstoaga [8] introduced an iterative scheme of finding the best approximation to the initial data when EP
⁡
(
F
) is nonempty. In 2007, Plubtieng and Punpaeng [6] introduced an iterative method for finding the common element of the set F
(
T
)
∩
EP
⁡
(
F
).Recently, Censor et al. [9] introduced a new variational inequality problem which we call the split variational inequality problem (SVIP). Let H
1 and H
2 be two real Hilbert spaces. Given operators f
:
H
1
→
H
1 and g
:
H
2
→
H
2, a bounded linear operator A
:
H
1
→
H
2, and nonempty, closed, and convex subsets C
⊆
H
1 and Q
⊆
H
2, the SVIP is formulated as follows: find a point x
*
∈
C such that
(11)
〈
f
(
x
*
)
,
x
-
x
*
〉
≥
0
∀
x
∈
C
and such that
(12)
y
*
=
A
x
*
∈
Q
solves
〈
g
(
y
*
)
,
y
-
y
*
〉
≥
0
∀
y
∈
Q
.
In [10], Moudafi introduced an iterative method which can be regarded as an extension of the method given by Censor et al. [9] for the following split monotone variational inclusions:
(13)
Find
x
*
∈
H
1
such
that
0
∈
f
(
x
*
)
+
B
1
(
x
*
)
and such that
(14)
y
*
=
A
x
*
∈
H
2
solves
0
∈
g
(
y
*
)
+
B
2
(
y
*
)
,
where B
i
:
H
i
→
2
H
i is a set-valued mapping for i
=
1,2. Later Byrne et al. [11] generalized and extended the work of Censor et al. [9] and Moudafi [10].Very recently, Kazmi and Rizvi [12] studied the following pair of equilibrium problems called split equilibrium problem: let F
1
:
C
×
C
→
R and F
2
:
Q
×
Q
→
R be nonlinear bifunctions and let A
:
H
1
→
H
2 be a bounded linear operator; then, the split equilibrium problem (SEP) is to find x
*
∈
C such that
(15)
F
1
(
x
*
,
x
)
≥
0
,
∀
x
∈
C
,
and such that
(16)
y
*
=
A
x
*
∈
Q
solves
F
2
(
y
*
,
y
)
≥
0
,
∀
y
∈
Q
.
The solution set of SEP (15)-(16) is denoted by Λ
=
{
p
∈
EP
⁡
(
F
1
)
:
A
p
∈
EP
⁡
(
F
2
)
}.LetS
:
C
→
H be a nonexpansive mapping. The following problem is called a hierarchical fixed point problem: find x
∈
F
(
T
) such that
(17)
〈
x
-
S
x
,
y
-
x
〉
≥
0
,
∀
y
∈
F
(
T
)
.
It is known that the hierarchical fixed point problem (17) links with some monotone variational inequalities and convex programming problems; see [13, 14]. Various methods [15–20] have been proposed to solve the hierarchical fixed point problem. In 2010, Yao et al. [14] introduced the following strong convergence iterative algorithm to solve the problem (17):
(18)
y
n
=
β
n
S
x
n
+
(
1
-
β
n
)
x
n
,
x
n
+
1
=
P
C
[
α
n
f
(
x
n
)
+
(
1
-
α
n
)
T
y
n
]
,
∀
n
≥
0
,
where f
:
C
→
H is a contraction mapping and {
α
n
} and {
β
n
} are two sequences in (
0,1
). Under some certain restrictions on parameters, Yao et al. proved that the sequence {
x
n
} generated by (18) converges strongly to z
∈
F
(
T
), which is the unique solution of the following variational inequality:
(19)
〈
(
I
-
f
)
z
,
y
-
z
〉
≥
0
,
∀
y
∈
F
(
T
)
.
In 2011, Ceng et al. [21] investigated the following iterative method:
(20)
x
n
+
1
=
P
C
[
α
n
ρ
U
(
x
n
)
+
(
I
-
α
n
μ
F
)
(
T
(
y
n
)
)
]
,
∀
n
≥
0
,
where U is a Lipschitzian mapping and F is a Lipschitzian and strongly monotone mapping. They proved that under some approximate assumptions on the operators and parameters, the sequence {
x
n
} generated by (20) converges strongly to the unique solution of the variational inequality
(21)
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
-
z
〉
≥
0
,
∀
x
∈
Fix
⁡
(
T
)
.
In the present paper, inspired by the above cited works and by the recent works going in this direction, we give an iterative method for finding the approximate element of the common set of solutions of (15)-(16) and (17) in real Hilbert space. Strong convergence of the iterative algorithm is obtained in the framework of Hilbert space. We would like to mention that our proposed method is quite general and flexible and includes many known results for solving split equilibrium problems and hierarchical fixed point problems; see, for example, [13, 14, 17–19, 21–23] and relevant references cited therein.


## 2. Preliminaries

In this section, we recall some basic definitions and properties, which will be frequently used in our later analysis. Some useful results proved already in the literature are also summarized. The first lemma provides some basic properties of projection ontoC.Lemma 2.
LetP
C denote the projection of H onto C. Then, one has the following inequalities:
(22)
〈
z
-
P
C
[
z
]
,
P
C
[
z
]
-
v
〉
≥
0
,
∀
z
∈
H
,
v
∈
C
;
〈
u
-
v
,
P
C
[
u
]
-
P
C
[
v
]
〉
≥
∥
P
C
[
u
]
-
P
C
[
v
]
∥
2
,
∀
u
,
v
∈
H
;
∥
P
C
[
u
]
-
P
C
[
v
]
∥
≤
∥
u
-
v
∥
,
∀
u
,
v
∈
H
;
∥
u
-
P
C
[
z
]
∥
2
≤
∥
z
-
u
∥
2
-
∥
z
-
P
C
[
z
]
∥
2
,
∀
z
∈
H
,
u
∈
C
.Assumption 3 (see [24]).
LetF
:
C
×
C
→
ℝ be a bifunction satisfying the following assumptions: (i)
F
(
x
,
x
)
=
0, for all x
∈
C;
(ii)
F is monotone; that is, F
(
x
,
y
)
+
F
(
y
,
x
)
≤
0, for all x
,
y
∈
C;
(iii)
for eachx
,
y
,
z
∈
C, lim
⁡
t
→
0
F
(
t
z
+
(
1
-
t
)
x
,
y
)
≤
F
(
x
,
y
);
(iv)
for eachx
∈
C, y
→
F
(
x
,
y
) is convex and lower semicontinuous;
(v)
for fixedr
>
0 and z
∈
C, there exists a bounded subset K of H
1 and x
∈
C
∩
K such that
(23)
F
(
y
,
x
)
+
1
r
〈
y
-
x
,
x
-
z
〉
≥
0
,
∀
y
∈
C
∖
K
.Lemma 4 (see [8]).
Assume thatF
1
:
C
×
C
→
ℝ satisfies Assumption 3. For r
>
0 and for all x
∈
H
1, define a mapping T
r
F
1
:
H
1
→
C as follows:
(24)
T
r
F
1
(
x
)
=
{
z
∈
C
:
F
1
(
z
,
y
)
+
1
r
〈
y
-
z
,
z
-
x
〉
≥
0
,
∀
y
∈
C
1
r
}
.
Then the following hold: (i)
T
r
F
1 is nonempty and single-valued;
(ii)
T
r
F
1 is firmly nonexpansive; that is,
(25)
∥
T
r
F
1
(
x
)
-
T
r
F
1
(
y
)
∥
2
≤
〈
T
r
F
1
(
x
)
-
T
r
F
1
(
y
)
,
x
-
y
〉
,
∀
x
,
y
∈
H
1
;
(iii)
F
(
T
r
F
1
)
=
E
P
(
F
1
);
(iv)
E
P
(
F
1
) is closed and convex.Assume thatF
2
:
Q
×
Q
→
ℝ satisfies Assumption 3. For s
>
0 and for all u
∈
H
2, define a mapping T
s
F
2
:
H
2
→
Q as follows:
(26)
T
s
F
2
(
u
)
=
{
v
∈
Q
:
F
2
(
v
,
w
)
+
1
s
〈
w
-
v
,
v
-
u
〉
≥
0
,
∀
w
∈
Q
1
s
}
.
Then T
s
F
2 satisfies conditions (i)–(iv) of Lemma 4. Consider F
(
T
s
F
2
)
=
EP
⁡
(
F
2
,
Q
), where EP
⁡
(
F
2
,
Q
) is the solution set of the following equilibrium problem:
(27)
find
y
*
∈
Q
such
that
F
2
(
y
*
,
y
)
≥
0
,
∀
y
∈
Q
.Lemma 5 (see [25]).
Assume thatF
1
:
C
×
C
→
ℝ satisfies Assumption 3, and let T
r
F
1 be defined as in Lemma 4. Let x
,
y
∈
H
1 and r
1
,
r
2
>
0. Then
(28)
∥
T
r
2
F
1
(
y
)
-
T
r
1
F
1
(
x
)
∥
≤
∥
y
-
x
∥
+
|
r
2
-
r
1
r
2
|
∥
T
r
2
F
1
(
y
)
-
y
∥
.Lemma 6 (see [26]).
LetC be a nonempty closed convex subset of a real Hilbert space H. If  T
:
C
→
C is a nonexpansive mapping with Fix
⁡
(
T
)
≠
∅, then the mapping I
-
T is demiclosed at 0; that is, if {
x
n
} is a sequence in C weakly converging to x and if {
(
I
-
T
)
x
n
} converges strongly to 0, then (
I
-
T
)
x
=
0.Lemma 7 (see [21]).
LetU
:
C
→
H be τ-Lipschitzian mapping and let F
:
C
→
H be a k-Lipschitzian and η-strongly monotone mapping; then for 0
≤
ρ
τ
<
μ
η, μ
F
-
ρ
U is μ
η
-
ρ
τ-strongly monotone; that is,
(29)
〈
(
μ
F
-
ρ
U
)
x
-
(
μ
F
-
ρ
U
)
y
,
x
-
y
〉
≥
(
μ
η
-
ρ
τ
)
∥
x
-
y
∥
2
,
∀
x
,
y
∈
C
.Lemma 8 (see [27]).
Suppose thatλ
∈
(
0,1
) and μ
>
0. Let F
:
C
→
H be an k-Lipschitzian and η-strongly monotone operator. In association with nonexpansive mapping T
:
C
→
C, define the mapping T
λ
:
C
→
H by
(30)
T
λ
x
=
T
x
-
λ
μ
F
T
(
x
)
,
∀
x
∈
C
.
Then T
λ is a contraction provided that μ
<
(
2
η
/
k
2
); that is,
(31)
∥
T
λ
x
-
T
λ
y
∥
≤
(
1
-
λ
ν
)
∥
x
-
y
∥
,
∀
x
,
y
∈
C
,
where ν
=
1
-
1
-
μ
(
2
η
-
μ
L
2
).Lemma 9 (see [28]).
Assume that{
a
n
} is a sequence of nonnegative real numbers such that
(32)
a
n
+
1
≤
(
1
-
γ
n
)
a
n
+
δ
n
,
where {
γ
n
} is a sequence in (
0,1
) and δ
n is a sequence such that(1)
∑
n
=
1
∞
γ
n
=
∞;
(2)
limsup
⁡
n
→
∞
δ
n
/
γ
n
≤
0 or ∑
n
=
1
∞
|
δ
n
|
<
∞.Then lim
⁡
n
→
∞
a
n
=
0.Lemma 10 (see [29]).
LetC be a closed convex subset of H. Let {
x
n
} be a bounded sequence in H. Assume that (i)
the weakw-limit set w
w
(
x
n
)
⊂
C where w
w
(
x
n
)
=
{
x
:
x
n
i
⇀
x
};
(ii)
for eachz
∈
C, lim
⁡
n
→
∞
∥
x
n
-
z
∥ exists. Then {
x
n
} is weakly convergent to a point in C.


## 3. The Proposed Method and Some Properties

In this section, we suggest and analyze our method and we prove a strong convergence theorem for finding the common solutions of the split equilibrium problem (15)-(16) and the hierarchical fixed point problem (17).LetH
1 and H
2 be two real Hilbert spaces and let C
⊆
H
1 and Q
⊆
H
2 be nonempty closed convex subsets of Hilbert spaces H
1 and H
2, respectively. Let A
:
H
1
→
H
2 be a bounded linear operator. Assume that F
1
:
C
×
C
→
ℝ and F
2
:
Q
×
Q
→
ℝ are the bifunctions satisfying Assumption 3 and F
2 is upper semicontinuous in first argument. Let S
,
T
:
C
→
C be a nonexpansive mapping such that Λ
∩
F
(
T
)
≠
∅. Let F
:
C
→
C be an k-Lipschitzian mapping and η-strongly monotone and let U
:
C
→
C be τ-Lipschitzian mapping. Now we introduce the proposed method as follows.Algorithm 11.
For a givenx
0
∈
C arbitrarily, let the iterative sequences {
u
n
}, {
x
n
}, and {
y
n
} be generated by
(33)
u
n
=
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
;
y
n
=
β
n
S
x
n
+
(
1
-
β
n
)
u
n
;
x
n
+
1
=
P
C
[
α
n
ρ
U
(
x
n
)
+
(
I
-
α
n
μ
F
)
(
T
(
y
n
)
)
]
,
∀
n
≥
0
,
where {
r
n
}
⊂
(
0,2
ς
) and γ
∈
(
0,1
/
L
), L is the spectral radius of the operator A
*
A, and A
* is the adjoint of A. Suppose that the parameters satisfy 0
<
μ
<
(
2
η
/
k
2
), 0
≤
ρ
τ
<
ν, where ν
=
1
-
1
-
μ
(
2
η
-
μ
k
2
). And {
α
n
} and {
β
n
} are sequences in (
0,1
) satisfying the following conditions: (a)
lim
⁡
n
→
∞
α
n
=
0 and ∑
n
=
1
∞
‍
α
n
=
∞;
(b)
lim
⁡
n
→
∞
(
β
n
/
α
n
)
=
0;
(c)
∑
n
=
1
∞
‍
|
α
n
-
1
-
α
n
|
<
∞ and ∑
n
=
1
∞
‍
|
β
n
-
1
-
β
n
|
<
∞;
(d)
liminf
⁡
n
→
∞
r
n
<
limsup
⁡
n
→
∞
r
n
<
2
ς and ∑
n
=
1
∞
‍
|
r
n
-
1
-
r
n
|
<
∞.Remark 12.
Our method can be viewed as extension and improvement for some well-known results as follows(i)
The proposed method is an extension and improvement of the method of Wang and Xu [23] for finding the approximate element of the common set of solutions of a split equilibrium problem and a hierarchical fixed point problem in a real Hilbert space.
(ii)
If the Lipschitzian mappingU
=
f, F
=
I, ρ
=
μ
=
1, we obtain an extension and improvement of the method of Yao et al. [14] for finding the approximate element of the common set of solutions of a split equilibrium problem and a hierarchical fixed point problem in a real Hilbert space.
(iii)
The contractive mappingf with a coefficient α
∈
[
0,1
) in other papers (see [14, 19, 22, 27]) is extended to the cases of the Lipschitzian mapping U with a coefficient constant γ
∈
[
0
,
∞
). This shows that Algorithm 11 is quite general and unifying.Lemma 13.
Letx
*
∈
Λ
∩
F
(
T
). Then {
x
n
},  {
u
n
}, and {
y
n
} are bounded.Proof.
Letx
*
∈
Λ
∩
F
(
T
); we have x
*
=
T
r
n
F
1
(
x
*
) and A
x
*
=
T
r
n
F
2
(
A
x
*
). Then
(34)
∥
u
n
-
x
*
∥
2
=
∥
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
-
x
*
∥
2
=
∥
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
-
T
r
n
F
1
(
x
*
)
∥
2
≤
∥
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
-
x
*
∥
2
=
∥
x
n
-
x
*
∥
2
+
γ
2
∥
A
*
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
+
2
γ
〈
x
n
-
x
*
,
A
*
(
T
r
n
F
2
-
I
)
A
x
n
〉
=
∥
x
n
-
x
*
∥
2
+
γ
2
〈
(
T
r
n
F
2
-
I
)
A
x
n
,
A
A
*
(
T
r
n
F
2
-
I
)
A
x
n
〉
+
2
γ
〈
x
n
-
x
*
,
A
*
(
T
r
n
F
2
-
I
)
A
x
n
〉
.
From the definition of L, it follows that
(35)
γ
2
〈
(
T
r
n
F
2
-
I
)
A
x
n
,
A
A
*
(
T
r
n
F
2
-
I
)
A
x
n
〉
≤
L
γ
2
〈
(
T
r
n
F
2
-
I
)
A
x
n
,
(
T
r
n
F
2
-
I
)
A
x
n
〉
=
L
γ
2
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
.
It follows from (8) that
(36)
2
γ
〈
x
n
-
x
*
,
A
*
(
T
r
n
F
2
-
I
)
A
x
n
〉
=
2
γ
〈
A
(
x
n
-
x
*
)
,
(
T
r
n
F
2
-
I
)
A
x
n
〉
=
2
γ
〈
A
(
x
n
-
x
*
)
+
(
T
r
n
F
2
-
I
)
A
x
n
-
(
T
r
n
F
2
-
I
)
A
x
n
,
(
T
r
n
F
2
-
I
)
A
x
n
〉
=
2
γ
(
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
2

〈
T
r
n
F
2
A
x
n
-
A
x
*
,
(
T
r
n
F
2
-
I
)
A
x
n
〉
-
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
)
≤
2
γ
(
1
2
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
-
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
)
=
-
γ
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
.
Applying (36) and (35) to (34) and from the definition of γ, we get
(37)
∥
u
n
-
x
*
∥
2
≤
∥
x
n
-
x
*
∥
2
+
γ
(
L
γ
-
1
)
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
≤
∥
x
n
-
x
*
∥
2
.
Denote V
n
=
α
n
ρ
U
(
x
n
)
+
(
I
-
α
n
μ
F
)
(
T
(
y
n
)
). Next, we prove that the sequence {
x
n
} is bounded; without loss of generality we can assume that β
n
≤
α
n for all n
≥
1. From (33), we have
(38)
∥
x
n
+
1
-
x
*
∥
=
∥
P
C
[
V
n
]
-
P
C
[
x
*
]
∥
≤
∥
α
n
ρ
U
(
x
n
)
+
(
I
-
α
n
μ
F
)
(
T
(
y
n
)
)
-
x
*
∥
≤
α
n
∥
ρ
U
(
x
n
)
-
μ
F
(
x
*
)
∥
+
∥
(
I
-
α
n
μ
F
)
(
T
(
y
n
)
)
-
(
I
-
α
n
μ
F
)
T
(
x
*
)
∥
=
α
n
∥
ρ
U
(
x
n
)
-
ρ
U
(
x
*
)
+
(
ρ
U
-
μ
F
)
(
x
*
)
∥
+
∥
(
I
-
α
n
μ
F
)
(
T
(
y
n
)
)
-
(
I
-
α
n
μ
F
)
T
(
x
*
)
∥
≤
α
n
ρ
τ
∥
x
n
-
x
*
∥
+
α
n
∥
(
ρ
U
-
μ
F
)
(
x
*
)
∥
+
(
1
-
α
n
ν
)
∥
y
n
-
x
*
∥
≤
α
n
ρ
τ
∥
x
n
-
x
*
∥
+
α
n
∥
(
ρ
U
-
μ
F
)
(
x
*
)
∥
+
(
1
-
α
n
ν
)
∥
β
n
S
x
n
+
(
1
-
β
n
)
u
n
-
x
*
∥
≤
α
n
ρ
τ
∥
x
n
-
x
*
∥
+
α
n
∥
(
ρ
U
-
μ
F
)
(
x
*
)
∥
+
(
1
-
α
n
ν
)
(
β
n
∥
S
x
n
-
S
x
*
∥
+
β
n
∥
S
x
*
-
x
*
∥
+
(
1
-
β
n
)
∥
u
n
-
x
*
∥
)
≤
α
n
ρ
τ
∥
x
n
-
x
*
∥
+
α
n
∥
(
ρ
U
-
μ
F
)
(
x
*
)
∥
+
(
1
-
α
n
ν
)
(
β
n
∥
S
x
n
-
S
x
*
∥
+
β
n
∥
S
x
*
-
x
*
∥
+
(
1
-
β
n
)
∥
x
n
-
x
*
∥
)
≤
α
n
ρ
τ
∥
x
n
-
x
*
∥
+
α
n
∥
(
ρ
U
-
μ
F
)
(
x
*
)
∥
+
(
1
-
α
n
ν
)
(
β
n
∥
x
n
-
x
*
∥
+
β
n
∥
S
x
*
-
x
*
∥
+
(
1
-
β
n
)
∥
x
n
-
x
*
∥
)
=
(
1
-
α
n
(
ν
-
ρ
τ
)
)
∥
x
n
-
x
*
∥
+
α
n
∥
(
ρ
U
-
μ
F
)
(
x
*
)
∥
+
(
1
-
α
n
ν
)
β
n
∥
S
x
*
-
x
*
∥
≤
(
1
-
α
n
(
ν
-
ρ
τ
)
)
∥
x
n
-
x
*
∥
+
α
n
∥
(
ρ
U
-
μ
F
)
(
x
*
)
∥
+
β
n
∥
S
x
*
-
x
*
∥
≤
(
1
-
α
n
(
ν
-
ρ
τ
)
)
∥
x
n
-
x
*
∥
+
α
n
(
∥
(
ρ
U
-
μ
F
)
(
x
*
)
∥
+
∥
S
x
*
-
x
*
∥
)
=
(
1
-
α
n
(
ν
-
ρ
τ
)
)
∥
x
n
-
x
*
∥
+
α
n
(
ν
-
ρ
τ
)
ν
-
ρ
τ
(
∥
(
ρ
U
-
μ
F
)
x
*
∥
+
∥
S
x
*
-
x
*
∥
)
≤
max
⁡
{
∥
x
n
-
x
*
∥
,
1
ν
-
ρ
τ
×
(
∥
(
ρ
U
-
μ
F
)
(
x
*
)
∥
+
∥
S
x
*
-
x
*
∥
)
1
ν
-
ρ
τ
}
,
where the third inequality follows from Lemma 8.
By induction onn, we obtain ∥
x
n
-
x
*
∥
≤
max
⁡
{
∥
x
0
-
x
*
∥
,
(
1
/
(
1
-
ρ
)
)
(
∥
(
ρ
U
-
μ
F
)
x
*
∥
+
∥
S
x
*
-
x
*
∥
)
}, for n
≥
0 and x
0
∈
C. Hence {
x
n
} is bounded and, consequently, we deduce that {
u
n
}, {
y
n
}, {
S
(
x
n
)
}, {
T
(
x
n
)
}, {
F
(
T
(
y
n
)
)
}, and {
U
(
x
n
)
} are bounded.Lemma 14.
Letx
*
∈
Λ
∩
F
(
T
) and {
x
n
} the sequence generated by the Algorithm 11. Then one has (a)
lim
⁡
n
→
∞
∥
x
n
+
1
-
x
n
∥
=
0;
(b)
the weakw-limit set w
w
(
x
n
)
⊂
F
(
T
), (w
w
(
x
n
)
=
{
x
:
x
n
i
⇀
x
}).Proof.
Sinceu
n
=
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
) and u
n
-
1
=
T
r
n
-
1
F
1
(
x
n
-
1
+
γ
A
*
(
T
r
n
-
1
F
2
-
I
)
A
x
n
-
1
)  it follows from Lemma 5 that
(39)
∥
u
n
-
u
n
-
1
∥
≤
∥
(
T
r
n
F
2
-
I
)
x
n
-
x
n
-
1
+
γ
(
A
*
(
T
r
n
F
2
-
I
)
A
x
n
-
A
*
(
T
r
n
-
1
F
2
-
I
)
A
x
n
-
1
)
∥
+
|
1
-
r
n
-
1
r
n
|
∥
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
-
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
∥
≤
∥
x
n
-
x
n
-
1
-
γ
A
*
A
(
x
n
-
x
n
-
1
)
∥
+
γ
∥
A
∥
∥
T
r
n
F
2
A
x
n
-
T
r
n
-
1
F
2
A
x
n
-
1
∥
+
|
1
-
r
n
-
1
r
n
|
∥
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
-
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
∥
≤
(
∥
x
n
-
x
n
-
1
∥
2
-
2
γ
∥
A
(
x
n
-
x
n
-
1
)
∥
2
+
γ
2
∥
A
∥
4
∥
x
n
-
x
n
-
1
∥
2
)
1
/
2
+
γ
∥
A
∥
(
|
1
-
r
n
-
1
r
n
|
∥
A
(
x
n
-
x
n
-
1
)
∥
+
|
1
-
r
n
-
1
r
n
|
∥
T
r
n
F
2
A
x
n
-
A
x
n
∥
)
+
|
1
-
r
n
-
1
r
n
|
∥
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
-
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
∥
≤
(
1
-
2
γ
∥
A
∥
2
+
γ
2
∥
A
∥
4
)
1
/
2
∥
x
n
-
x
n
-
1
∥
+
γ
∥
A
∥
2
∥
x
n
-
x
n
-
1
∥
+
γ
∥
A
∥
|
1
-
r
n
-
1
r
n
|
∥
T
r
n
F
2
A
x
n
-
A
x
n
∥
+
|
1
-
r
n
-
1
r
n
|
∥
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
-
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
∥
=
(
1
-
γ
∥
A
∥
2
)
∥
x
n
-
x
n
-
1
∥
+
γ
∥
A
∥
2
∥
x
n
-
x
n
-
1
∥
+
γ
∥
A
∥
|
1
-
r
n
-
1
r
n
|
∥
T
r
n
F
2
A
x
n
-
A
x
n
∥
+
|
1
-
r
n
-
1
r
n
|
∥
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
-
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
∥
=
∥
x
n
-
x
n
-
1
∥
+
γ
∥
A
∥
|
1
-
r
n
-
1
r
n
|
∥
T
r
n
F
2
A
x
n
-
A
x
n
∥
+
|
1
-
r
n
-
1
r
n
|
∥
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
-
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
∥
=
∥
x
n
-
x
n
-
1
∥
+
|
r
n
-
r
n
-
1
r
n
|
(
γ
∥
A
∥
σ
n
+
χ
n
)
,
where σ
n
:
=
∥
T
r
n
F
2
A
x
n
-
A
x
n
∥ and χ
n
:
=
∥
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
-
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
∥. Without loss of generality, let us assume that there exists a real number μ such that r
n
>
μ
>
0, for all positive integers n. Then we get
(40)
∥
u
n
-
1
-
u
n
∥
≤
∥
x
n
-
1
-
x
n
∥
+
1
μ
|
r
n
-
1
-
r
n
|
(
γ
∥
A
∥
σ
n
+
χ
n
)
.
From (33) and the above inequality, we get
(41)
∥
y
n
-
y
n
-
1
∥
=
∥
β
n
S
x
n
+
(
1
-
β
n
)
u
n
-
(
β
n
-
1
S
x
n
-
1
+
(
1
-
β
n
-
1
)
u
n
-
1
)
∥
=
∥
β
n
(
S
x
n
-
S
x
n
-
1
)
+
(
β
n
-
β
n
-
1
)
S
x
n
-
1
+
(
1
-
β
n
)
(
u
n
-
u
n
-
1
)
+
(
β
n
-
1
-
β
n
)
u
n
-
1
∥
≤
β
n
∥
x
n
-
x
n
-
1
∥
+
(
1
-
β
n
)
∥
u
n
-
u
n
-
1
∥
+
|
β
n
-
β
n
-
1
|
(
∥
S
x
n
-
1
∥
+
∥
u
n
-
1
∥
)
≤
β
n
∥
x
n
-
x
n
-
1
∥
+
(
1
-
β
n
)
×
{
∥
x
n
-
1
-
x
n
∥
+
1
μ
|
r
n
-
1
-
r
n
|
(
γ
∥
A
∥
σ
n
+
χ
n
)
}
+
|
β
n
-
β
n
-
1
|
(
∥
S
x
n
-
1
∥
+
∥
u
n
-
1
∥
)
≤
∥
x
n
-
x
n
-
1
∥
+
1
μ
|
r
n
-
1
-
r
n
|
(
γ
∥
A
∥
σ
n
+
χ
n
)
+
|
β
n
-
β
n
-
1
|
(
∥
S
x
n
-
1
∥
+
∥
u
n
-
1
∥
)
.
Next, we estimate
(42)
∥
x
n
+
1
-
x
n
∥
=
∥
P
C
[
V
n
]
-
P
C
[
V
n
-
1
]
∥
≤
∥
(
T
(
y
n
-
1
)
)
α
n
ρ
(
U
(
x
n
)
-
U
(
x
n
-
1
)
)
+
(
α
n
-
α
n
-
1
)
ρ
U
(
x
n
-
1
)
+
(
I
-
α
n
μ
F
)
(
T
(
y
n
)
)
-
(
I
-
α
n
μ
F
)
T
(
y
n
-
1
)
+
(
I
-
α
n
μ
F
)
(
T
(
y
n
-
1
)
)
-
(
I
-
α
n
-
1
μ
F
)
(
T
(
y
n
-
1
)
)
∥
≤
α
n
ρ
τ
∥
x
n
-
x
n
-
1
∥
+
(
1
-
α
n
ν
)
∥
y
n
-
y
n
-
1
∥
+
|
α
n
-
α
n
-
1
|
(
∥
ρ
U
(
x
n
-
1
)
∥
+
∥
μ
F
(
T
(
y
n
-
1
)
)
∥
)
,
where the second inequality follows from Lemma 8. From (41) and (42), we have
(43)
∥
x
n
+
1
-
x
n
∥
≤
α
n
ρ
τ
∥
x
n
-
x
n
-
1
∥
+
(
1
-
α
n
ν
)
×
{
∥
x
n
-
x
n
-
1
∥
+
1
μ
|
r
n
-
1
-
r
n
|
(
γ
∥
A
∥
σ
n
+
χ
n
)
+
|
β
n
-
β
n
-
1
|
(
∥
S
x
n
-
1
∥
+
∥
u
n
-
1
∥
)
1
μ
}
+
|
α
n
-
α
n
-
1
|
(
∥
ρ
U
(
x
n
-
1
)
∥
+
∥
μ
F
(
T
(
y
n
-
1
)
)
∥
)
≤
(
1
-
(
ν
-
ρ
τ
)
α
n
)
∥
x
n
-
x
n
-
1
∥
+
1
μ
|
r
n
-
1
-
r
n
|
(
γ
∥
A
∥
σ
n
+
χ
n
)
+
|
β
n
-
β
n
-
1
|
(
∥
S
x
n
-
1
∥
+
∥
u
n
-
1
∥
)
+
|
α
n
-
α
n
-
1
|
(
∥
ρ
U
(
x
n
-
1
)
∥
+
∥
μ
F
(
T
(
y
n
-
1
)
)
∥
)
≤
(
1
-
(
ν
-
ρ
τ
)
α
n
)
∥
x
n
-
x
n
-
1
∥
+
M
(
1
μ
|
r
n
-
1
-
r
n
|
+
|
β
n
-
β
n
-
1
|
+
|
α
n
-
α
n
-
1
|
)
,
where
(44)
M
=
max
⁡
{
sup
⁡
n
≥
1
(
γ
∥
A
∥
σ
n
+
χ
n
)
,
sup
⁡
n
≥
1
(
∥
S
x
n
-
1
∥
+
∥
u
n
-
1
∥
)
,
sup
⁡
n
≥
1
(
∥
ρ
U
(
x
n
-
1
)
∥
+
∥
μ
F
(
T
(
y
n
-
1
)
)
∥
)
}
.
It follows from conditions (a)–(d) of Algorithm 11 and Lemma 9 that
(45)
lim
⁡
n
→
∞
∥
x
n
+
1
-
x
n
∥
=
0
.
Next, we show that lim
⁡
n
→
∞
∥
u
n
-
x
n
∥
=
0. Since x
*
∈
Λ
∩
F
(
T
) by using (34) and (37), we obtain
(46)
∥
x
n
+
1
-
x
*
∥
2
=
〈
P
C
[
V
n
]
-
x
*
,
x
n
+
1
-
x
*
〉
=
〈
P
C
[
V
n
]
-
V
n
,
P
C
[
V
n
]
-
x
*
〉
+
〈
V
n
-
x
*
,
x
n
+
1
-
x
*
〉
≤
〈
x
*
1
α
n
(
ρ
U
(
x
n
)
-
μ
F
(
x
*
)
+
(
I
-
α
n
μ
F
)
(
T
(
y
n
)
)
)
-
(
I
-
α
n
μ
F
)
(
T
(
x
*
)
)
,
x
n
+
1
-
x
*
x
*
1
(
T
(
y
n
)
)
〉
=
〈
α
n
ρ
(
U
(
x
n
)
-
U
(
x
*
)
)
,
x
n
+
1
-
x
*
〉
+
α
n
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
〈
(
I
-
α
n
μ
F
)
(
T
(
y
n
)
)
-
(
I
-
α
n
μ
F
)
(
T
(
x
*
)
)
,
x
n
+
1
-
x
*
(
T
(
y
n
)
)
〉
≤
α
n
ρ
τ
∥
x
n
-
x
*
∥
∥
x
n
+
1
-
x
*
∥
+
α
n
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
∥
y
n
-
x
*
∥
∥
x
n
+
1
-
x
*
∥
≤
α
n
ρ
τ
2
(
∥
x
n
-
x
*
∥
2
+
∥
x
n
+
1
-
x
*
∥
2
)
+
α
n
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
2
(
∥
y
n
-
x
*
∥
2
+
∥
x
n
+
1
-
x
*
∥
2
)
≤
(
1
-
α
n
(
ν
-
ρ
τ
)
)
2
∥
x
n
+
1
-
x
*
∥
2
+
α
n
ρ
τ
2
∥
x
n
-
x
*
∥
2
+
α
n
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
2
(
β
n
∥
S
x
n
-
x
*
∥
2
+
(
1
-
β
n
)
∥
u
n
-
x
*
∥
2
)
≤
(
1
-
α
n
(
ν
-
ρ
τ
)
)
2
∥
x
n
+
1
-
x
*
∥
2
+
α
n
ρ
τ
2
∥
x
n
-
x
*
∥
2
+
α
n
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
β
n
2
∥
S
x
n
-
x
*
∥
2
+
(
1
-
α
n
ν
)
(
1
-
β
n
)
2
×
{
∥
x
n
-
x
*
∥
2
+
γ
(
L
γ
-
1
)
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
}
,
where the last inequality follows from (37), which implies that
(47)
∥
x
n
+
1
-
x
*
∥
2
≤
α
n
ρ
τ
1
+
α
n
(
ν
-
ρ
τ
)
∥
x
n
-
x
*
∥
2
+
2
α
n
1
+
α
n
(
ν
-
ρ
τ
)
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
β
n
1
+
α
n
(
ν
-
ρ
τ
)
∥
S
x
n
-
x
*
∥
2
+
(
1
-
α
n
ν
)
(
1
-
β
n
)
1
+
α
n
(
ν
-
ρ
τ
)
×
{
∥
x
n
-
x
*
∥
2
+
γ
(
L
γ
-
1
)
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
}
≤
α
n
ρ
τ
1
+
α
n
(
ν
-
ρ
τ
)
∥
x
n
-
x
*
∥
2
+
2
α
n
1
+
α
n
(
ν
-
ρ
τ
)
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
∥
x
n
-
x
*
∥
2
+
(
1
-
α
n
ν
)
β
n
1
+
α
n
(
ν
-
ρ
τ
)
∥
S
x
n
-
x
*
∥
2
-
(
1
-
α
n
ν
)
(
1
-
β
n
)
γ
(
1
-
L
γ
)
1
+
α
n
(
ν
-
ρ
τ
)
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
.
Then from the above inequality, we get
(48)
(
1
-
α
n
ν
)
(
1
-
β
n
)
γ
(
1
-
L
γ
)
1
+
α
n
(
ν
-
ρ
τ
)
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
≤
α
n
ρ
τ
1
+
α
n
(
ν
-
ρ
τ
)
∥
x
n
-
x
*
∥
2
+
2
α
n
1
+
α
n
(
ν
-
ρ
τ
)
×
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
β
n
∥
S
x
n
-
x
*
∥
2
+
∥
x
n
-
x
*
∥
2
-
∥
x
n
+
1
-
x
*
∥
2
≤
α
n
ρ
τ
1
+
α
n
(
ν
-
ρ
τ
)
∥
x
n
-
x
*
∥
2
+
2
α
n
1
+
α
n
(
ν
-
ρ
τ
)
×
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
β
n
∥
S
x
n
-
x
*
∥
2
+
(
∥
x
n
-
x
*
∥
+
∥
x
n
+
1
-
x
*
∥
)
×
∥
x
n
+
1
-
x
n
∥
.
Since γ
(
1
-
L
γ
)
>
0, lim
⁡
n
→
∞
∥
x
n
+
1
-
x
n
∥
=
0, α
n
→
0, and β
n
→
0, we obtain
(49)
lim
⁡
n
→
∞
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
=
0
.
Since T
r
n
F
1 is firmly nonexpansive, we have
(50)
∥
u
n
-
x
*
∥
2
=
∥
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
)
-
T
r
n
F
1
(
x
*
)
∥
2
≤
〈
u
n
-
x
*
,
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
-
x
*
〉
=
1
2
{
∥
u
n
-
x
*
∥
2
+
∥
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
-
x
*
∥
2
-
∥
u
n
-
x
*
-
[
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
-
x
*
]
∥
2
}
=
1
2
{
∥
u
n
-
x
*
∥
2
+
∥
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
-
x
*
∥
2
-
∥
u
n
-
x
n
-
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
}
≤
1
2
{
∥
u
n
-
x
n
-
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
∥
u
n
-
x
*
∥
2
+
∥
x
n
-
x
*
∥
2
-
∥
u
n
-
x
n
-
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
}
=
1
2
{
[
∥
u
n
-
x
n
∥
2
+
γ
2
∥
A
*
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
∥
u
n
-
x
*
∥
2
+
∥
x
n
-
x
*
∥
2
-
[
∥
u
n
-
x
n
∥
2
+
γ
2
∥
A
*
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
-
2
γ
〈
u
n
-
x
n
,
A
*
(
T
r
n
F
2
-
I
)
A
x
n
〉
[
∥
u
n
-
x
n
∥
2
+
γ
2
∥
A
*
(
T
r
n
F
2
-
I
)
A
x
n
∥
2
]
}
,
where the last inequality follows from (34) and (37). Hence, we get
(51)
∥
u
n
-
x
*
∥
2
≤
∥
x
n
-
x
*
∥
2
-
∥
u
n
-
x
n
∥
2
+
2
γ
∥
A
u
n
-
A
x
n
∥
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
.
From (46) and the above inequality, we have
(52)
∥
x
n
+
1
-
x
*
∥
2
≤
(
1
-
α
n
(
ν
-
ρ
τ
)
)
2
∥
x
n
+
1
-
x
*
∥
2
+
α
n
ρ
τ
2
∥
x
n
-
x
*
∥
2
+
α
n
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
2
(
β
n
∥
S
x
n
-
x
*
∥
2
+
(
1
-
β
n
)
∥
u
n
-
x
*
∥
2
)
≤
(
1
-
α
n
(
ν
-
ρ
τ
)
)
2
∥
x
n
+
1
-
x
*
∥
2
+
α
n
ρ
τ
2
∥
x
n
-
x
*
∥
2
+
α
n
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
2
×
{
T
r
n
F
2
β
n
∥
S
x
n
-
x
*
∥
2
+
(
1
-
β
n
)
×
(
T
r
n
F
2
∥
x
n
-
x
*
∥
2
-
∥
u
n
-
x
n
∥
2
+
2
γ
∥
A
u
n
-
A
x
n
∥
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
)
}
,
which implies that
(53)
∥
x
n
+
1
-
x
*
∥
2
≤
α
n
ρ
τ
1
+
α
n
(
ν
-
ρ
τ
)
∥
x
n
-
x
*
∥
2
+
2
α
n
1
+
α
n
(
ν
-
ρ
τ
)
×
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
β
n
1
+
α
n
(
ν
-
ρ
τ
)
∥
S
x
n
-
x
*
∥
2
+
(
1
-
α
n
ν
)
(
1
-
β
n
)
1
+
α
n
(
ν
-
ρ
τ
)
×
{
T
r
n
F
2
∥
x
n
-
x
*
∥
2
-
∥
u
n
-
x
n
∥
2
+
2
γ
∥
A
u
n
-
A
x
n
∥
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
}
≤
α
n
ρ
τ
1
+
α
n
(
ν
-
ρ
τ
)
∥
x
n
-
x
*
∥
2
+
2
α
n
1
+
α
n
(
ν
-
ρ
τ
)
×
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
β
n
1
+
α
n
(
ν
-
ρ
τ
)
∥
S
x
n
-
x
*
∥
2
+
∥
x
n
-
x
*
∥
2
+
(
1
-
α
n
ν
)
(
1
-
β
n
)
1
+
α
n
(
ν
-
ρ
τ
)
×
{
-
∥
u
n
-
x
n
∥
2
+
2
γ
∥
A
u
n
-
A
x
n
∥
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
}
.
Hence
(54)
(
1
-
α
n
ν
)
(
1
-
β
n
)
1
+
α
n
(
ν
-
ρ
τ
)
∥
u
n
-
x
n
∥
2
≤
α
n
ρ
τ
1
+
α
n
(
ν
-
ρ
τ
)
∥
x
n
-
x
*
∥
2
+
2
α
n
1
+
α
n
(
ν
-
ρ
τ
)
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
β
n
1
+
α
n
(
ν
-
ρ
τ
)
∥
S
x
n
-
x
*
∥
2
+
2
(
1
-
α
n
ν
)
(
1
-
β
n
)
γ
1
+
α
n
(
ν
-
ρ
τ
)
∥
A
u
n
-
A
x
n
∥
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
+
∥
x
n
-
x
*
∥
2
-
∥
x
n
+
1
-
x
*
∥
2
≤
α
n
ρ
τ
1
+
α
n
(
ν
-
ρ
τ
)
∥
x
n
-
x
*
∥
2
+
2
α
n
1
+
α
n
(
ν
-
ρ
τ
)
〈
ρ
U
(
x
*
)
-
μ
F
(
x
*
)
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
β
n
1
+
α
n
(
ν
-
ρ
τ
)
∥
S
x
n
-
x
*
∥
2
+
2
(
1
-
α
n
ν
)
(
1
-
β
n
)
γ
1
+
α
n
(
ν
-
ρ
τ
)
∥
A
u
n
-
A
x
n
∥
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
+
(
∥
x
n
-
x
*
∥
+
∥
x
n
+
1
-
x
*
∥
)
∥
x
n
+
1
-
x
n
∥
.
Since lim
⁡
n
→
∞
∥
x
n
+
1
-
x
n
∥
=
0, α
n
→
0, β
n
→
0, and lim
⁡
n
→
∞
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
=
0, we obtain
(55)
lim
⁡
n
→
∞
∥
u
n
-
x
n
∥
=
0
.
Now, let z
∈
Λ
∩
F
(
T
); since T
(
x
n
)
∈
C, we have
(56)
∥
x
n
-
T
(
x
n
)
∥
≤
∥
x
n
-
x
n
+
1
∥
+
∥
x
n
+
1
-
T
(
x
n
)
∥
=
∥
x
n
-
x
n
+
1
∥
+
∥
P
C
[
V
n
]
-
P
C
[
T
(
x
n
)
]
∥
≤
∥
x
n
-
x
n
+
1
∥
+
∥
α
n
(
ρ
U
(
x
n
)
-
μ
F
(
T
(
y
n
)
)
+
T
(
y
n
)
-
T
(
x
n
)
)
∥
≤
∥
x
n
-
x
n
+
1
∥
+
α
n
∥
ρ
U
(
x
n
)
-
μ
F
(
T
(
y
n
)
)
∥
+
∥
y
n
-
x
n
∥
≤
∥
x
n
-
x
n
+
1
∥
+
α
n
∥
ρ
U
(
x
n
)
-
μ
F
(
T
(
y
n
)
)
∥
+
∥
β
n
S
x
n
+
(
1
-
β
n
)
u
n
-
x
n
∥
≤
∥
x
n
-
x
n
+
1
∥
+
α
n
∥
ρ
U
(
x
n
)
-
μ
F
(
T
(
y
n
)
)
∥
+
β
n
∥
S
x
n
-
x
n
∥
+
(
1
-
β
n
)
∥
u
n
-
x
n
∥
.
Since lim
⁡
n
→
∞
∥
x
n
+
1
-
x
n
∥
=
0,  α
n
→
0,  β
n
→
0,  ∥
ρ
U
(
x
n
)
-
μ
F
(
T
(
y
n
)
)
∥, and ∥
S
x
n
-
x
n
∥ are bounded and lim
⁡
n
→
∞
∥
x
n
-
u
n
∥
=
0, we obtain
(57)
lim
⁡
n
→
∞
∥
x
n
-
T
(
x
n
)
∥
=
0
.
Since {
x
n
} is bounded, without loss of generality, we can assume that x
n
⇀
x
*
∈
C. It follows from Lemma 6 that x
*
∈
F
(
T
). Therefore w
w
(
x
n
)
⊂
F
(
T
).Theorem 15.
The sequence{
x
n
} generated by Algorithm 11 converges strongly to z, which is the unique solution of the variational inequality
(58)
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
-
z
〉
≤
0
,
∀
x
∈
Λ
∩
F
(
T
)
.Proof.
Since{
x
n
} is bounded x
n
⇀
w and from Lemma 14, we have w
∈
F
(
T
). Next, we show that w
∈
EP
⁡
(
F
1
). Since u
n
=
T
r
n
F
1
(
x
n
+
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
), we have
(59)
F
1
(
u
n
,
y
)
+
1
r
n
〈
y
-
u
n
,
u
n
-
x
n
〉
-
1
r
n
〈
y
-
u
n
,
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
〉
≥
0
,
∀
y
∈
C
.
It follows from monotonicity of F
1 that
(60)
-
1
r
n
〈
y
-
u
n
,
γ
A
*
(
T
r
n
F
2
-
I
)
A
x
n
〉
+
1
r
n
〈
y
-
u
n
,
u
n
-
x
n
〉
≥
F
1
(
y
,
u
n
)
,
∀
y
∈
C
,
(61)
-
1
r
n
k
〈
y
-
u
n
k
,
γ
A
*
(
T
r
n
k
F
2
-
I
)
A
x
n
k
〉
+
〈
y
-
u
n
k
,
u
n
k
-
x
n
k
r
n
k
〉
≥
F
1
(
y
,
u
n
k
)
,
∀
y
∈
C
.
Since lim
⁡
n
→
∞
∥
u
n
-
x
n
∥
=
0, lim
⁡
n
→
∞
∥
(
T
r
n
F
2
-
I
)
A
x
n
∥
=
0, and x
n
⇀
w, it easy to observe that u
n
k
→
w. It follows by Assumption 3(iv) that F
1
(
y
,
w
)
≤
0, for all y
∈
C.
For any0
<
t
≤
1 and y
∈
C, let y
t
=
t
y
+
(
1
-
t
)
w; we have y
t
∈
C. Then, from Assumptions 3((i) and (iv)), we have
(62)
0
=
F
1
(
y
t
,
y
t
)
≤
t
F
1
(
y
t
,
y
)
+
(
1
-
t
)
F
1
(
y
t
,
w
)
≤
t
F
1
(
y
t
,
y
)
.
Therefore F
1
(
y
t
,
y
)
≥
0. From Assumption 3(iii), we have F
1
(
w
,
y
)
≥
0, which implies that w
∈
EP
⁡
(
F
1
).
Next, we show thatA
w
∈
EP
⁡
(
F
2
). Since {
x
n
} is bounded and x
n
⇀
w, there exists a subsequence {
x
n
k
} of  {
x
n
} such that x
n
k
→
w and since A is a bounded linear operator, A
x
n
k
→
A
w. Now set v
n
k
=
A
x
n
k
-
T
r
n
k
F
2
A
x
n
k. It follows from (49) that lim
⁡
k
→
∞
v
n
k
=
0 and A
x
n
k
-
v
n
k
=
T
r
n
k
F
2
A
x
n
k. Therefore from the definition of T
r
n
k
F
2, we have
(63)
F
2
(
A
x
n
k
-
v
n
k
,
y
)
+
1
r
n
k
〈
y
-
(
A
x
n
k
-
v
n
k
)
,
(
A
x
n
k
-
v
n
k
)
-
A
x
n
k
〉
≥
0
,
∀
y
∈
C
.
Since F
2 is upper semicontinuous in first argument, taking lim sup to above inequality as k
→
∞ and using Assumption 3(iv), we obtain
(64)
F
2
(
A
w
,
y
)
≥
0
∀
y
∈
C
,
which implies that A
w
∈
EP
⁡
(
F
2
) and hence w
∈
Λ.
Thus we have(65)
w
∈
Λ
∩
F
(
T
)
.
Observe that the constants satisfy 0
≤
ρ
τ
<
ν and
(66)
k
≥
η
⟺
k
2
≥
η
2
⟺
1
-
2
μ
η
+
μ
2
k
2
≥
1
-
2
μ
η
+
μ
2
η
2
⟺
1
-
μ
(
2
η
-
μ
k
2
)
≥
1
-
μ
η
⟺
μ
η
≥
1
-
1
-
μ
(
2
η
-
μ
k
2
)
⟺
μ
η
≥
ν
.
Therefore from Lemma 7, the operator μ
F
-
ρ
U is μ
η
-
ρ
τ strongly monotone, and we get the uniqueness of the solution of the variational inequality (58) and denote it by z
∈
Λ
∩
F
(
T
).
Next, we claim thatlim
⁡
sup
⁡
n
→
∞
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
-
z
〉
≤
0. Since {
x
n
} is bounded, there exists a subsequence {
x
n
k
} of {
x
n
} such that
(67)
limsup
⁡
n
→
∞
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
-
z
〉
=
limsup
⁡
k
→
∞
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
k
-
z
〉
=
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
w
-
z
〉
≤
0
.
Next, we show that x
n
→
z. Consider
(68)
∥
x
n
+
1
-
z
∥
2
=
〈
P
C
[
V
n
]
-
z
,
x
n
+
1
-
z
〉
=
〈
P
C
[
V
n
]
-
V
n
,
P
C
[
V
n
]
-
z
〉
+
〈
V
n
-
z
,
x
n
+
1
-
z
〉
≤
〈
(
I
-
α
n
μ
F
)
(
T
(
z
)
)
x
n
+
1
α
n
(
ρ
U
(
x
n
)
-
μ
F
(
z
)
)
+
(
I
-
α
n
μ
F
)
(
T
(
y
n
)
)
-
(
I
-
α
n
μ
F
)
(
T
(
z
)
)
,
x
n
+
1
-
z
(
T
)
w
e
〉
≤
〈
α
n
ρ
(
U
(
x
n
)
-
U
(
z
)
)
,
x
n
+
1
-
z
〉
+
α
n
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
+
1
-
z
〉
+
〈
(
I
-
α
n
μ
F
)
(
T
(
y
n
)
)
-
(
I
-
α
n
μ
F
)
(
T
(
z
)
)
,
x
n
+
1
-
z
〉
≤
α
n
ρ
τ
∥
x
n
-
z
∥
∥
x
n
+
1
-
z
∥
+
α
n
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
+
1
-
z
〉
+
(
1
-
α
n
ν
)
∥
y
n
-
z
∥
∥
x
n
+
1
-
z
∥
≤
α
n
ρ
τ
∥
x
n
-
z
∥
∥
x
n
+
1
-
z
∥
+
α
n
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
+
1
-
z
〉
+
(
1
-
α
n
ν
)
{
β
n
∥
S
x
n
-
S
z
∥
+
β
n
∥
S
z
-
z
∥
+
(
1
-
β
n
)
∥
u
n
-
z
∥
}
∥
x
n
+
1
-
z
∥
≤
α
n
ρ
τ
∥
x
n
-
z
∥
∥
x
n
+
1
-
z
∥
+
α
n
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
+
1
-
z
〉
+
(
1
-
α
n
ν
)
{
β
n
∥
x
n
-
z
∥
+
β
n
∥
S
z
-
z
∥
+
(
1
-
β
n
)
∥
x
n
-
z
∥
}
∥
x
n
+
1
-
z
∥
=
(
1
-
α
n
(
ν
-
ρ
τ
)
)
∥
x
n
-
z
∥
∥
x
n
+
1
-
z
∥
+
α
n
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
+
1
-
z
〉
+
(
1
-
α
n
ν
)
β
n
∥
S
z
-
z
∥
∥
x
n
+
1
-
z
∥
≤
1
-
α
n
(
ν
-
ρ
τ
)
2
(
∥
x
n
-
z
∥
2
+
∥
x
n
+
1
-
z
∥
2
)
+
α
n
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
+
1
-
z
〉
+
(
1
-
α
n
ν
)
β
n
∥
S
z
-
z
∥
∥
x
n
+
1
-
z
∥
which implies that
(69)
∥
x
n
+
1
-
z
∥
2
≤
1
-
α
n
(
ν
-
ρ
τ
)
1
+
α
n
(
ν
-
ρ
τ
)
∥
x
n
-
z
∥
2
+
2
α
n
1
+
α
n
(
ν
-
ρ
τ
)
〈
ρ
U
(
x
n
)
-
μ
F
(
z
)
,
x
n
+
1
-
z
〉
+
2
(
1
-
α
n
ν
)
β
n
1
+
α
n
(
ν
-
ρ
τ
)
∥
S
z
-
z
∥
∥
x
n
+
1
-
z
∥
≤
(
1
-
α
n
(
ν
-
ρ
τ
)
)
∥
x
n
-
z
∥
2
+
2
α
n
(
ν
-
ρ
τ
)
1
+
α
n
(
ν
-
ρ
τ
)
×
{
1
ν
-
ρ
τ
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
+
1
-
z
〉
+
(
1
-
α
n
ν
)
β
n
α
n
(
ν
-
ρ
τ
)
∥
S
z
-
z
∥
∥
x
n
+
1
-
z
∥
}
.
Let γ
n
=
α
n
(
ν
-
ρ
τ
) and δ
n
=
(
2
α
n
(
ν
-
ρ
τ
)
/
(
1
+
α
n
(
ν
-
ρ
τ
)
)
)
{
(
1
/
(
ν
-
ρ
τ
)
)
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
+
1
-
z
〉 + (
(
1
-
α
n
ν
)
β
n
/
α
n
(
ν
-
ρ
τ
)
)
∥
S
z
-
z
∥
∥
x
n
+
1
-
z
∥
}.
Since(70)
∑
n
=
1
∞
‍
α
n
=
∞
,
limsup
⁡
n
→
∞
{
(
1
-
α
n
ν
)
β
n
α
n
(
ν
-
ρ
τ
)
1
ν
-
ρ
τ
〈
ρ
U
(
z
)
-
μ
F
(
z
)
,
x
n
+
1
-
z
〉
+
(
1
-
α
n
ν
)
β
n
α
n
(
ν
-
ρ
τ
)
∥
S
z
-
z
∥
∥
x
n
+
1
-
z
∥
}
≤
0
.
It follows that
(71)
∑
n
=
1
∞
‍
γ
n
=
∞
,
lim
⁡
sup
⁡
n
→
∞
δ
n
γ
n
≤
0
.
Thus all the conditions of Lemma 9 are satisfied. Hence we deduce that x
n
→
z. This completes the proof.Remark 16.
In hierarchical fixed point problem (17), if S
=
I
-
(
ρ
U
-
μ
F
), then we can get the variational inequality (58). In (58), if U
=
0, then we get the variational inequality 〈
F
(
z
)
,
x
-
z
〉
≥
0, for all x
∈
Λ
∩
F
(
T
), which is just the variational inequality studied by Suzuki [27] extending the common set of solutions of a system of variational inequalities, a split equilibrium problem, and a hierarchical fixed point problem.


## 4. Conclusions

In this paper, we suggest and analyze an iterative method for finding the approximate element of the common set of solutions of (15)-(16) and (17) in real Hilbert space, which can be viewed as a refinement and improvement of some existing methods for solving a split equilibrium problem and a hierarchical fixed point problem. Some existing methods (e.g., [13, 14, 17–19, 21–23]) can be viewed as special cases of Algorithm 11. Therefore, the new algorithm is expected to be widely applicable.



---

*Source: 390956-2014-02-20.xml*