1. Introduction
Let the
and
represent the inner product and induced norm in a real Hilbert space
H, respectively. We denote by
the nearest point projection from
H onto
C, where
and
C is convex and closed. Given
a nonlinear mapping, we denote by
the fixed point set of
T, i.e.,
. Let the
and ⇀ indicate the set of all real numbers, the strong convergence, and the weak convergence, respectively. A self-mapping
is referred to as being asymptotically nonexpansive if
s.t.
and
and
T is nonexpansive when
.
Given a continuous mapping
, a variational inequality problem (denoted by (VIP)) is:
Let us denote the set of the solution VIP by VI(
). In 1976, Korpelevich [
1] put forth the extragradient method, which has been one of the most effective approaches for solving the VIP:
for
with
L being the Lipschitz constant of
A. Weak convergence results of (2) have been obtained in studies [
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22] and references therein.
The extragradient method (2) involves solving a minimization problem over
C at each iteration when
has no closed-form solution. This could make the extragradient method (2) computationally expensive. In study [
6], Censor et al. modified (2) and introduced the subgradient extragradient:
for
with
L being the Lipschitz constant of
A. Thong and Hieu [
19] added an inertial extrapolation step to (3):
,
for
with
L being the Lipschitz constant of
A, and the weak convergence being obtained. In study [
22], Reich et al. suggested the modified projection-type method for solving the VIP with the pseudo-monotone and uniformly continuous mapping
A, given a sequence
and a contraction
with constant
. For any initial
, the sequence
is constructed below.
Furthermore, it was proven in study [
22] that the sequence
generated by Algorithm 1 converges strongly. Subsequently, Ceng, Yao and Shehu [
21] proposed a Mann-type method of (2) to solve pseudo-monotone variational inequalities and the common fixed point problem of many finitely nonexpansive self-mappings
on
C and an asymptotically nonexpansive self-mapping
on
C. Given a contraction
with constant
, let
and
with
and
. For any initial
, the sequence
is constructed below (Algorithm 2).
Algorithm 1 (see study [22]). Initialization: Given . |
Iterative Steps: Given the current iterate , calculate as follows: Step 1. Compute and . If , then stop. is a solution of . Otherwise; Step 2. Compute , where and is the smallest nonnegative integer j, satisfying ; Step 3. Compute , where and . |
Algorithm 2 (see study [21]). Initialization: Given . |
Iterative Steps: Given , compute Step 1. Set , and compute and ; Step 2. Compute , where and is the smallest nonnegative integer j, satisfying ; Step 3. Compute and where and . Again set and go to Step 1. |
Under suitable conditions, it was proven in study [
21] that the sequence
converges strongly to
if and only if
provided
, where
.
In a real Hilbert space H, let the VIP and CFPP represent the pseudo-monotone variational inequality problem with uniformly continuous mapping A, the common fixed point problem of a finite family of nonexpansive mappings , and an asymptotically nonexpansive mapping , respectively. Inspired by the above research works, we propose and analyze two modified Mann subgradient-like extragradient algorithms with the line-search process for solving the VIP and CFPP. The proposed algorithms are based on the Mann iteration method, (3) method with the line-search process, and the viscosity approximation method. Under some conditions, we establish some strong convergence results for the sequences constructed by these proposed rules. Finally, our main results are applied to handle the VIP and CFPP in an illustrated example.
The structure of the article is specified below. In
Section 2, we first recall some concepts and basic results.
Section 3 explores the strong convergence analysis of our proposed methods. Finally, in
Section 4, an illustrated example is given. Our results complement related results by Ceng, Yao, and Shehu [
21]; Reich et al. [
22]; and Ceng and Shang [
9]. Indeed, it is worth emphasizing that our problem of finding an element
is more general and more interesting than the corresponding problem of finding an element
in study [
22]. Moreover, our strong convergence theorems are more advantageous and more clever than the corresponding strong convergence ones in studies [
9,
21] because the conclusion
in the corresponding strong convergence theorems [
9,
21] is updated by our conclusion
. Without question, the strong convergence criteria for the sequence
in this paper are more convenient and more beneficial in comparison with those of studies [
9,
21].
2. Preliminaries
We say that is
(a) L-Lipschitz continuous (or L-Lipschitzian) if such that ;
(b) Monotone if ;
(c) pseudo-monotone if ;
(d) -strongly monotone if such that ;
(e) Sequentially weakly continuous if , we have .
One can see that (b) implies (c) but the converse fails. Given
, there exists a unique nearest point in
C, denoted by
(
is called a metric projection of
H onto
C), such that
. According to reference [
17], we know that the following hold:
(a) ;
(b) ;
(c) ;
(d) ;
(e) with .
Lemma 1 (see reference [4]). Let and be two real Hilbert spaces. Suppose that is uniformly continuous on bounded subsets of and M is a bounded subset of . Then, is bounded. It is easy from the subdifferential inequality of
:
Lemma 2 (see reference [23]). Let h be a real-valued function on H and define . If K is nonempty and h is Lipschitz continuous on C with modulus , then , where denotes the distance of x to K. Lemma 3 (see reference [6], Lemma 2.1). Assume that is pseudo-monotone and continuous. Then is a solution to the VIP , if and only if . Lemma 4 (see reference [24]). Let be a sequence of nonnegative numbers satisfying: , where and are sequences of real numbers such that (i) and , and (ii) or . Then . Lemma 5 (see reference [25]). Let X be a Banach space which admits a weakly continuous duality mapping, C be a nonempty closed convex subset of X, and be an asymptotically nonexpansive mapping with . Then is demiclosed at zero, i.e., if is a sequence in C such that and , then , where I is the identity mapping of X. Lemma 6 (see reference [26]). Let be a sequence of real numbers such that there exists of , satisfying for each integer . Definewhere integer and . Then (i) and ; (ii) and . 3. Our Contributions
Assume that
is an asymptotically nonexpansive mapping and is a nonexpansive mapping for such that the sequence is defined as in Algorithm 1.
is pseudo-monotone and uniformly continuous on C, s.t. for each with .
is a contraction with constant , and with .
and such that
(i) and ;
(ii) and ;
(iii) ;
(iv) .
Lemma 7. The Armijo-type search rule (5) is well defined, and consequently .
Proof. From and uniform continuity of A on C, one has . If , then . If , then ∃ (integer) , satisfying (3.1). By the firm nonexpansivity of , one obtains . Putting and , one gets , and hence . □
Lemma 8. Let and assume the function is formulated as (3.2). Then, and . In addition, if , then .
Let be the sequence constructed in Algorithm 3.
Algorithm 3 Initialization: Given . Pick . |
Iterative Steps: Given , compute Step 1. Set , and compute and ; Step 2. Compute , where and is the smallest nonnegative integer j, satisfying
Step 3. Compute and where and
Again set and go to Step 1. |
Proof. The first claim of Lemma 8 is evident. Let us show the second claim. In fact, for
, by Lemma 3 one has
. So, one obtains that
Furthermore, from (5) one has
. Thus, by Lemma 7 we get
Combining (7) and (8) arrives at
□
Lemma 9. Let be the sequence constructed in Algorithm 3, s.t. . Suppose that and s.t. . Then .
Proof. Using Algorithm 3, one obtains
, and hence
. Using the hypothesis
, we have
which together with the hypothesis
, implies that
Besides this, combining
and
yields
. □
Let us show that
for
. In fact, note that for
,
By
and
, we get
for
. This immediately arrives at
Moreover, we claim that
is as
. In fact, combining the hypotheses
and
, guarantees that
Next, let us show
. In fact, since
C is convex and closed, from
and
we get
. In what follows, we consider two cases. If
, then it is clear that
because
. Assume that
. Then, it follows from
and
that
. Using the assumption on
A, instead of the sequentially weak continuity of
A, we get
. So, we could suppose that
. Furthermore, from
, we have
. Thus,
According to the uniform continuity of
A on
C, one knows that
is bounded (due to Lemma 1). Note that
is bounded as well. Then, by (13) we have
. To show that
, we pick
s.t.
as
. For each
, let
be the smallest natural number, such that
Since
is nonincreasing, it can be readily seen that
is increasing. Noticing that
(due to
), we set
, and we get
. By (14), it gives
. The pseudomonotonicity of
A then gives
, i.e.,
Observe that , and as . So it follows that . Hence, we get as .
Next, we show that . Passing to the limit as in (15), we have . Using Lemma 3, . Furthermore, for , since Lemma 5 guarantees the demiclosedness of at zero, from and (due to (11)) we deduce that . Thus, . Hence, from and (due to (12)), we obtain that . Therefore, .
Lemma 10. Assume in Algorithm 3 is such that as . Then, .
Proof. On the contrary, suppose that
. Then,
s.t.
Note that
. In what follows, we consider two cases. □
Case 1.. In this case, we might assume that
s.t.
. Then, it follows that
, which hence yields
This reaches a contradiction.
Case 2.. In this case, there exists a subsequence of
, still denoted by
, such that
. Putting
, we get
. Since
, we have
From the step size rule (5) and the definition of
, it follows that
Using the uniform the continuity of
A on
C, from (18) we deduce that
, which together with (19) leads to
. Thus, this contradicts with (16). Consequently,
.
Theorem 1. Suppose that the sequence is constructed by Algorithm 3. Then, provided , where is the unique solution to the VIP: .
Proof. First of all, since
and
, we may assume, without loss of generality, that
and
. Clearly,
is a contraction. Hence, there exists
, such that
. Therefore,
of the VIP
Next, we show the conclusion of the theorem. With this aim, we consider the following steps.
Step 1. We claim that the following inequality holds:
Indeed, one has
which immediately yields
Thus
which together with (22), yields
Thus, from (23) and
it follows that
Thus,
. This
is bounded, and so are
.
Step 2. Let us obtain
for some
. To prove this, we first note that
On the other hand, by Algorithm 3 one has
Substituting (25) into (24), one gets
where
for some
. This immediately implies that
Indeed, we claim that for some
,
Thanks to the boundedness of
, we know that
s.t.
, which arrives at
This hence ensures that
is
L-Lipschitz continuous on
. By Lemmas 2 and 8, one obtains
Combining (21) and (27) immediately yields
From Algorithm 3, (23), and (26) it follows that
This immediately yields
Indeed, from Algorithm 3 and (23), one has
Step 5. We obtain the strong convergence to , satisfying (20).
Indeed, putting
, we deduce from (28) that
Setting we show . □
Case 1. Assume there exists
such that
is nonincreasing. Thus,
and
. Putting
, from Step 2 and
, we obtain
Since
,
and
, from the boundedness of
one has
So, it follows from Algorithm 3 and (30) that
and
Putting
, from Step 3 we obtain
Since
,
and
, from the boundedness of
one gets
Hence, by Lemma 10 we deduce that
which immediately yields
From the boundedness of
, it follows that there exists a subsequence
of
such that
Since
H is reflexive and
is bounded, we may assume, without loss of generality, that
. Thus, from (33) one gets
Furthermore, by Algorithm 3 we get
, which immediately yields
Since
and
are bounded, we obtain
, which together with the nonexpansivity of each
, arrives at
Since
and
, by Lemma 9 we infer that
. Hence from (20) and (34) one gets
which immediately leads to
Note that
, and
Consequently, applying Lemma 4 to (29), one has
.
Case 2. Suppose that
s.t.
, where
is the set of all positive integers. Define the mapping
by
By Lemma 6, we get
Putting
, from Step 2 we have
which immediately yields
Putting
, from Step 3 we get
which hence leads to
Utilizing the same inferences as in the proof of Case 1, we deduce that
and
On the other hand, from (29) we obtain
which hence arrives at
Thus,
. Furthermore, note that
Thanks to
, we get
That is,
as
.
Theorem 2. Suppose is nonexpansive and is constructed by: ,where for each , and that are chosen as in Algorithm 3, then , where is the unique solution to the VIP: . Proof. Step 1. is bounded. Indeed, using the same arguments as in Step 1 of the proof of Theorem 1, we obtain the desired assertion.
Step 2.
Indeed, using the same arguments as in Step 2 of the proof of Theorem 1, we have the result.
Step 3.
The same arguments in Step 3 of the proof of Theorem 1 give the conclusion.
Step 4.
The results follow from the same arguments as in Step 4 of the proof of Theorem 1.
Step 5. converges strongly to
, which satisfies (20), with
as a nonexpansive mapping. Letting
, we deduce from Step 4 that
Setting , we show by considering the two cases below. □
Case 1. If there exists an integer
such that
is nonincreasing, then
and
. Putting
, from Step 2 and
we obtain
which hence yields
Putting
, from Step 3 we obtain
which immediately leads to
By inference, as in Case 1, of the proof of Theorem 1, we deduce
and
Consequently, applying Lemma 4 to (37), one has
.
Case 2. Suppose that
s.t.
, where
is the set of all positive integers. Define the mapping
by
By Lemma 6, we get
The conclusion follows using same arguments as in Case 2 of the proof of Theorem 1.
We introduce a viscosity extragradient-like iterative method.
We point out that Lemmas 7–10 still hold for Algorithm
Section 3.
Algorithm 4 Initialization: Given . Let be arbitrary. |
Iterative Steps: Given , calculate Step 1. Set , and compute and . Step 2. Compute , where and is the smallest nonnegative integer j, satisfying
Step 3. Compute and where and
|
Theorem 3. Suppose is constructed by Algorithm 4. Then, provided , where is the unique solution to the VIP: .
Proof. By and , we have, without loss of generality, that and . By the same arguments as in the proof of Theorem 3.1, we have .
Next, we show the conclusion of the theorem. With this aim, we divide the rest of the proof into several steps.
Step 1. is bounded. Using the same arguments as in Step 1 of the proof of Theorem 3.1, we have inequalities (21)–(23). Thus, from (23) and
, it follows that
Inducting, we obtain
. Thus,
is bounded, and so are the sequences
.
Step 2. We show that
for some
. To prove this, we first note that
On the other hand, using the same inferences as in (25) one has
Substituting (44) into (43), one gets
where
for some
. This immediately implies that
Indeed, using the same argument as that of (26), we obtain that for some
,
From Algorithm 4, (23), and (45) it follows that
which hence yields the desired assertion.
Indeed, from Algorithm 4 and (3.19), one has
which hence leads to the desired assertion.
Step 5. converges strongly to the unique solution , which satisfies (20). This follows the argument in Step 5 of the proof of Theorem 1. □
Theorem 4. Suppose is nonexpansive and is constructed by: ,where for each , and are chosen as in Algorithm 4, then , where is the unique solution to the VIP: . Proof. Step 1. By Step 1 of the proof of Theorem 2, we see that is bounded.
Step 2. By the same arguments as in Step 2 of the proof of Theorem 2, we have
for some
.
Step 3. Step 3 of the proof of Theorem 2 gives
Step 4. Step 4 of the proof of Theorem 2 gives
Step 5. By arguments as in Step 5 of the proof of Theorem 2, we have that converges strongly to the unique solution , satisfying (20). □
Remark 1. Compared with the corresponding results in Ceng et al. [21], Reich et al. [22], and Ceng and Shang [9], our results improve and extend them in the following aspects. (i) Although the same problem of finding an element of
as considered in this paper was studied in reference [
21], our strong convergence theorems are more advantageous and more subtle than the corresponding strong convergence ones in reference [
21] because the conclusion
in the corresponding strong convergence theorems [
21] is updated by our conclusion
. Without doubt, the strong convergence criteria for the sequence
in this paper are more convenient and more beneficial in comparison with those of reference [
21]. In addition, to overcome the weakness of the strong convergence criteria in reference [
21] (i.e.,
), we make use of Maingé’s technique (i.e., Lemma 6) to derive successfully the conclusion
.
(ii) Our results reduce to the results in reference [
22] when
, where
I is the identity mapping for
.
(iii) The operator
A in reference [
9] is extended from being Lipschitz continuous and sequentially weak in continuity mapping to
A being uniformly continuous with
for each
with
. Furthermore, the hybrid inertial subgradient extragradient method with the line-search process in reference [
9] is extended in this paper. For example, the original inertial technique
is replaced by our Mann iteration approach
, and the original iterative step
is replaced by our simpler iterative one
. It is worth mentioning that the definition of
in the former formulation of
is very different from the definition of
in the latter formulation of
.
(iv) We intend to apply the SP-iteration studied in reference [
27] to the problem of finding an element of
considered in this paper in our next project. As part of our future project, we will apply our results to the appearance of fractals using ideas given in reference [
28].