# Convergence Theorems for Hierarchical Fixed Point Problems and Variational Inequalities

Authors: Ibrahim Karahan; Murat Ozdemir
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

This paper deals with a modified iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under certain approximate assumptions of mappings and parameters. As a special case, this projection method solves some quadratic minimization problem. It should be noted that the proposed method can be regarded as a generalized version of Wang and Xu (2013), Ceng et al. (2011), Sahu et al. (2012), and many other authors.


---

## Body

## 1. Introduction

Throughout this paper,C is a nonempty closed convex subset of a real Hilbert space H; 〈
·
,
·
〉 denotes the associated inner product; ∥
·
∥ stands for the corresponding norm. Let I be the identity mapping on C and P
C the metric projection of H onto C. To begin with, let us recall the following concepts which are commonly used in the context of convex and nonlinear analysis. For all x, y
∈
C, a mapping F
:
C
→
H is said to be monotone if 〈
F
x
-
F
y
,
x
-
y
〉
≥
0, η-strongly monotone if there exists a positive real number η such that 〈
F
x
-
F
y
,
x
-
y
〉
≥
η
∥
x
-
y
∥
2, and L-Lipschitzian if there exists a positive real number L such that ∥
F
x
-
F
y
∥
≤
L
∥
x
-
y
∥. Let us also recall that a mapping T
:
C
→
C is said to be contraction if there exists a constant k
∈
[
0,1
) such that ∥
T
x
-
T
y
∥
≤
k
∥
x
-
y
∥, nonexpansive if ∥
T
x
-
T
y
∥
≤
∥
x
-
y
∥, and asymptotically nonexpansive if for each n
≥
1 there exists a positive constant k
n
≥
1 with lim
⁡
n
→
∞
k
n
=
1 such that ∥
T
n
x
-
T
n
y
∥
≤
k
n
∥
x
-
y
∥, for all x,  y
∈
C.As a generalization of asymptotically nonexpansive mappings, Sahu [1] introduced the class of nearly Lipschitzian mappings. Let us fix a sequence {
a
n
} in [
0
,
∞
) with a
n
→
0. A mapping T
:
C
→
C is called nearly Lipschitzian with respect to {
a
n
} if for each n
≥
1 there exists a constant k
n
≥
0 such that
(1)
∥
T
n
x
-
T
n
y
∥
≤
k
n
(
∥
x
-
y
∥
+
a
n
)
,
∀
x
,
y
∈
C
.
The infimum constant k
n for which (1) holds will be denoted by η
(
T
n
) and called nearly Lipschitz constant. Notice that
(2)
η
(
T
n
)
=
sup
⁡
{
∥
T
n
x
-
T
n
y
∥
∥
x
-
y
∥
+
a
n
:
x
,
y
∈
C
,
x
≠
y
}
.
A nearly Lipschitzian mapping T with sequence {
a
n
,
η
(
T
n
)
} is said to be nearly nonexpansive if η
(
T
n
)
≤
1 for n
≥
1. In this paper, we study a nearly nonexpansive mapping which is studied by some authors (see [1–4]). This type of mappings (not necessarily continuous) is important with regard to generalization of the asymptotically nonexpansive mappings. Particularly, the class of this type of mappings is an intermediate class between the class of asymptotically nonexpansive mappings and that of mappings of asymptotically nonexpansive type (please see [1] for nearly nonexpansive mappings examples).Now, we focus on the hierarchical fixed point problem for a nearly nonexpansive mappingT with respect to a nonexpansive mapping S. This problem is to find a point x
*
∈
Fix
⁡
(
T
) satisfying
(3)
〈
(
I
-
S
)
x
*
,
x
*
-
x
〉
≤
0
,
∀
x
∈
Fix
⁡
(
T
)
,
where Fix
⁡
(
T
) is the set of fixed points of T; that is, Fix
⁡
(
T
)
=
{
x
∈
C
:
T
x
=
x
}. It is easy to see that the problem (3) is equivalent to the problem of finding a point x
*
∈
C that satisfies x
*
=
P
Fix
⁡
(
T
)
S
x
*.LetN
Fix
⁡
(
T
) be the normal cone to Fix
⁡
(
T
) defined by
(4)
N
Fix
⁡
(
T
)
x
=
{
{
u
∈
H
:
〈
y
-
x
,
u
〉
≤
0
,
∀
y
∈
Fix
⁡
(
T
)
}
,
if
x
∈
Fix
⁡
(
T
)
∅
,
if
x
∉
Fix
⁡
(
T
)
.
Then, the hierarchical fixed point problem is equivalent to the variational inclusion problem which is to find a point x
*
∈
C such that
(5)
0
∈
(
I
-
S
)
x
*
+
N
Fix
⁡
(
T
)
x
*
.
The existence problem of hierarchical fixed points for a nonlinear mapping and approximation problem has been studied by several authors (see [5–12]). In 2006, Marino and Xu [13] introduced the following viscosity iterative method:
(6)
x
n
+
1
=
α
n
γ
f
(
x
n
)
+
(
I
-
α
n
A
)
T
x
n
,
∀
n
≥
0
,
where f is a contraction, T is a nonexpansive mapping, and A is a strongly positive bounded linear operator on H; that is, 〈
A
x
,
x
〉
≥
γ
∥
x
∥, ∀
x
∈
H for some γ
>
0. Under the appropriate conditions, they proved that the sequence {
x
n
} defined by (6) converges strongly to the unique solution of the variational inequality
(7)
〈
(
γ
f
-
A
)
x
*
,
x
-
x
*
〉
≤
0
,
∀
x
∈
C
,
which is the optimality condition for the minimization problem
(8)
min
⁡
x
∈
C
1
2
〈
A
x
,
x
〉
-
h
(
x
)
,
where h is a potential function for γ
f; that is, h
′
(
x
)
=
γ
f
(
x
) for all x
∈
H.In 2011, Ceng et al. [14] generalized the iterative method (6) of Marino and Xu [13] by taking a Lipschitzian mapping V and Lipschitzian and strongly monotone operator F instead of the mappings f and A, respectively. They gave the following iterative method:
(9)
x
n
+
1
=
P
C
[
α
n
ρ
V
x
n
+
(
I
-
α
n
μ
F
)
T
x
n
]
,
∀
n
≥
0
,
where P
C is a metric projection and T is a nonexpansive mapping, and they also proved that the sequence {
x
n
} generated by (9) converges strongly to the unique solution of the variational inequality
(10)
〈
(
ρ
V
-
μ
F
)
x
*
,
x
-
x
*
〉
≤
0
,
∀
x
∈
Fix
⁡
(
T
)
.
Recently, motivated by the iteration method (9) of Ceng et al. [14], Wang and Xu [15] studied the following iterative method for a hierarchical fixed point problem:
(11)
y
n
=
β
n
S
x
n
+
(
1
-
β
n
)
x
n
,
x
n
+
1
=
P
C
[
α
n
ρ
V
x
n
+
(
I
-
α
n
μ
F
)
T
y
n
]
,
kkkkkkkkkkkkkkkkkkkkkkkki
∀
n
≥
0
,
where S, T
:
C
→
C are nonexpansive mappings, V
:
C
→
H is a γ-Lipschitzian mapping, and F
:
C
→
H is a L-Lipschitzian and η-strongly monotone operator. They proved that under some suitable assumptions on the sequences {
α
n
} and {
β
n
}, the sequence {
x
n
} generated by (11) converges strongly to the hierarchical fixed point of T with respect to the mapping S which is the unique solution of the variational inequality (10). With this study, Wang and Xu extend and improve the many recent results of other authors.Let{
T
n
} be a sequence of mappings from C into H and fix a sequence {
a
n
} in [
0
,
∞
) with a
n
→
0. Then, {
T
n
} is called a sequence of nearly nonexpansive mappings [16] with respect to a sequence {
a
n
} if
(12)
∥
T
n
x
-
T
n
y
∥
≤
∥
x
-
y
∥
+
a
n
,
∀
x
,
y
∈
C
,
n
≥
1
.
It is obvious that the sequence of nearly nonexpansive mappings is a wider class of sequence of nonexpansive mappings. For the sequence of nearly nonexpansive mappings defined by (12), Sahu et al. [3] introduced a new iteration method to solve the hierarchical fixed point problem and variational inequality problem.Remark 1.
Let{
T
n
} be a sequence of nearly nonexpansive mappings. Then,(1)
for eachn
≥
1,  T
n is not a nearly nonexpansive mapping,
(2)
ifT is a mapping on C defined by T
x
=
lim
⁡
n
→
∞
T
n
x for all x
∈
C, then it is clear that T is a nonexpansive mapping.Recently, in 2012, Sahu et al. [4] introduced the following iterative method for the sequence of nearly nonexpansive mappings {
T
n
} defined by (12):
(13)
x
n
+
1
=
P
C
[
α
n
ρ
V
x
n
+
(
1
-
α
n
μ
F
)
T
n
x
n
]
,
∀
n
≥
1
.
They proved that the sequence {
x
n
} generated by (13) converges strongly to the unique solution of the variational inequality (10).Remark 2.
Since the mappingT
n is not a nearly nonexpansive mapping for each n
≥
1, if one takes T
n
∶
=
T for all n
≥
1 such that T is a nearly nonexpansive mapping, then the iteration (13) is not well defined. Hence, the main result of Sahu et al. [4] is no longer valid for a nearly nonexpansive mapping.In this paper, motivated and inspired by the work of Wang and Xu [15], we introduce a modified iterative projection method to find a hierarchical fixed point of a nearly nonexpansive mapping with respect to a nonexpansive mapping. We show that our iterative method converges strongly to the unique solution of the variational inequality (10). As a special case, the presented projection method solves some quadratic minimization problem. Also, our method improves and generalizes corresponding results of Yao et al. [5], Marino and Xu [13], Ceng et al. [14], Wang and Xu [15], Moudafi [17], Xu [18], Tian [19], and Suzuki [20].


## 2. Preliminaries

This section contains some lemmas and definitions which will be used in the proof of our main result in the following section. We writex
n
⇀
x to indicate that the sequence {
x
n
} converges weakly to x and x
n
→
x for the strong convergence. A mapping P
C
:
H
→
C is called a metric projection if there exists a unique nearest point in C denoted by P
C
x such that
(14)
∥
x
-
P
C
x
∥
=
inf
⁡
y
∈
C
∥
x
-
y
∥
,
∀
x
∈
H
.
It is easy to see that P
C is a nonexpansive mapping and it satisfies the following inequality:
(15)
〈
x
-
P
C
x
,
y
-
P
C
x
〉
≤
0
,
∀
x
∈
H
,
y
∈
C
.
Now, we give the definitions of a demicontinuous mapping, asymptotic radius, and asymptotic center.LetC be a nonempty subset of a Banach space X and T
:
C
→
C a mapping. T is called demicontinuous if x
n
→
x in X implies T
x
n
⇀
T
x in C.LetC be a nonempty closed convex subset of a uniformly convex Banach space X, {
x
n
} a bounded sequence in X, and r
:
C
→
[
0
,
∞
) a functional defined by
(16)
r
(
x
)
=
limsup
⁡
n
→
∞
∥
x
n
-
x
∥
,
x
∈
C
.
The infimum of r
(
·
) over C is called asymptotic radius of {
x
n
} with respect to C and is denoted by r
(
C
,
{
x
n
}
). A point x
~
∈
C is said to be an asymptotic center of the sequence {
x
n
} with respect to C if
(17)
r
(
x
~
)
=
min
⁡
{
r
(
x
)
:
x
∈
C
}
.
The set of all asymptotic centers is denoted by A
(
C
,
{
x
n
}
). Related with these definitions, we will use the following in our main results.Theorem 3 (see [21]).
LetC be a nonempty closed convex subset of a uniformly convex Banach space X satisfying the Opial condition. If {
x
n
} is a sequence in C such that x
n
⇀
x
~, then x
~ is the asymptotic center of {
x
n
} in C.Lemma 4 (see [1]).
LetC be a nonempty closed convex subset of a uniformly convex Banach space X and T
:
C
→
C a demicontinuous nearly Lipschitzian mapping with sequence {
a
n
,
η
(
T
n
)
} such that lim
⁡
n
→
∞
η
(
T
n
)
≤
1. If {
x
n
} is a bounded sequence in C such that
(18)
lim
⁡
m
→
∞
(
lim
⁡
n
→
∞
∥
x
n
-
T
m
x
n
∥
)
=
0
,
A
(
C
,
{
x
n
}
)
=
{
x
~
}
,
then x
~ is a fixed point of  T.Lemma 5 (see [14]).
LetV
:
C
→
H be a γ-Lipschitzian mapping and let F
:
C
→
H be a L-Lipschitzian and η-strongly monotone operator; then, for 0
≤
ρ
γ
<
μ
η,
(19)
〈
(
μ
F
-
ρ
V
)
x
-
(
μ
F
-
ρ
V
)
y
,
x
-
y
〉
≥
(
μ
η
-
ρ
γ
)
∥
x
-
y
∥
2
,
∀
x
,
y
∈
C
.
That is to say, the operator μ
F
-
ρ
V is μ
η
-
ρ
γ-strongly monotone.Lemma 6 (see [22]).
LetC be a nonempty subset of a real Hilbert space H. Suppose that λ
∈
(
0,1
) and μ
>
0. Let F
:
C
→
H be a L-Lipschitzian and η-strongly monotone operator. Define the mapping G
:
C
→
H by
(20)
G
x
=
x
-
λ
μ
F
x
,
∀
x
∈
C
.
Then, G is a contraction that provided μ
<
2
η
/
L
2. More precisely, for μ
∈
(
0,2
η
/
L
2
),
(21)
∥
G
x
-
G
y
∥
≤
(
1
-
λ
ν
)
∥
x
-
y
∥
,
∀
x
,
y
∈
C
,
where ν
=
1
-
1
-
μ
(
2
η
-
μ
L
2
)
.Lemma 7 (see [10]).
Assume that{
x
n
} is a sequence of nonnegative real numbers such that
(22)
x
n
+
1
≤
(
1
-
α
n
)
x
n
+
α
n
β
n
,
∀
n
≥
1
,
where {
α
n
} and {
β
n
} are sequences of real numbers which satisfy the following conditions:(i)
{
α
n
}
⊂
[
0,1
], and ∑
n
=
1
∞
α
n
=
∞;
(ii)
eitherlim
⁡
sup
⁡
n
→
∞
⁡
β
n
≤
0 or ∑
n
=
1
∞
α
n
β
n
<
∞.Then lim
⁡
n
→
∞
x
n
=
0.


## 3. Main Result

Theorem 8.
LetC be a nonempty closed convex subset of a real Hilbert space H. Let S be a nonexpansive mapping and T a demicontinuous nearly nonexpansive mapping on C with respect to the sequence {
a
n
} such that Fix
⁡
(
T
)
≠
∅. Let V
:
C
→
H be a γ-Lipschitzian mapping and F
:
C
→
H a L-Lipschitzian and η-strongly monotone operator such that the coefficients satisfy 0
<
μ
<
2
η
/
L
2, 0
≤
ρ
γ
<
ν, where ν
=
1
-
1
-
μ
(
2
η
-
μ
L
2
). For an arbitrarily initial value x
1
∈
C, consider the sequence {
x
n
} in C generated by
(23)
y
n
=
β
n
S
x
n
+
(
1
-
β
n
)
x
n
,
x
n
+
1
=
P
C
[
α
n
ρ
V
x
n
+
(
I
-
α
n
μ
F
)
T
n
y
n
]
,
kkkkkkkkkkkkkkkkkkkkkkkkkiki
∀
n
≥
1
,
where {
α
n
} and {
β
n
} are sequences in [
0,1
] satisfying the following conditions:(i)
lim
⁡
n
→
∞
⁡
α
n
=
0, and ∑
n
=
1
∞
α
n
=
∞;
(ii)
lim
⁡
n
→
∞
(
a
n
/
α
n
)
=
0, lim
⁡
n
→
∞
(
β
n
/
α
n
)
=
0, lim
⁡
n
→
∞
(
|
α
n
-
α
n
-
1
|
/
α
n
)
=
0, and lim
⁡
n
→
∞
(
|
β
n
-
β
n
-
1
|
/
α
n
)
=
0;
(iii)
lim
⁡
n
→
∞
∥
T
n
x
-
T
n
-
1
x
∥
=
0, and lim
⁡
n
→
∞
(
∥
T
n
x
-
T
n
-
1
x
∥
/
α
n
)
=
0, ∀
x
∈
C.Then, the sequence {
x
n
} converges strongly to x
*
∈
Fix
⁡
(
T
), where x
* is the unique solution of the variational inequality (10).Proof.
Since the mappingμ
F
-
ρ
V is a strongly monotone operator from Lemma 5, it is known that the variational inequality (10) has a unique solution. Let us denote this solution by x
*
∈
Fix
⁡
(
T
). Now, we divide our proof into five steps.
Step
1. First we show that the sequence {
x
n
} generated by (23) is bounded. From condition (ii), without loss of generality, we may suppose that β
n
≤
α
n, for all n
≥
1. Hence, we get lim
⁡
n
→
∞
β
n
=
0. Let p
∈
Fix
⁡
(
T
) and t
n
=
α
n
ρ
V
x
n
+
(
I
-
α
n
μ
F
)
T
n
y
n. Then we have
(24)
∥
y
n
-
p
∥
=
∥
β
n
S
x
n
+
(
1
-
β
n
)
x
n
-
p
∥
≤
(
1
-
β
n
)
∥
x
n
-
p
∥
+
β
n
∥
S
x
n
-
p
∥
≤
(
1
-
β
n
)
∥
x
n
-
p
∥
+
β
n
∥
S
x
n
-
S
p
∥
+
β
n
∥
S
p
-
p
∥
≤
∥
x
n
-
p
∥
+
β
n
∥
S
p
-
p
∥
,
and, by using the definition of nearly nonexpansive mapping and Lemma 6, we obtain
(25)
∥
x
n
+
1
-
p
∥
=
∥
P
C
t
n
-
P
C
p
∥
≤
∥
t
n
-
p
∥
=
∥
α
n
ρ
V
x
n
+
(
I
-
α
n
μ
F
)
T
n
y
n
-
p
∥
≤
α
n
∥
ρ
V
x
n
-
μ
F
p
∥
+
∥
(
I
-
α
n
μ
F
)
T
n
y
n
-
(
I
-
α
n
μ
F
)
T
n
p
∥
≤
α
n
ρ
γ
∥
x
n
-
p
∥
+
α
n
∥
ρ
V
p
-
μ
F
p
∥
+
(
1
-
α
n
ν
)
(
∥
y
n
-
p
∥
+
a
n
)
.
From (24) and (25), we get
(26)
∥
x
n
+
1
-
p
∥
≤
α
n
ρ
γ
∥
x
n
-
p
∥
+
α
n
∥
ρ
V
p
-
μ
F
p
∥
+
(
1
-
α
n
ν
)
(
∥
x
n
-
p
∥
+
β
n
∥
S
p
-
p
∥
+
a
n
)
≤
(
1
-
α
n
(
ν
-
ρ
γ
)
)
∥
x
n
-
p
∥
+
α
n
(
ν
-
ρ
γ
)
×
[
1
(
ν
-
ρ
γ
)
(
∥
ρ
V
p
-
μ
F
p
∥
+
∥
S
p
-
p
∥
+
a
n
α
n
)
]
.
From condition (ii), this sequence is bounded, and so we can write
(27)
∥
x
n
+
1
-
p
∥
≤
(
1
-
α
n
(
ν
-
ρ
γ
)
)
∥
x
n
-
p
∥
+
α
n
(
ν
-
ρ
γ
)
M
,
where
(28)
1
(
ν
-
ρ
γ
)
(
∥
ρ
V
p
-
μ
F
p
∥
+
∥
S
p
-
p
∥
+
a
n
α
n
)
≤
M
,
kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
∀
n
≥
1
.
Therefore, by induction, we get
(29)
∥
x
n
+
1
-
p
∥
≤
max
⁡
{
∥
x
1
-
p
∥
,
M
}
.
Hence, we obtain that {
x
n
} is bounded. So, the sequences {
y
n
}, {
T
x
n
}, {
S
x
n
}, {
V
x
n
}, and {
F
T
y
n
} are bounded too.
Step
2. Secondly, we show that lim
⁡
n
→
∞
∥
x
n
+
1
-
x
n
∥
=
0. By using the iteration (23), we have
(30)
∥
y
n
-
y
n
-
1
∥
=
∥
β
n
S
x
n
+
(
1
-
β
n
)
x
n
-
β
n
-
1
S
x
n
-
1
kikk
-
(
1
-
β
n
-
1
)
x
n
-
1
∥
≤
β
n
∥
S
x
n
-
S
x
n
-
1
∥
+
(
1
-
β
n
)
∥
x
n
-
x
n
-
1
∥
+
|
β
n
-
β
n
-
1
|
(
∥
S
x
n
-
1
∥
+
∥
x
n
-
1
∥
)
≤
∥
x
n
-
x
n
-
1
∥
+
|
β
n
-
β
n
-
1
|
M
1
,
where M
1 is a constant such that sup
⁡
n
≥
1
{
∥
S
x
n
∥
+
∥
x
n
∥
}
≤
M
1, and
(31)
∥
x
n
+
1
-
x
n
∥
≤
∥
P
C
t
n
-
P
C
t
n
-
1
∥
≤
∥
(
I
-
α
n
-
1
μ
F
)
T
n
-
1
y
n
-
1
α
n
ρ
V
x
n
+
(
I
-
α
n
μ
F
)
T
n
y
n
-
α
n
-
1
ρ
V
x
n
-
1
k
k
k
k
i
-
(
I
-
α
n
-
1
μ
F
)
T
n
-
1
y
n
-
1
∥
≤
∥
α
n
μ
F
T
n
y
n
-
1
α
n
ρ
V
(
x
n
-
x
n
-
1
)
+
(
α
n
-
α
n
-
1
)
ρ
V
x
n
-
1
k
k
k
k
k
+
(
I
-
α
n
μ
F
)
T
n
y
n
-
(
I
-
α
n
μ
F
)
T
n
y
n
-
1
k
k
k
k
k
+
T
n
y
n
-
1
-
T
n
-
1
y
n
-
1
+
α
n
-
1
μ
F
T
n
-
1
y
n
-
1
k
k
k
k
k
-
α
n
μ
F
T
n
y
n
-
1
∥
≤
α
n
ρ
γ
∥
x
n
-
x
n
-
1
∥
+
ρ
|
α
n
-
α
n
-
1
|
∥
V
x
n
-
1
∥
+
(
1
-
α
n
ν
)
∥
T
n
y
n
-
T
n
y
n
-
1
∥
+
∥
T
n
y
n
-
1
-
T
n
-
1
y
n
-
1
∥
+
μ
∥
α
n
-
1
F
T
n
-
1
y
n
-
1
-
α
n
F
T
n
y
n
-
1
∥
≤
α
n
ρ
γ
∥
x
n
-
x
n
-
1
∥
+
ρ
|
α
n
-
α
n
-
1
|
∥
V
x
n
-
1
∥
+
(
1
-
α
n
ν
)
[
∥
y
n
-
y
n
-
1
∥
+
a
n
]
+
∥
T
n
y
n
-
1
-
T
n
-
1
y
n
-
1
∥
+
μ
∥
α
n
-
1
(
F
T
n
-
1
y
n
-
1
-
F
T
n
y
n
-
1
)
k
k
k
k
k
k
k
i
-
(
α
n
-
α
n
-
1
)
F
T
n
y
n
-
1
(
F
T
n
-
1
y
n
-
1
-
F
T
n
y
n
-
1
)
∥
.
So, from (30) and (31), we get
(32)
∥
x
n
+
1
-
x
n
∥
≤
α
n
ρ
γ
∥
x
n
-
x
n
-
1
∥
+
ρ
|
α
n
-
α
n
-
1
|
∥
V
x
n
-
1
∥
+
(
1
-
α
n
ν
)
∥
x
n
-
x
n
-
1
∥
+
(
1
-
α
n
ν
)
|
β
n
-
β
n
-
1
|
M
1
+
(
1
-
α
n
ν
)
a
n
+
∥
T
n
y
n
-
1
-
T
n
-
1
y
n
-
1
∥
+
μ
α
n
-
1
L
∥
T
n
y
n
-
1
-
T
n
-
1
y
n
-
1
∥
+
|
α
n
-
α
n
-
1
|
∥
F
T
n
y
n
-
1
∥
≤
(
1
-
α
n
(
ν
-
ρ
γ
)
)
∥
x
n
-
x
n
-
1
∥
+
|
α
n
-
α
n
-
1
|
(
ρ
∥
V
x
n
-
1
∥
+
∥
F
T
n
y
n
-
1
∥
)
+
(
1
+
μ
α
n
-
1
L
)
∥
T
n
y
n
-
1
-
T
n
-
1
y
n
-
1
∥
+
|
β
n
-
β
n
-
1
|
M
1
+
a
n
≤
(
1
-
α
n
(
ν
-
ρ
γ
)
)
∥
x
n
-
x
n
-
1
∥
+
α
n
(
ν
-
ρ
γ
)
δ
n
,
where
(33)
δ
n
=
1
(
ν
-
ρ
γ
)
×
[
(
1
+
μ
α
n
-
1
L
)
∥
T
n
y
n
-
1
-
T
n
-
1
y
n
-
1
∥
α
n
k
k
k
k
k
+
(
|
α
n
-
α
n
-
1
α
n
|
+
|
β
n
-
β
n
-
1
α
n
|
)
M
2
+
a
n
α
n
∥
T
n
y
n
-
1
-
T
n
-
1
y
n
-
1
∥
α
n
∥
T
n
y
n
-
1
-
T
n
-
1
y
n
-
1
∥
α
n
]
,
sup
⁡
n
≥
1
{
ρ
∥
V
x
n
-
1
∥
+
∥
F
T
n
y
n
-
1
∥
,
M
1
}
≤
M
2
.
By using the conditions (ii) and (iii), since lim
⁡
sup
⁡
n
→
∞
δ
n
≤
0, it follows from Lemma 7 that
(34)
∥
x
n
+
1
-
x
n
∥
⟶
0
,
as
n
⟶
∞
.
Step
3. Next, we show that lim
⁡
n
→
∞
∥
x
n
-
T
x
n
∥
=
0. For n
≥
m
≥
1, we get
(35)
∥
T
n
y
n
-
T
m
x
n
∥
≤
∥
T
n
y
n
-
T
n
-
1
y
n
∥
+
∥
T
n
-
1
y
n
-
T
n
-
2
y
n
∥
+
⋯
+
∥
T
m
y
n
-
T
m
x
n
∥
≤
∥
T
n
y
n
-
T
n
-
1
y
n
∥
+
∥
T
n
-
1
y
n
-
T
n
-
2
y
n
∥
+
⋯
+
∥
y
n
-
x
n
∥
+
a
m
,
and so
(36)
∥
x
n
+
1
-
T
m
x
n
∥
=
∥
P
C
t
n
-
P
C
T
m
x
n
∥
≤
∥
α
n
ρ
V
x
n
+
(
I
-
α
n
μ
F
)
T
n
y
n
-
T
m
x
n
∥
≤
α
n
∥
ρ
V
x
n
-
μ
F
T
n
y
n
∥
+
∥
T
n
y
n
-
T
m
x
n
∥
≤
α
n
∥
ρ
V
x
n
-
μ
F
T
n
y
n
∥
+
∥
T
n
y
n
-
T
n
-
1
y
n
∥
+
∥
T
n
-
1
y
n
-
T
n
-
2
y
n
∥
+
⋯
+
∥
y
n
-
x
n
∥
+
a
m
.
Hence, we obtain from (35) and (36) that
(37)
∥
x
n
-
T
m
x
n
∥
≤
∥
x
n
-
x
n
+
1
∥
+
∥
x
n
+
1
-
T
m
x
n
∥
≤
∥
x
n
-
x
n
+
1
∥
+
α
n
∥
ρ
V
x
n
-
μ
F
T
n
y
n
∥
+
∥
T
n
y
n
-
T
n
-
1
y
n
∥
+
∥
T
n
-
1
y
n
-
T
n
-
2
y
n
∥
+
⋯
+
∥
y
n
-
x
n
∥
+
a
m
≤
∥
x
n
-
x
n
+
1
∥
+
α
n
∥
ρ
V
x
n
-
μ
F
T
n
y
n
∥
+
∥
T
n
y
n
-
T
n
-
1
y
n
∥
+
∥
T
n
-
1
y
n
-
T
n
-
2
y
n
∥
+
⋯
+
β
n
∥
S
x
n
-
x
n
∥
+
a
m
.
Since ∥
ρ
V
x
n
-
μ
F
T
n
y
n
∥ and ∥
S
x
n
-
x
n
∥ are bounded, it follows from (34), (37), condition (i), and condition (iii) that
(38)
lim
⁡
m
→
∞
(
lim
⁡
n
→
∞
∥
x
n
-
T
m
x
n
∥
)
=
0
.
Combining (38) and condition (iii), we have
(39)
∥
x
n
-
T
x
n
∥
≤
∥
x
n
-
T
m
x
n
∥
+
∥
T
m
x
n
-
T
x
n
∥
⟶
0
,
as
n
,
m
⟶
∞
.
Step
4. Now, we show that limsup
⁡
n
→
∞
〈
(
ρ
V
-
μ
F
)
x
*
,
x
n
-
x
*
〉
≤
0, where x
* is the unique solution of the variational inequality (10). Since the sequence {
x
n
} is bounded, it has a weak convergent subsequence {
x
n
k
} such that
(40)
limsup
⁡
n
→
∞
〈
(
ρ
V
-
μ
F
)
x
*
,
x
n
-
x
*
〉
=
limsup
⁡
k
→
∞
〈
(
ρ
V
-
μ
F
)
x
*
,
x
n
k
-
x
*
〉
.
Let x
n
k
⇀
x
~, as k
→
∞. Then, Opial’s condition guarantees that the weakly subsequential limit of {
x
n
} is unique. Hence, this implies that x
n
⇀
x
~, as n
→
∞. So, it follows from (38), Theorem 3, and Lemma 4 that x
~
∈
Fix
⁡
(
T
). Therefore
(41)
limsup
⁡
n
→
∞
〈
(
ρ
V
-
μ
F
)
x
*
,
x
n
-
x
*
〉
=
〈
(
ρ
V
-
μ
F
)
x
*
,
x
~
-
x
*
〉
≤
0
.
Step
5. Finally, we show that the sequence {
x
n
} converges strongly to x
*. By using inequality (15), we have
(42)
∥
x
n
+
1
-
x
*
∥
2
=
〈
P
C
t
n
-
x
*
,
x
n
+
1
-
x
*
〉
=
〈
P
C
t
n
-
t
n
,
x
n
+
1
-
x
*
〉
+
〈
t
n
-
x
*
,
x
n
+
1
-
x
*
〉
≤
〈
α
n
ρ
V
x
n
+
(
I
-
α
n
μ
F
)
T
n
y
n
-
x
*
,
x
n
+
1
-
x
*
〉
=
〈
(
I
-
α
n
μ
F
)
T
n
x
*
α
n
(
ρ
V
x
n
-
μ
F
x
*
)
+
(
I
-
α
n
μ
F
)
T
n
y
n
k
i
-
(
I
-
α
n
μ
F
)
T
n
x
*
,
x
n
+
1
-
x
*
〉
=
α
n
ρ
〈
V
x
n
-
V
x
*
,
x
n
+
1
-
x
*
〉
+
α
n
〈
ρ
V
x
*
-
μ
F
x
*
,
x
n
+
1
-
x
*
〉
+
〈
(
I
-
α
n
μ
F
)
T
n
y
n
-
(
I
-
α
n
μ
F
)
T
n
x
*
,
x
n
+
1
-
x
*
〉
≤
α
n
ρ
γ
∥
x
n
-
x
*
∥
∥
x
n
+
1
-
x
*
∥
+
α
n
〈
ρ
V
x
*
-
μ
F
x
*
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
(
∥
y
n
-
x
*
∥
+
a
n
)
∥
x
n
+
1
-
x
*
∥
.
Also, by using inequality (24), we get
(43)
∥
x
n
+
1
-
x
*
∥
2
≤
α
n
ρ
γ
∥
x
n
-
x
*
∥
∥
x
n
+
1
-
x
*
∥
+
α
n
〈
ρ
V
x
*
-
μ
F
x
*
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
(
∥
x
n
-
x
*
∥
+
β
n
∥
S
x
*
-
x
*
∥
+
a
n
)
×
∥
x
n
+
1
-
x
*
∥
≤
(
1
-
α
n
(
ν
-
ρ
γ
)
)
∥
x
n
-
x
*
∥
∥
x
n
+
1
-
x
*
∥
+
α
n
〈
ρ
V
x
*
-
μ
F
x
*
,
x
n
+
1
-
x
*
〉
+
(
1
-
α
n
ν
)
β
n
∥
S
x
*
-
x
*
∥
∥
x
n
+
1
-
x
*
∥
+
(
1
-
α
n
ν
)
a
n
∥
x
n
+
1
-
x
*
∥
≤
(
1
-
α
n
(
ν
-
ρ
γ
)
)
2
(
∥
x
n
-
x
*
∥
2
+
∥
x
n
+
1
-
x
*
∥
2
)
+
α
n
〈
ρ
V
x
*
-
μ
F
x
*
,
x
n
+
1
-
x
*
〉
+
β
n
∥
S
x
*
-
x
*
∥
∥
x
n
+
1
-
x
*
∥
+
a
n
∥
x
n
+
1
-
x
*
∥
,
which implies that
(44)
∥
x
n
+
1
-
x
*
∥
2
≤
(
1
-
α
n
(
ν
-
ρ
γ
)
)
(
1
+
α
n
(
ν
-
ρ
γ
)
)
∥
x
n
-
x
*
∥
2
+
2
α
n
(
1
+
α
n
(
ν
-
ρ
γ
)
)
〈
ρ
V
x
*
-
μ
F
x
*
,
x
n
+
1
-
x
*
〉
+
2
β
n
(
1
+
α
n
(
ν
-
ρ
γ
)
)
∥
S
x
*
-
x
*
∥
∥
x
n
+
1
-
x
*
∥
+
2
a
n
(
1
+
α
n
(
ν
-
ρ
γ
)
)
∥
x
n
+
1
-
x
*
∥
≤
(
1
-
α
n
(
ν
-
ρ
γ
)
)
∥
x
n
-
x
*
∥
2
+
α
n
(
ν
-
ρ
γ
)
θ
n
,
where
(45)
θ
n
=
2
(
1
+
α
n
(
ν
-
ρ
γ
)
)
(
ν
-
ρ
γ
)
×
[
β
n
α
n
〈
ρ
V
x
*
-
μ
F
x
*
,
x
n
+
1
-
x
*
〉
i
k
k
+
β
n
α
n
M
3
+
a
n
α
n
∥
x
n
+
1
-
x
*
∥
]
,
sup
⁡
n
≥
1
{
∥
S
x
*
-
x
*
∥
∥
x
n
+
1
-
x
*
∥
}
≤
M
3
.
From condition (ii), by using Step 4, we get
(46)
limsup
⁡
n
→
∞
θ
n
≤
0
.
So, it follows from Lemma 7 that the sequence {
x
n
} generated by (23) converges strongly to x
*
∈
Fix
⁡
(
T
) which is the unique solution of the variational inequality (10). This completes the proof.Remark 9.
In particular, the pointx
* is the minimum norm fixed point of T; namely, x
* is the unique solution of the quadratic minimization problem
(47)
x
*
=
argmin
x
∈
Fix
⁡
(
T
)
⁡
∥
x
∥
2
.
Indeed, since the point x
* is the unique solution of the variational inequality (10), if we take V
=
0 and F
=
I, then we get
(48)
〈
〈
μ
x
*
,
x
*
-
x
〉
≤
0
,
∀
x
∈
Fix
⁡
(
T
)
〉
.
So we have
(49)
〈
x
*
,
x
*
-
x
〉
=
〈
x
*
,
x
*
〉
-
〈
x
*
,
x
〉
≤
0
⟹
∥
x
*
∥
2
≤
∥
x
*
∥
∥
x
∥
.
Hence, x
* is the unique solution to the quadratic minimization problem (47).Since a nearly nonexpansive mapping can be reduced to a nonexpansive mapping by taking the sequence{
a
n
} as a zero sequence, under the appropriate changes on the control sequences arising from Lemma 7, we can derive main results of Wang and Xu [15, Theorem 3.1] and Ceng et al. [14, Theorem 3.1] as the following corollaries.Corollary 10.
LetC be a nonempty closed convex subset of a real Hilbert space H. Let S, T
:
C
→
C be nonexpansive mappings such that Fix
⁡
(
T
)
≠
∅. Let V
:
C
→
H be a γ-Lipschitzian mapping and F
:
C
→
H a L-Lipschitzian and η-strongly monotone operator such that these coefficients satisfy 0
<
μ
<
2
η
/
L
2, 0
≤
ρ
γ
<
ν, where ν
=
1
-
1
-
μ
(
2
η
-
μ
L
2
). For an arbitrarily initial value x
1
∈
C, consider the sequence {
x
n
} in C generated by (11) where {
α
n
} and {
β
n
} are sequences in [
0,1
] satisfying the following conditions:(i)
lim
⁡
n
→
∞
⁡
α
n
=
0, and ∑
n
=
1
∞
α
n
=
∞;
(ii)
lim
⁡
n
→
∞
(
β
n
/
α
n
)
=
0;
(iii)
∑
n
=
1
∞
|
α
n
+
1
-
α
n
|
<
∞, and ∑
n
=
1
∞
|
β
n
+
1
-
β
n
|
<
∞.Then, the sequence {
x
n
} converges strongly to x
*
∈
Fix
⁡
(
T
), where x
* is the unique solution of the variational inequality (10). In particular, the point x
* is the minimum norm fixed point of T; that is, x
* is the unique solution of the quadratic minimization problem (47).Proof.
In the proof of Theorem8, for all n
≥
1, if we take the mapping T as a nonexpansive mapping, then the desired conclusion is obtained.Corollary 11.
LetC be a nonempty closed convex subset of a real Hilbert space H. Let T
:
C
→
C be a nonexpansive mapping such that Fix
⁡
(
T
)
≠
∅. Let V
:
C
→
H be a γ-Lipschitzian mapping with F
:
C
→
H being a L-Lipschitzian and η-strongly monotone operator such that these coefficients satisfy 0
<
μ
<
2
η
/
L
2, 0
≤
ρ
γ
<
ν, where ν
=
1
-
1
-
μ
(
2
η
-
μ
L
2
)
. For an arbitrarily initial value x
1
∈
C, consider the sequence {
x
n
} in C generated by (9) where {
α
n
} and {
β
n
} are sequences in [
0,1
] satisfying the following conditions:(i)
lim
⁡
n
→
∞
α
n
=
0, and ∑
n
=
1
∞
α
n
=
∞;
(ii)
either∑
n
=
1
∞
|
α
n
+
1
-
α
n
|
<
∞ or  lim
⁡
n
→
∞
(
α
n
+
1
/
α
n
)
=
0.Then, the sequence {
x
n
} converges strongly to x
*
∈
Fix
⁡
(
T
), where x
* is the unique solution of the variational inequality (10).Proof.
In the proof of Theorem8, let S
=
I where I is the identity mapping and T a nonexpansive mapping. Then, the proof is clear.Let{
T
n
} be a sequence of mappings from C into H and let {
a
m
n
} be a sequence in [
0
,
∞
) with lim
⁡
m
→
∞
a
m
n
=
0, for each n
≥
1. Then, {
T
n
} is called a sequence of nearly nonexpansive mappings with respect to a sequence {
a
m
n
} if
(50)
∥
T
n
m
x
-
T
n
m
y
∥
≤
∥
x
-
y
∥
+
a
m
n
,
kkkkkkk
∀
x
,
y
∈
C
,
n
,
m
≥
1
.
Considering Remarks 1 and 2, it is too easy to see that the sequence {
T
n
} defined by (50) is different from the sequence defined by (12) of Wong et al. [16]. The iterative scheme defined by (23) can be modified for the sequence of nearly nonexpansive mappings defined by (50). Accordingly, the problem written in the following remark arises.Remark 12.
For a sequence of nearly nonexpansive mappings (50) with a nonempty common fixed points set, it is an open problem whether or not an iteration process generated by this sequence will converge strongly to a common fixed point.Example 13.
LetH
=
R and C
=
[
0,1
]. Let S
=
I, V
x
=
3
x
+
1, F
x
=
4
x, and
(51)
T
x
=
{
1
2
,
if
x
∈
[
0
,
1
2
]
0
,
if
x
∉
(
1
2
,
1
]
for all x
∈
C. It is clear that S is nonexpansive, V is γ-Lipschitzian with γ
=
3, F is L-Lipschitzian and η-strongly monotone operator with L
=
η
=
4, and T is a nearly nonexpansive mapping with respect to the sequence {
a
n
}
=
{
1
/
2
n
2
}. Define sequences {
α
n
} and {
β
n
} in [
0,1
] by α
n
=
1
/
(
n
+
1
) and β
n
=
1
/
(
n
2
+
1
), and take μ
=
1
/
4, ρ
=
1
/
5, and ν
=
1. It is easy to see that all the conditions of Theorem 8 are satisfied. So, the sequence {
x
n
} generated by the iterative scheme (23) becomes
(52)
x
n
+
1
=
3
x
+
1
5
(
n
+
1
)
-
x
2
(
n
+
1
)
+
1
2
,
∀
x
∈
C
,
n
≥
2
,
and it converges strongly to x
*
=
1
/
2 which is the unique fixed point of T and the unique solution of the variational inequality (10) over F
(
T
). The first ten values of iterative scheme (52) for the different initial values x
1
=
0.1, x
1
=
0.5, and x
1
=
0.8 are as in Table 1.Table 1
The numerical results are obtained by using FORTRAN90 Programming Language.
x
1
1.000000
E
-
01
5.000000
E
-
01
8.000000
E
-
01
x
2
5.700000
E
-
01
5.833333
E
-
01
2.266667
E
-
01
x
3
5.642500
E
-
01
5.645834
E
-
01
5.700000
E
-
01
x
4
5.512850
E
-
01
5.512916
E
-
01
5.514000
E
-
01
x
5
5.425214
E
-
01
5.425215
E
-
01
5.425233
E
-
01
x
6
5.363218
E
-
01
5.363218
E
-
01
5.363218
E
-
01
x
7
5.317040
E
-
01
5.317040
E
-
01
5.317040
E
-
01
⋮
⋮
⋮
⋮
x
10
5.229571
E
-
01
5.229571
E
-
01
5.229571
E
-
01
⋮
⋮
⋮
⋮



---

*Source: 280158-2014-07-06.xml*