1. Introduction
Let
and
be the metric projection from
H onto
C with
C being convex and closed in a real Hilbert space
H. Suppose that the
, and
are the inner product and induced norm in
H, respectively, and given a nonlinear operator
. We denote by
the fixed-point set of
S. Furthermore,
, and → are used to represent the real number set, weak convergence, and strong convergence, respectively. A self-mapping
S on
C is known to possess asymptotical nonexpansivity if ∃ (nonnegative real sequence)
such that
with
. In particular, in case
,
S reduces to a nonexpansive mapping. Let
be a mapping. Recall that the so-called variational inequality problem (VIP) is to find
such that
Here,
denotes the set of solutions of the VIP. In 1976, under weaker assumptions, Korpelevich [
1] put forward the extragradient rule for approximating an element of
, i.e., for any starting
,
is the sequence generated by
with
. If
, then
converges weakly to an element in
. To the best of our understanding, the Korpelevich extragradient rule has been one of the most effective approaches for solving the VIP until now. The literature on the VIP is vast and the Korpelevich extragradient rule has acquired the extensive attention of numerous scholars, who ameliorated it in various ways (see, e.g., [
2,
3,
4,
5] for more details).
Recently, Thong and Hieu [
6] put forth the inertial subgradient extragradient rule, i.e., for any starting
,
is the sequence generated by
with constant
and
(see, e.g., [
7,
8,
9,
10] for more details). Under suitable assumptions, they proved the weak convergence of
to an element of
. Subsequently, Thong and Hieu [
11] introduced two inertial subgradient extragradient algorithms with a line-search process for solving the VIP with Lipschitz-continuous monotone mapping
A and the fixed-point problem (FPP) of a quasi-nonexpansive mapping
S with a demiclosedness property in
H, that is, the following Algorithms 1 and 2, which are specified concretely.
Algorithm 1: (The 1st inertial subgradient extragradient algorithm. See Algorithm 1 [11]). |
Initialization: Given and . Choose any initial . Iterations: Compute below: Step 1. Put and calculate , wherein is picked as the largest such that . Step 2. Calculate , where . Step 3. Calculate . When , we have . Put and return to Step 1. |
Algorithm 2: (The 2nd inertial subgradient extragradient algorithm. See Algorithm 2 [11]). |
Initialization: Given and . Choose any initial . Iterative steps: Compute below: Step 1. Putt and calculate , wherein is picked as the largest such that . Step 2. Calculate , where . Step 3. Calculate . When , we have . Put and return to Step 1. |
With the help of suitable assumptions, it was proven in [
11] that the sequences generated by the suggested algorithms converge weakly to a point in
. Besides, exploiting the subgradient extragradient approach along with Halpern’s iterative technique, Kraikaew and Saejung [
12] designed Halpern’s subgradient extragradient approach for settling the VIP, and showed that the sequence generated by the proposed rule converges strongly to a point in
. Recently, Reich et al. [
13] put forward both gradient-projection schemes for handling the VIP for a mapping of both uniform continuity and pseudomonotonicity. Particularly, they employed a new Armijo-like linesearch term to achieve a hyper-plane strictly separating the present iterate from the solution set of the VIP considered. It was proven in [
13] that the sequences constructed by both schemes are convergent weakly and strongly to an element of
, respectively.
On the other hand, let
where
C is convex and closed in a uniformly smooth and
p-uniformly convex Banach space
E for
satisfying
. Let
be the duality mapping of
E, and let
be the dual of
E with the duality
. Suppose that the norm and the duality pairing between
E and
are denoted by
and
, respectively. Let
,
be the Bregman distance with respect to
and
be Bregman’s projection with respect to
from
E onto
C, and presume that
such that
,
and
. Assume that
is uniformly continuous and pseudomonotone operator and
S is Bregman relatively nonexpansive self-mapping on
C. Very recently, inspired by the research works in [
13], Eskandani et al. [
14] proposed the hybrid projection approach with a line-search process for approximating a point in
(see also [
15,
16,
17,
18]), that is, the following Algorithm 3, which is specified concretely.
Algorithm 3: (Hybrid projection approach. See [14]). |
Initialization: Given and choose randomly. Iterations: Compute below: Step 1. Calculate and . If and , then stop; . If this case does not occur, then, Step 2. Calculate , with both and being the smallest such that . Step 3. Calculate and , with and . Again put and return to Step 1. |
With the help of suitable conditions, it was proven in [
14] that
converges strongly to
. Meanwhile, Wang et al. [
19] put forward modified inertial-type subgradient extragradient method with linear-search process for handling the two pseudomonotone variational inequality problems (VIPs) and the common fixed point problem (CFPP) of finite Bregman relatively nonexpansive operators and Bregman relatively demicontractive operator in
E. By the virtue of suitable restrictions, it was shown in [
19] that the sequences constructed by both suggested schemes converge weakly and strongly to a solution of a pair of VIPs with CFPP constraint, respectively. In this article, two parallel subgradient-like extragradient algorithms (with an inertial effect) are designed for resolving a pair of variational inequality and fixed-point problems (VIFPPs) in
E. Here, two variational inequality problems (VIPs) involve two uniformly continuous pseudomonotone operators and two fixed point problems implicate two uniformly continuous Bregman relatively asymptotically nonexpansive mappings. Furthermore, each algorithm consists of two parts which are of symmetric structure mutually. It is worth mentioning that the hybrid projection method with linear-search process for resolving a single VIFPP in [
14] is extended to develop our parallel subgradient-like extragradient method with an inertial effect for resolving a pair of VIFPPs. Moreover, the modified inertial-type subgradient extragradient method with linear-search process for resolving a pair of VIPs with CFPP constraint (involving finite Bregman relatively nonexpansive operators and Bregman relatively demicontractive operator) in [
19] is extended to develop our parallel subgradient-like extragradient method with an inertial effect for resolving a pair of VIFPPs (involving two Bregman relatively asymptotically nonexpansive operators). Additionally, with the help of appropriate registrations, it is proven that the sequences generated by the suggested algorithms converge weakly and strongly to a solution of this pair of VIFPPs, respectively. Lastly, an illustrative instance is presented to verify the implementability and applicability of the proposed approaches.
The structure of the article is as follows:
Section 2 presents certain terminologies and preliminary results for later use.
Section 3 is focused on discussing the convergence of the suggested algorithms. In
Section 4, the major outcomes are utilized to deal with the CFPP and VIPs in an illustrative instance. Our results improve and develop the relevant results obtained previously in [
11,
13,
14].
2. Preliminaries
Let () be a real Banach space, whose dual is denoted by . We use the and to represent the strong and weak convergence of to , respectively. Moreover, the set of weak cluster points of is denoted by , i.e., . Let and with . A Banach space E is referred to as being strictly convex if for each with , we have . E is referred to as being uniformly convex if , such that with we have . It is clear that the uniform convexity of a Banach space implies its reflexivity and strict convexity. The modulus of convexity of E is the function defined by . It is also known that E is uniformly convex if and only if . Moreover, E is referred to as being p-uniformly convex if such that for .
The nonnegative function
on
is called the modulus of smoothness of
E if
.
E is said to be uniformly smooth if
, and
q-uniformly smooth if
such that
. Recall that
E has
p-uniform convexity if and only if
has
q-uniform smoothness (see, e.g., [
20] for more details). Substituting
for each
, we say that
is uniformly convex on bounded sets (see [
14]) if
, where
is specified below
The is known as the gauge function of f with uniform convexity. It is clear that the gauge is nondecreasing.
Let be a convex function. If the limit exists for each , then f is referred to as being Gâteaux differentiable at y. In this case, the gradient of f at y has linearity and is formulated as . f is referred to as having Gâteaux differentiability if it has Gâteaux differentiability at any . In case is achieved uniformly for any , we say that f has Fréchet differentiability at y. Additionally, f is referred to as having uniform Fréchet differentiability on a subset if is achieved uniformly for . When the norm of E has Gâteaux differentiability, E is said to possess smoothness.
Let
for
. The
is specified below
It is known that
E has smoothness if and only if
has a single value from
E into
. Furthermore,
E has reflexivity if and only if
has surjectivity, and
E is strictly convex if and only if
has a one-to-one property. So, it follows that when the smooth Banach space
E has both strict convexity and reflexivity,
is the bijection and in this case,
. Furthermore, recall that
E has uniform smoothness if and only if the function
has uniform Fréchet differentiability on bounded sets if and only if
has uniform continuity on bounded sets. Moreover,
E has uniform convexity if and only if the function
has uniform convexity (see [
20]).
Let the function
possess both Gâteaux differentiability and convexity. Bregman’s distance with respect to
f is specified below
It is worth mentioning that
is not a metric in the common usage of the terminology. Evidently,
, but
cannot lead to
. Generally,
does not possess symmetry and possess fulfill any triangle inequality. However,
fulfills the three-point equality
See [
21] for more details.
It is remarkable that the
on the smooth
E is Gâteaux’s derivative of
. Thus, Bregman’s distance with respect to
is specified below
In the
p-uniformly convex and smooth Banach space
E for
, there holds the following relationship between the metric and Bregman distance:
where
is some fixed number (see [
22]). Via (
3), it can be easily seen that for each
of boundedness, the relation is valid:
Let
, with
C being convex and closed in a strictly convex, smooth, and reflexive Banach space
E. Bregman’s projection is formulated as minimizers of Bregman’s distance. Bregman’s projection of
onto
C with respect to
indicates a unique point
such that
. In the case of Hilbert space, Bregman’s projection with respect to
reduces to the metric projection. Using Theorem 2.1 [
23] and Corollary 4.4 [
24] in a uniformly convex Banach space, the characterization of Bregman’s projection is formulated by:
Additionally, (
4) is equivalent to the descent property
When
,
reduces to the normalized duality mapping and is written as
J. The
is formulated below
and
.
In terms of [
14], the function
associated with
is specified below
So,
. Moreover, from the subdifferential inequality, we obtain
In addition,
is convex in the second variable. Hence, we have
In what follows, the hybrid projection method with linear-search process for resolving a single VIFPP in [
14] is extended to develop our parallel subgradient-like extragradient method with inertial effect for resolving a pair of VIFPPs. So, we will conduct convergence analysis of our proposed algorithms in
p-uniformly convex and uniformly smooth Banach spaces, which are more general than Hilbert spaces. To successfully perform convergence analysis, we need to make use of Lemmas 1–7 below. In addition, it was shown in [
14] that Lemma 5 holds. However, for convenience, we still give its proof.
Lemma 1 ([
23])
. Let E be a uniformly convex Banach space and be two sequences in E such that the first is bounded. If , then . Assume that
S is a self-mapping on
C. Let
indicate the set of fixed points of
S, that is,
. A point
is referred to as an asymptotic fixed point of
S if
such that
and
. Let
denote the asymptotic fixed-point set of
S. The terminology of asymptotic fixed points was invented in [
25]. A self-mapping
S on
C is known to have Bregman’s relatively asymptotical nonexpansivity with respect to
if
, and
with both
and
In particular, if , then S reduces to having Bregman’s relatively nonexpansivity with respect to , that is, and . In addition, a mapping is known as being
- (i)
monotone on C if ;
- (ii)
pseudo-monotone if ;
- (iii)
ℓ-Lipschitz continuous or ℓ-Lipschitzian if such that ;
- (iv)
weakly sequentially continuous if , the relation holds: .
Lemma 2 ([
14])
. Let be a constant and suppose that is a uniformly convex function on any bounded subset of a Banach space E. Then, and for , with being the gauge of f with uniform convexity.
Proof. It is easy to show the conclusion. □
Lemma 3 ([
5])
. Let be a Banach space for and suppose that has uniform continuity on any bounded subset of and has boundedness. Then, has boundedness. Lemma 4 ([
26])
. Assume with C being convex and closed, and let be of both pseudomonotonicity and continuity. Given . Then . Lemma 5. Suppose that E is a smooth and p-uniformly convex Banach space for , where has weakly sequential continuity. Assume and . If , then converges for each . Then we have the weak convergence of to an element of Ω.
Proof. First, we have
by (
3). Thus, we obtain that
possesses boundedness. Because
E is reflexive, we obtain
. Furthermore, we claim that
converges weakly to an element of
. Indeed, let
with
. Then,
and
such that
and
. Because
is weakly sequentially continuous, we obtain both
and
. Note that
. So, utilizing the convergence of the sequences
and
, we conclude that
which hence yields
. From (
3) we obtain
. This arrives at a contradiction. Therefore, this means that
converges weakly to an element of
. □
It was proven in [
27] that the following lemma holds in
. It is not difficult to check that it still holds in a Banach space.
Lemma 6. Assume with C is convex and closed. Suppose that where is defined on E. If and h are Lipschitz continuous on C with modulus , then , where represents the distance of x to K.
Lemma 7 ([
28])
. Let be a sequence of real numbers that does not decrease at infinity in the sense that, such that for all k. Assume that is defined as , with integer satisfying . Then, the following hold:- (i)
and ;
- (ii)
and .
Lemma 8 ([
29])
. Let be a sequence in satisfying , with and being real sequences satisfying the conditions: (i) and ; and (ii) or . Then, as . Lemma 9 ([
30])
. Let and be sequences of nonnegative real numbers satisfying the inequality . If and , then exists. 3. Main Results
In this section, let with C being convex and closed in uniformly smooth and p-uniformly convex Banach space E for . We are now in a position to present and analyze our iterative algorithms for approximating a common solution of a pair of VIFPPs, where each algorithm consists of two parts of a mutually symmetric structure. Assume always that the following conditions hold:
- (C1)
are the mappings of both uniform continuity and Bregman’s relatively asymptotical nonexpansivity with sequences and , respectively.
- (C2)
For , has both uniform continuity and pseudomonotonicity on C such that with .
- (C3)
.
The following lemmas are used in the proofs of our main results in the following.
Lemma 10. Suppose that is the sequence constructed in Algorithm 4. Then, the following hold: and .
Proof. Note that the former inequality is analogous to the latter. So, it suffices to show that the latter holds. Indeed, using the definition of
and properties of
, we have
Setting
in the last inequality, from (
3) we obtain
which completes the proof. □
Algorithm 4: (The 1st parallel subgradient-like extragradient approach.) |
Initialization: Given arbitrarily and let for . Choose and such that , and . Moreover, assume , and given the iterates and , choose such that , where Iterations: Compute below: Step 1. Put and calculate , , and , with and being the smallest such that
Step 2. Calculate , with and
Step 3. Calculate , and , with and being the smallest such that
|
Step 4. Calculate and , with , and
Again set and go to Step 1. |
Lemma 11. Linesearch rules (9) and (11) of Armijo-type and sequence constructed in Algorithm 4 are well defined. Proof. Observe that rule (
9) is analogous to the (
11). So, it suffices to show that the latter is valid. Using the uniform continuity of
on
C, from
one obtains
. In the case of
, it is explicit that
. In the case of
, we obtain that
such that (
11) holds.
It is not hard to verify that
and
are convex and closed for all
n. Let us show that
. Choose a
arbitrarily. Because
is a Bregman’s relatively asymptotically nonexpansive mapping, by Lemma 2 we obtain
which hence leads to
. Additionally, from Lemma 4, we obtain
. Thus,
So, it follows from (
11) that
By Lemma 10 we have
which together with (
13), attains
Therefore, . As a result, the sequence is well defined. □
Lemma 12. Suppose that and are the sequences generated by Algorithm 4. If and , then and .
Proof. Note that the former inclusion is analogous to the latter. So it suffices to show that the latter is valid. Indeed, taking a
arbitrarily, we know that
, such that
and
. So, we have
. Noticing the convexity and closedness of
C, according to
and
, we obtain
. In what follows, ones consider two aspects. If
, then
(due to
for all
). If
, by the condition on
, we obtain
. So, we might assume that
. From (
4), we obtain
and hence
Because
is uniformly continuous, using Lemma 3 we deduce that
has boundedness. Observe that
also has boundedness. So, using the uniform continuity of
on any bounded subset of
E, from (
14) we have
To prove that
z lies in
, we select
in
such that
. For any
k, we choose the smallest
such that for all
,
Because
is decreasing, we obtain the increasing property of
. For the sake of simplicity,
is still written as
. It is known that
for all
k (due to
). Then, substituting
, we obtain
. Indeed, it is evident that
. So, by (
16) we have
. Again, from the pseudomonotonicity of
we have
Let us show that
. Indeed, noticing
and
, we obtain that
Hence, we obtain
as
. Thus, taking the limit as
in (
17), from (C3) we have
for all
. In terms of Lemma 2.4 we conclude that
z lies in
. □
Lemma 13. Suppose that and are the sequences generated by Algorithm 4. Then, the following hold:
- (i)
;
- (ii)
.
Proof. Note that claim (i) is analogous to claim (ii). So, it suffices to show that the second is valid. To verify the second claim, we discuss two cases. In case
, we may presume that
satisfying
for all
n, which immediately leads to
This, together with , arrives at .
In case
, we assume that
. This ensures that
satisfying
We define
. Noticing
, from (
3) we obtain
and hence
Because
is uniformly continuous on bounded subsets of
C, we obtain
From the step size rule (
11) and the definition of
, it follows that
Now, taking the limit as
, from (
20) we have
. This, however, yields a contradiction. As a result,
as
. □
In what follows, we show the first main result.
Theorem 1. Suppose that E is uniformly smooth and p-uniformly convex, where has weakly sequential continuity. If under Algorithm 4, and , then .
Proof. Note that necessity is valid, so we need to only show sufficiency. Presume
. Choose a
arbitrarily. Clearly,
. Using the definition of
, we obtain
. From (
3) and (
8) and the three-point identity of
, we obtain
where
for some
. By Lemma 2 we obtain
Noticing
, by (
3) and (
5) we obtain
Because
, by (
3) and (
5) we have
Combining these inequalities and (
21) leads to
which hence leads to
Because
and
, by Lemma 9 we deduce that
exists. In addition, by the boundedness of
, we conclude that
,
and
are also bounded. From (
22) we obtain
which immediately yields
Because
,
,
and
exists, it follows that
,
, and
, which hence yields
. From
, it is readily known that
. Noticing
, we obtain from
and the definition of
that
Hence, using (
3) and uniform continuity of
on bounded subsets of
, we conclude that
and
Because
has boundedness and
E has reflexivity, we obtain that
is nonempty. Next, let us show that
. Choose a
z in
arbitrarily. It is known that
satisfying
. By (
23) we obtain
. Because
has boundedness, we know that
satisfying
. So, it follows that for all
,
which implies that
is
-Lipschitz continuous on
. Using Lemma 6, we obtain
Because
lies in
, by (
22) we have
Because
,
,
and
exists, we have
and thus
. By (
23) we obtain
Furthermore, by Lemma 2, we have
Taking the limit in the last inequality as
and using the uniform continuity of
on bounded subsets of
E, (25) and
, we obtain
and hence
. Because
is uniformly continuous on any bounded subset of
, we deduce that
Now, let us show
. Because
has boundedness, it follows that
satisfying
. Thus, we deduce that for all
,
which guarantees that
is
-Lipschitz continuous on
. By Lemma 6, we obtain
Combining (
22), (
24) and (
27), we have
According to Lemma 13, we have
In addition, from (
23) and
, we infer that
and
. By Lemma 12 we obtain that
and
. Consequently,
Next, we claim that
. Indeed, by (
23) we immediately obtain
We first claim that
and
. In fact, using (
23), (
26) and uniform continuity of
on
C for
, we obtain that
and
. Thus, from
and
(due to the assumptions) we deduce that
and
These, together with and , ensure that ; therefore, . This means that . As a result, by Lemma 5 we obtain the desired conclusion. □
In what follows, we prove the second main outcome for finding a solution of a pair of VIFPPs for two operators of both uniform continuity and pseudomonotonicity and two mappings of both uniform continuity and Bregman’s relatively asymptotical nonexpansivity in E.
Theorem 2. Suppose that the conditions (C1)–(C3) hold. If under Algorithm 5, and , then .
Proof. It is explicit that the necessity of Theorem 2 holds. Hence, we need to only prove sufficiency. Assume that . In what follows, we divide our proof into four claims.
Claim 1. We show that
for some
. In fact, substitute
. Noticing
and
, we obtain from (
3) and (
5) that
and
From similar reasonings to those in the proof of the above theorem, we obtain
where
for some
. This ensures that
is bounded.
Using (
8) and the last two inequalities, from
and
we obtain
which immediately arrives at the desired claim. In addition, it is easily known that
,
and
are of boundedness.
Indeed, set
. By Lemma 2 we obtain
and
Set
. From (
7), we have
Furthermore, from (
31) we have
This, together with (
32), arrives at
which immediately yields
Indeed, by analogous reasonings to those of (
28), we obtain
Applying (
30), (
31), and (
34), we have
Claim 4. We show that . Indeed, because E is reflexive and is bounded, we have . Choose a z in arbitrarily. It is known that satisfying . We write for all n. In what follows, let us prove in the two possible aspects below.
Aspect 1. Assume that
such that
is non-increasing. It is known that
and hence
. From (
30) and (
33) we obtain
which hence yields
Because
and
has boundedness, we obtain
,
, and
, which hence yields
. From
, it is easily known that
. Noticing
, we infer from
and the definition of
that
Hence, using (
3) and the uniform continuity of
on any bounded subset of
, we conclude that
and
Furthermore, from (
30) and (
32) we have
By similar reasonings, we deduce that
, which hence leads to
(due to
). Using the uniform continuity of
on bounded subsets of
, we obtain
This, together with (
36), implies that
Let us show that
. Indeed, because
, it can be readily seen that
In addition, using (
5), (
30), and (
31), we have
which hence yields
So, it follows that
and hence
. Thus, from (
39) we obtain
We now claim that
and
. Indeed, using (
36), (
37) and the uniform continuity of
on
C for
, we obtain that
and
. Thus, from
and
(due to the assumptions) we deduce that
and
These, together with
and
(due to (
38)), ensure that
.
In what follows, we show that
. From (
35), we have
So, it follows that
, and hence
Applying (
42) and Lemma 12, we obtain
. Thus, we have
. Consequently,
. Finally, let us prove
. We can select
such that
Because
E is reflexive and
is bounded, we might assume
. Using (
4) and
we infer that
which along with (
39), arrives at
From (
30) and (
32), we obtain
Using the uniform continuity of
on any bounded subset of
E, from (
40) and the boundedness of
we obtain
Noticing
and
, we deduce that
Thanks to
with
, utilizing Lemma 8 to (
44) we obtain
, and hence
.
Aspect 2. Assume that
satisfying
for all
k, with
being the natural number set. Let
be formulated below
From (
30) and (
33) it follows that
Noticing
and
, we obtain that
and
Furthermore, from (
30) and (
32) we have
Noticing
and using the similar reasonings to those in Case 1, we obtain
This together with (
46) implies that
Noticing
, by (
47) we obtain
Applying the same reasonings as in Case 1, we have that
,
and
Using (
44), we obtain
which together with (
45), yields
As a result, from (
50) we deduce that
From (
50)–(
52), we conclude that
Again using (
45), we obtain
. Therefore,
. This completes the proof. □
Algorithm 5: (The 2nd parallel subgradient-like extragradient approach.) |
Initialization: Given arbitrarily and let and for . Choose and such that , , , and . Moreover, given the iterates and , choose such that , where and
Iterations: Compute below: Step 1. Put , and calculate , , and , where and is the smallest such that
Step 2. Calculate , with and
Step 3. Calculate , and , where and is the smallest such that
Step 4. Set , and calculate and , where and
Again, set and return to Step 1. |
Remark 1. It can be easily seen from the proof of Theorem 2 that if the assumption is used in place of the assumption and , then Theorem 2 is still valid. Moreover, in comparison with the associated outcomes with [14,19], our outcomes are the improvement, extension and development of them in the aspects below. (i) The issue of seeking a solution of a single VIFPP (implicating a mapping of Bregman’s relative nonexpansivity) in [14] is developed into our issue of seeking a solution of a pair of VIFPPs (implicating both mappings of Bregman’s relatively asymptotical nonexpansivity); the hybrid-projection approach with linesearch term in [14] is developed into our parallel subgradient-like extragradient approach with inertial effect. (ii) The issue of seeking a solution of a pair of VIPs with CFPP constraint (involving finite Bregman relatively nonexpansive mappings and Bregman relatively demicontractive mapping) in [19] is developed into our issue of seeking a solution of a pair of VIFPPs (involving both mappings of Bregman’s relatively asymptotical nonexpansivity); the modified inertial-type subgradient extragradient method with linear-search process in [19] is developed into our parallel subgradient-like extragradient approach with inertial effect. Under Algorithm 4, setting we obtain the algorithm below for approximating a point in .
Corollary 1. Let the terms (C1) and (C2) with be valid, and assume . If under Algorithm 6, and , then .
Algorithm 6: (The 3rd parallel subgradient-like extragradient approach.) |
Initialization: Given arbitrarily and let . Choose and such that , and . Moreover, assume , and given the iterates and , choose such that , where
Iterations: Compute below: Step 1. Put , and calculate , , and , with and being the smallest such that
Step 2. Calculate , with and
Step 3. Calculate and , with . Again, set and return to Step 1. |
Next, set as the identity mapping of E. Then, we obtain . In this case, Algorithm 5 can be rewritten as the iterative scheme below for settling a pair of VIPs and the FPP of . By Theorem 2 we derive the strong convergence outcome below.
Corollary 2. Suppose that the condition (C2) holds, and let . For initial , choose such that , where Suppose that is the sequence constructed bywhere and are the smallest nonnegative integers k and j satisfying, respectively,and the sets , are constructed below: - (i)
and ;
- (ii)
and .
Then, , provided .
4. Implementability and Applicability
In this section, we provide an illustrative example to demonstrate the applicability and implementability of our suggested approaches. For
, we take
,
and
. First, we present an instance involving the mappings
of both uniform continuity and pseudomonotonicity and the mappings
of both uniform continuity and Bregman’s relatively asymptotical nonexpansivity satisfying
. Set
and
with the inner product and induced norm being written as
and
, respectively. The starting
values are randomly chosen in
C. For
, let
be defined as
and
for all
. Next, let us prove that
is the mapping of both Lipschitz continuity and pseudomonotonicity. In fact, for each
we have
Thus,
has Lipschitz continuity. Furthermore, we show that
has pseudomonotonicity. For any
, it is easily known that
It is easy to see that
has both Lipschitz continuity and monotonicity. Indeed, we deduce that
and
Now, let and be defined as . It is clear that for .
Furthermore,
is the mapping of Bregman’s relatively asymptotical nonexpansivity with
, and
we obtain
. In fact, note that
and
In addition, setting
, we obtain
In this case, the conditions (C1)–(C3) are satisfied.
Example 1. Let and . Given the iterates and , choose such that , where Algorithm 4 is rewritten as follows:with the sets and the step sizes being selected as in Algorithm 4. By Theorem 1, we obtain . Example 2. Let and . Given the iterates and , choose such that , where Algorithm 5 is rewritten as follows:with the sets and the step sizes being selected as in Algorithm 5. By Theorem 2, we deduce that . It is worth pointing out that the illustrating instance as above bears up the competitive strength of our suggested schemes over the existing schemes, e.g., the ones in [
14]. Indeed, we have constructed the illustrating instance of a pair of VIFPPs as above. It is clear that the existing method in [
14] is only utilized to solving a single VIFPP. So it follows that, there is no way for this approach to treat the above illustrating instance, that is, it is invalid for a pair of VIFPPs. But, our suggested approach can handle the above illustrating instance. This ensures the competitive strength of our suggested schemes over the existing schemes in the literature.