1. Introduction
Suppose that () is a real Hilbert space with the induced norm . Let be the metric projection from H onto a nonempty, convex and closed . Given a nonlinear operator . We denote by the fixed-point set of S. Also, the and ⇀ are used to represent the set of all real numbers, the strong convergence and the weak convergence, respectively. A mapping is said to be strictly pseudocontractive (see [1]) if s.t. . In particular, in case , S reduces to a nonexpansive mapping. Moreover, S is said to be demicontractive if and s.t. . In particular, in case , S reduces to a quasi-nonexpansive mapping.
Let be a mapping. Consider the classical variational inequality problem (VIP) of finding s.t. . The solution set of the VIP is denoted by . In 1976, to seek an element of under weaker conditions, Korpelevich [24] put forward the extragradient approach below, i.e., for any initial , the sequence is generated by
with . If , then the sequence converges weakly to an element in . To the best of our knowledge, the Korpelevich extragradient approach is one of the most effective methods for solving the VIP at present. The literature on the VIP is vast and the Korpelevich extragradient approach has attained wide attention paid by many scholars, who ameliorated it in various forms; see e.g., [1-6, 8-9, 13-16, 19, 21-23, 25-28, 31, 34].
Furthermore, in 2018, Thong and Hieu [21] first put forward the inertial subgradient extragradient method, that is, for any initial , the sequence is generated by
with constant . Under suitable conditions, they proved the weak convergence of to an element of . Subsequently, Ceng et al. [14] introduced a modified inertial subgradient extragradient method for solving the pseudomonotone VIP and common fixed point problem (CFPP) of finite nonexpansive mappings. Let be nonexpansive for , be L-Lipschitz continuous pseudomonotone on H, and sequentially weakly continuous on C, s.t. . Let be a contraction with constant and be -strongly monotone and -Lipschitzian s.t. for . Presume that are positive sequences s.t. and . Moreover, one writes for integer with the mod function taking values in the set , i.e., if for some integers and , then if and if .
Algorithm 1.1 (see [14, Algorithm 3.1]). Initialization: Given . Let be arbitrary.
Iterative steps: Calculate as follows:
Step 1. Given the iterates and , choose s.t. , where
Step 2. Compute and .
Step 3. Construct the half-space , and compute .
Step 4. Calculate , and update
Set and go to Step 1.
Under appropriate conditions, they proved the strong convergence of to an element of . In addition, combining the subgradient extragradient method and the Halpern’s iteration method, Kraikaew and Saejung [22] proposed the Halpern subgradient extragradient rule for solving the VIP in 2014. They proved the strong convergence of the proposed method to an element in . Recently, Reich et al. [27] introduced two gradient-projection algorithms for solving the VIP for uniformly continuous pseudomonotone mapping. In particular, they used a novel Armijo-type line search to acquire a hyperplane which strictly separates the current iterate from the solutions of the VIP under consideration. They proved the weak and strong convergence of two algorithms to a solution of the VIP for uniformly continuous pseudomonotone mapping, respectively.
On the other hand, let with , let E be a p-uniformly convex and uniformly smooth Banach space and C be a convex, closed and nonempty set in E. We denote by the dual space of E. The norm and the duality pairing between E and are denoted by and , respectively. Let and be the duality mappings of E and , respectively. Let , be the Bregman distance with respect to (w.r.t) and be the Bregman projection of E onto C w.r.t. , and presume that s.t. , and . Assume that is uniformly continuous and pseudo-monotone mapping and is Bregman relatively nonexpansive mapping. Very recently, inspired by the research outcomes in [27], Eskandani et al. [31] invented the hybrid projection method with line-search process for seeking a solution of the VIP with the FPP constraint of S.
Algorithm 1.2 (see [31]). Initialization: Let , and put arbitrarily.
Iterative steps: Given the current iterate , calculate below:
Step 1. Compute and . If and , then stop; . Otherwise,
Step 2. Compute , where and is the smallest nonnegative integer k satisfying .
Step 3. Compute and , where and .
Again set and return to Step 1.
Under suitable conditions, they proved the strong convergence of Algorithm 1.2 to . Inspired by the above research outcomes, we design two inertial-type subgradient extragradient algorithms with line-search process for solving the pseudomonotone variational inequality problems (VIPs) and common fixed-point problem (CFPP) of finite Bregman relatively nonexpansive mappings and a Bregman relatively demicontractive mapping in p-uniformly convex and uniformly smooth Banach spaces. Under mild conditions, we prove weak and strong convergence of the suggested algorithms to a common solution of the VIPs and CFPP, respectively. Additionally, an illustrated example is furnished to back up the feasibility and implementability of our proposed approaches.
The structure of this paper is built below: In Sect. 2, we release some concepts and basic results for further use. In Sect. 3, we discuss the convergence analysis of the suggested algorithms. In Sect. 4, our main results are employed to solve the VIPs and CFPP in an illustrated example. Our algorithms are more advantageous and more flexible than the above Algorithms 1.1-1.2 because they involve solving the VIPs for uniformly continuous pseudomonotone mappings and the CFPP of finite Bregman relatively nonexpansive mappings and a Bregman relatively demicontractive mapping. Our results improve and extend the corresponding results announced by some others, e.g., Ceng et al. [14], Eskandani et al. [31] and Reich et al. [27].
2. Preliminaries
Let () be a real Banach space, whose dual is denoted by . We use the and to indicate 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 , one has . E is referred to as being uniformly convex if , s.t. with , one has . It is known that a uniformly convex Banach space is reflexive and strictly convex. 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 s.t. .
The modulus of smoothness is defined as . E is said to be uniformly smooth if , and q-uniformly smooth if s.t. . It is known that E is p-uniformly convex if and only if is q-uniformly smooth. For example, see [32] for more details. Putting for each , we say that is uniformly convex on bounded sets (see [31]) if , where is specified below
for all . The function is called the gauge of uniform convexity of f. It is known that is a nondecreasing function.
Let be a convex function. If the limit exists for each , then f is referred to as being Gâteaux differentiable at u. In this case, the gradient of f at u is the linear function , which is defined by for each . The function f is referred to as being Gâteaux differentiable if it is Gâteaux differentiable at each . Whenever the limit is attained uniformly for any , we say that f is Fréchet differentiable at u. Besides, f is referred to as being uniformly Fréchet differentiable on a subset if the limit is attained uniformly for . A Banach space E is called smooth if its norm is Gâteaux differentiable.
Let
with
. The duality mapping
is specified below
It is known that
E is smooth if and only if
is single-valued mapping of
E into
. Also,
E is reflexive if and only if
is surjective, and
E is strictly convex if and only if
is one-to-one. So it follows that, if
E is smooth, strictly convex and reflexive Banach space, then
is a single-valued bijection and in this case,
where
is the duality mapping of
. Besides, it is known that
E is uniformly smooth if and only if the function
is uniformly Fréchet differentiable on bounded sets if and only if
is single-valued and uniformly continuous on bounded sets. It is also known that
E is uniformly convex if and only if the function
is uniformly convex (see [32]).
Let
be a Gâteaux differentiable convex function. The Bregman distance w.r.t.
f is specified below
It is worth mentioning that the Bregman distance is not a metric in the usual sense of the term. Clearly,
but
can not yield
. Generally,
is not symmetric and does not satisfy the triangle inequality. However,
satisfies the three point identity
See [20] for more details on Bregman functions and distances.
It is noteworthy that the duality mapping
on the smooth Banach space
E is the Gâteaux derivative of the function
. Then the Bregman distance w.r.t.
is specified below
In the smooth and
p-uniformly convex Banach space
E with
, there holds the following relationship between the metric and Bregman distance:
where
is some fixed number (see [12]). From (2.1) it is readily known that for any bounded sequence
, the following holds:
Let
C be a nonempty closed convex subset of reflexive, smooth and strictly convex Banach space
E. Bregman projections are defined as minimizers of Bregman distances. The Bregman projection of
onto
C w.r.t.
is the unique element
s.t.
. In Hilbert spaces the Bregman projection w.r.t.
reduces to the metric projection. Using [18, Corollary 4.4] and [30, Theorem 2.1], in uniformly convex Banach spaces Bregman projections can be characterized by the following inequality:
Moreover, this inequality is equivalent to the descent property
In case
, the duality mapping
reduces to the normalized duality mapping and is denoted by
J. The function
is formulated below
and
.
In terms of [31], the function
associated with
is specified below
So,
. Moreover, by the subdifferential inequality, we obtain
In addition,
is convex in the second variable. Thus one has
Lemma 2.1 (see [30]). Let E be a uniformly convex Banach space and be two sequences in E such that the first one is bounded. If , then .
Let
be a mapping. We denote by
the set of fixed points of
S, that is,
. A point
is referred to as an asymptotic fixed point of
S if
s.t.
and
. We denote by
the set of asymptotic fixed points of
S. The notion of asymptotic fixed points was invented in Reich [11]. A mapping
is known as being Bregman relatively
-demicontractive w.r.t.
if
, and
s.t. for each bounded
satisfying
, the following holds:
with
. In particular, putting
for each
, one has
In addition, if
, then
S reduces to a Bregman relatively nonexpansive mapping w.r.t.
, that is,
S is said to be Bregman relatively nonexpansive w.r.t.
if
and
.
Definition 2.1. Let C be a nonempty closed convex subset of E. A mapping is referred to as being
(i) monotone on C if ;
(ii) pseudo-monotone if ;
(iii)L-Lipschitz continuous or L-Lipschitzian if s.t. ;
(iv) weakly sequentially continuous if for each , the relation holds: .
Lemma 2.2 (see [31]). Let
be a constant and suppose that
is a uniformly convex function on bounded subsets of a Banach space
E. Then
and
with
, where
is the gauge of uniform convexity of
f.
Proof. It is easy to show the conclusion.
Lemma 2.3 (see [28]). Let and be two Banach spaces. Suppose that is uniformly continuous on bounded subsets of and D is a bounded subset of . Then is bounded.
Lemma 2.4 (see [10]). Let with C being closed and convex in a Banach space E and suppose is pseudo-monotone and continuous. Then is a solution to the VIP , if and only if .
Lemma 2.5. Let and suppose that E is a smooth and p-uniformly convex Banach space with the weakly sequentially continuous duality mapping . Let and . If converges for each , and . Then converges weakly to a point in .
Proof. Using (2.1) we get
. This ensures that
is bounded. Hence, from the reflexivity of
E we have
. Also, let us show the weak convergence of
to a point in
. Indeed, let
with
. Then,
and
s.t.
and
. By the weakly sequential continuity of
one deduces that
and
. Note that
. So, exploiting the convergence of the sequences
and
, we deduce that
which hence yields
. From (2.1) we get
. This arrives at a contradiction. Consequently, the sequence
converges weakly to a point in
. □
The lemma below was put forth in by [29]. It is easy to verify that the proof of the lemma in Banach spaces is actually the same as in . Here, we present the lemma but omit the proof in Banach spaces.
Lemma 2.6. Let with C being closed and convex in a Banach space E. Suppose that where h is a real-valued function on E. If and h is Lipschitz continuous on C with modulus , then , where stands for the distance of x to K.
Lemma 2.7 (see [17]). Let be a sequence of real numbers that does not decrease at infinity in the sense that, s.t. . Let the sequence of integers be defined as , with integer satisfying . Then the following hold:
(i) and ;
(ii) and .
Lemma 2.8 (see [7]). Let be a sequence in satisfying , where and both are real sequences such that (i) and , and (ii) or . Then .
Lemma 2.9 (see [33]). Let and be sequences of nonnegative real numbers satisfying the inequality . If and , then exists.
3. Main Results
In this section, let E be a p-uniformly convex and uniformly smooth Banach space with . Let with C being closed and convex in E. We are now in a position to state and analyze our iterative algorithms for settling the VIPs for uniformly continuous pseudomonotone mappings and the CFPP of finite Bregman relatively nonexpansive mappings and a Bregman relatively demicontractive mapping in E. Assume always that the conditions hold below:
(C1) For , is a uniformly continuous and Bregman relatively nonexpansive mapping and is a uniformly continuous and Bregman relatively -demicontractive mapping.
(C2) is defined as for integer with the mod function taking values in the set , i.e., if for some integers and , then if and if .
(C3) For , is pseudomonotone and uniformly continuous on C, s.t. with .
(C4) .
Algorithm 3.1. Initialization: Given arbitrarily and let for . Choose and s.t. , and . Moreover, given the iterates and , choose s.t. , where
Iterative steps: Calculate as follows:
Step 1. Calculate
and calculate
,
,
and
, where
and
is the smallest nonnegative integer
k satisfying
Step 2. Calculate
, with
and
Step 3. Calculate
,
and
, where
and
is the smallest nonnegative integer
j satisfying
Step 4. Calculate
and
, where
,
and
Again set and go to Step 1.
The following lemmas are used in the proofs of our main results in the sequel.
Lemma 3.1. Suppose that is the sequence constructed in Algorithm 3.1. Then the relations hold: and .
Proof. Observe that the last two relations are similar. Then it suffices to show that the latter relation holds. In fact, using the definition of
and properties of
, one has
Setting
in the last inequality, from (2.1) we get
This completes the proof. □
Lemma 3.2. The Armijo-type search rules (3.1), (3.3) and the sequence constructed in Algorithm 3.1 are well defined.
Proof. Observe that the rules (3.1) and (3.3) are similar. Then it suffices to show that the latter rule (3.3) is valid. Using the uniform continuity of on C, from one gets . In case , it is evident that . In case , we know that s.t. (3.3) holds.
It is easy to check that for each
and
are convex and closed. We assert that
. Let
. Using Lemma 2.2 and the Bregman relative
-demicontractivity of
, from
we get
which hence leads to
. Moreover, by Lemma 2.4, we get
. Therefore,
So it follows from (3.3) that
Using Lemma 3.1 we have
This together with (3.5), arrives at
Consequently, . So, the sequence is well defined. □
Lemma 3.3. Suppose that and are the sequences generated by Algorithm 3.1. If and , then and .
Proof. Observe that the last two inclusions are similar. Then it suffices to show that the latter inclusion is valid. In fact, let
. Then,
, s.t.
and
. Hence, it is known that
. Since
C is of both convexity and closedness, from
and
we get
. Next, we consider two cases. If
, then
because
. If
, using the assumption on
, instead of the weakly sequential continuity of
, we get
. So, we could assume that
. From (2.2), we get
and hence
According to the uniform continuity of
, one knows that
is bounded by Lemma 2.3. Note that
is bounded as well. So, using the uniform continuity of
on bounded subsets of
E, from (3.6) we have
To prove that
, we now pick a sequence
satisfying
as
. For each
, we denote by
the smallest positive integer such that
Because
is decreasing, it is easily known that
is increasing. For convenience, we still denote
by
. Note that
(due to
). Then, putting
, one gets
. Indeed, it is evident that
. So, by (3.8) one has
. Again from the pseudomonotonicity of
one has
We assert that
. Indeed, since
and
as
, it follows that
Hence one gets
as
. Thus, taking the limit as
in (3.9), by condition (C2) we have
. By Lemma 2.4 one obtains
. □
Lemma 3.4. Suppose that and are the sequences generated by Algorithm 3.1. Then the following hold:
(i) ;
(ii) .
Proof. Observe that the assertions (i) and (ii) are similar. Then it suffices to show that assertion (ii) is valid. To verify assertion (ii), we consider two cases. In case
, we might presume that
s.t.
, which hence arrives at
This together with
, leads to
.
In case
, we presume that
. Then we know that
s.t.
We define
for each
. Applying (2.1) and noticing
, we have
and hence
Because
is uniformly continuous on bounded subsets of
C, we obtain
From the step size rule (3.3) and the definition of
, it follows that
Now, taking the limit as , from (3.12) we have . This, however, reaches a contradiction. So it follows that . □
Now, we are ready to prove the weak convergence theorem.
Theorem 3.1. Suppose that E is a p-uniformly convex and uniformly smooth Banach space with the weakly sequentially continuous duality mapping . If is the sequence generated by Algorithm 3.1, then .
Proof. It is clear that the necessity of Theorem 3.1 is valid. Next it suffices to show that the sufficiency is valid. Assume that . Let . It is clear that . Using the definition of , we get . From (2.1), (2.6) and the three point identity of we get
where
for some
. Using Lemma 2.2, we get
Since
, by (2.1) and (2.3) we get
Because
, from (2.1) and (2.3) we get
Combining (3.13) and the last two inequalities, we obtain
which hence arrives at
Since
, by Lemma 2.9 we deduce that
exists. In addition, by the boundedness of
, we conclude that
,
and
are also bounded. Using (3.14) we obtain
which immediately yields
Since
,
and
exists, it follows that
,
, and
, which hence yields
. From
, it can be readily seen that
. Noticing
, we obtain from
and the definition of
that
Hence, using (2.1) and uniform continuity of
on bounded subsets of
E, we conclude that
and
Since
is bounded and
E is reflexive, then we know that
. In what follows, we claim that
. Let
. Then,
s.t.
. From (3.15) one gets
. Since
is bounded, we know that
s.t.
. This ensures that for each
,
which implies that
is
-Lipschitz continuous on
. Using Lemma 2.6, we get
Noticing
, from the definition of
and (3.14), we have
Since
and
exists, we have
and hence
. This together with (3.15), arrives at
On the other hand, using Lemma 2.2, we get
Taking the limit in the last inequality as
, and using uniform continuity of
on bounded subsets of
E, (3.17) and
, we get
and hence
. This together with uniform continuity of
on bounded subsets of
implies that
Now let us show that
. Since
is bounded, we know that
s.t.
. This ensures that for each
,
which guarantees that
is
-Lipschitz continuous on
. By Lemma 2.6, we get
Combining (3.14), (3.16) and (3.19), we obtain
Besides, combining (3.15) and
guarantees that
and
. By Lemma 3.3 we deduce that
and
. Consequently,
Next we claim that
. Indeed, by (3.15) we immediately get
We first claim that
for
. Actually, by the definition of
, we obtain that
, which hence leads to
. Note that for
,
Utilizing the uniform continuity of each
on
C, we deduce from (3.15) and (3.21) that
and
for
. Thus, we get
for
. This immediately implies that
So it follows from that for . Therefore, . In addition, from (3.15) and , one has that . Thus, using (3.18) we get . Consequently, , and hence . This means that . As a result, applying Lemma 2.5 we conclude that . □
Next, we prove a strong convergence theorem for approximating a common solution of the VIPs for uniformly continuous pseudomonotone mappings and the CFPP of finite Bregman relatively nonexpansive mappings and a Bregman relatively demicontractive mapping in E.
Algorithm 3.2. Initialization: Given arbitrarily and let and for . Choose and s.t. , , and . Moreover, given the iterates and , choose s.t. , where and
Iterative steps: Calculate as follows:
Step 1. Set , and calculate , , and , where and is the smallest nonnegative integer k satisfying
.
Step 2. Calculate , with and
.
Step 3. Calculate , and , where and is the smallest nonnegative integer j satisfying
.
Step 4. Set , and calculate and , where and
.
Again set and go to Step 1.
Theorem 3.2. Suppose that the conditions (C1)-(C3) hold. If is the sequence generated by Algorithm 3.2, then .
Proof. It is clear that the necessity of Theorem 3.2 is valid. Next it suffices to show that the sufficiency is valid. Assume that . In what follows, we divide our proof into four claims.
Claim 1. We show that
for some
. Indeed, put
. Noticing
and
, we deduce from (2.1) and (2.3) that
and
Using the same inferences as in the proof of Theorem 3.1, we know that
where
for some
. This ensures that
is bounded.
Using (2.6) 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 also bounded.
Claim 2. We show that
Indeed, set
. By Lemma 2.2 we get
and
Set
. From (2.5), we have
On the other hand, from (3.23) we have
Substituting the above inequality into (3.24), we get
This immediately arrives at
Indeed, using the similar inferences to these of (3.20) in the proof of Theorem 3.1, we get
Applying (3.26), (3.23) and (3.22), we have
Claim 4. We show that as . Indeed, since E is reflexive and is bounded, we know that . Let . Then, s.t. . For each , we write . In what follows, we show the convergence of to zero in the following two possible cases.
Case 1. Suppose that ∃ (integer)
such that
is nonincreasing. Then
and
. From (3.25) and (3.22) we get
which hence yields
Since
and the sequence
is bounded, we obtain that
,
, and
, which hence yields
. From
, it is easily known that
. Noticing
, we deduce from
and the definition of
that
Hence, using (2.1) and uniform continuity of
on bounded subsets of
E, we conclude that
and
Furthermore, from (3.24) and (3.22) we have
By the similar inferences, we infer that
, which hence leads to
(due to
). Using uniform continuity of
on bounded subsets of
, we get
This together with (3.28) implies that
Let us show that
. Indeed, since
, it can be readily seen that
In addition, using (2.3), (3.22) and (3.23), we have
which hence arrives at
So it follows that
and hence
. This together with (3.31), leads to
Observe that for
,
Exploiting the uniform continuity of each on C, we deduce from (3.28) and (3.32) that and for . Thus, we get for . This immediately implies that for . So it follows from that for . Therefore, . In addition, from (3.30) and , one has that . Thus, using (3.29) we get . Consequently, ,
In what follows, we show that
. From (3.27), we have
So it follows that
, and hence
Using Lemma 3.4, we infer that
Applying Lemma 3.3 and (3.34), we obtain that
. Hence we get
. Consequently,
. Lastly, we show that
. We can pick a subsequence
of
such that
Because
E is reflexive and
is bounded, we may assume, without loss of generality, that
. So it follows from (2.2) and
that
This together with (3.31) ensures that
From (3.24) and (3.22), we get
Using uniform continuity of each
on
C, and uniform continuity of
on bounded subsets of
E, from (3.32) and the boundedness of
we get
Noticing
and
, we infer that
Since and , applying Lemma 2.8 to (3.36) we obtain that and hence .
Case 2. Suppose that
s.t.
, where
is the set of all positive integers. Define the mapping
by
From (3.25) and (3.22) it follows that
Noticing
and
, we obtain that
and
Also, from (3.24) and (3.22) we have
Noticing
and using the similar inferences to those in Case 1, we get
This together with (3.38) implies that
Noticing
, from (3.39) we get
Using the similar inferences to those in Case 1, we conclude that
,
and
Using (3.36), we get
which together with (3.37), hence yields
As a result, from (3.42) we deduce that
From (3.42), (3.43) and (3.44), one has that
Again from (3.37), we have . Hence . This completes the proof. □
Remark 3.1. It can be easily seen from the proof of Theorem 3.2 that if the assumption that , is used in place of the one that and , then Theorem 3.2 is still valid.
Setting in Algorithm 3.1, we immediately obtain the following algorithm for finding an element of .
Algorithm 3.3. Initialization: Given arbitrarily and let . Choose and s.t. , and . Moreover, given the iterates and , choose s.t. , where
Iterative steps: Calculate as follows:
Step 1. Set
, and calculate
,
,
and
, where
and
is the smallest nonnegative integer
k satisfying
Step 2. Calculate
, with
and
Step 3. Calculate and , where .
Again set and go to Step 1.
Corollary 3.1. Suppose that the conditions (C1)-(C3) with , hold, and . Let be the sequence constructed in Algorithm 3.3. Then .
Next, let be a Bregman relatively nonexpansive mapping and the identity mapping of E for . Then we get . In this case, Algorithm 3.2 reduces to the following iterative scheme for solving a pair of VIPs and the FPP of . By Theorem 3.2 we obtain the following strong convergence result.
Corollary 3.2. Suppose that the condition (C3) holds, and let . For initial , choose s.t. , where
Suppose that
is the sequence constructed by
where
and
are the smallest nonnegative integers
k and
j satisfying, respectively,
and the sets
, are constructed below
(i) and ;
(ii) and .
Then, .
4. Examples
In this section, we provide an illustrated example to demonstrate the feasibility and implementability of our proposed approaches. Put
,
and
for
. We first provide an example of uniformly continuous and pseudomonotone mappings
, Bregman relatively nonexpansive mapping
and Bregman relatively demicontractive mapping
with
. Let
and
with the inner product
and induced norm
. The initial points
are randomly chosen in
C. For
, let
be defined as
and
for all
. Now, we first show that
is Lipschitz continuous and pseudomonotone. Indeed, for all
we have
This implies that
is Lipschitz continuous. Also, we show that
is pseudomonotone. For each
, it is easy to see that
It is readily known that
is Lipschitz continuous and monotone. Indeed, we deduce that
and
Now, let
and
be defined as
and
. It is easy to verify that
and
is Bregman relatively nonexpansive. Also,
is Bregman relatively
-demicontractive with
. Indeed, note that
In addition, putting
, we obtain
In this case, the conditions (C1)-(C3) are satisfied.
Example 4.1. Let and . Given the iterates and , choose s.t. , where
Algorithm 3.1 is rewritten as follows:
where for each
, the sets
and the step-sizes
are chosen as in Algorithm 3.1. Then, by Theorem 3.1, we deduce that
converges to
.
Example 4.2. Let and . Given the iterates and , choose s.t. , where
Algorithm 3.2 is rewritten as follows:
where for each
, the sets
and the step-sizes
are chosen as in Algorithm 3.2. Then, by Theorem 3.2, we deduce that
converges to
.
5. Conclusions
Let with and let E be a p-uniformly convex and uniformly smooth Banach space. Then its dual space is q-uniformly smooth Banach space with . Utilizing the geometric properties of E and , we design two inertial-type subgradient extragradient algorithms with line-search process for solving the pseudomonotone variational inequality problems (VIPs) and common fixed-point problem (CFPP), where the geometric properties involve the properties of the generalized duality mappings and Bregman projection operator . Here the CFPP indicates the common fixed-point problem of finite Bregman relatively nonexpansive mapping and a Bregman relatively demicontractive mapping in E. Under the properties of the generalized duality mappings and Bregman projection operator , we prove weak and strong convergence of the suggested algorithms to a common solution of the VIPs and CFPP, respectively. Additionally, an illustrated example is furnished to demonstrate the feasibility and implementability of our proposed approaches. In the end, it is noteworthy that part of our future research is aimed at attaining the weak and strong convergence results for the modifications of our proposed approaches with Nesterov double inertial-type extrapolation steps (see [34]) and adaptive stepsizes.
References
- S. Huang, Hybrid extragradient methods for asymptotically strict pseudo-contractions in the intermediate sense and variational inequality problems, Optimization 60 (2011) 739-754. [CrossRef]
- L.O. Jolaoso, Y. Shehu, J.C. Yao, Inertial extragradient type method for mixed variational inequalities without monotonicity, Math. Comput. Simulation 192 (2022) 353-369. [CrossRef]
- Y.L. Cui, L.C. Ceng, F.F. Zhang et al., Mann hybrid deepest-descent extragradient method with line-search process for hierarchical variational inequalities for countable nonexpansive mappings, J. Math. 2023, Art. ID 6177912, 18 pp. [CrossRef]
- L.C. Ceng, T.C. Yin, Subgradient-like extragradient algorithms for systems of variational inequalities with constraints, Filomat 37 (2023) 7181-7197.
- Y. Censor, A. Gibali, S. Reich, The subgradient extragradient method for solving variational inequalities in Hilbert space, J. Optim. Theory Appl. 148 (2011) 318-335. [CrossRef]
- Y. Yao, N. Shahzad, J.C. Yao, Convergence of Tseng-type self-adaptive algorithms for variational inequalities and fixed point problems, Carpathian J. Math. 37 (2021) 541-550. [CrossRef]
- H.K. Xu, T.H. Kim, Convergence of hybrid steepest-descent methods for variational inequalities, J. Optim. Theory Appl. 119 (2003) 185-201. [CrossRef]
- L.C. Ceng, A. Petrusel, X. Qin, J.C. Yao, On inertial subgradient extragradient rule for monotone bilevel equilibrium problems, Fixed Point Theory 24 (2023) 101-126.
- L.C. Ceng, L.J. Zhu, T.C. Yin, Modified subgradient extragradient algorithms for systems of generalized equilibria with constraints, AIMS Math. 8 (2023) 2961-2994.
- R.W. Cottle, J.C. Yao, Pseudo-monotone complementarity problems in Hilbert space, J. Optim. Theory Appl. 75 (1992) 281-295. [CrossRef]
- S. Reich, A weak convergence theorem for the alternating method with Bregman distances. In: Theory and Applications of Nonlinear Operators, Marcel Dekker, New York, pp. 313-318, 1996.
- F. Schöpfer, T. Schuster, A.K. Louis, An iterative regularization method for the solution of the split feasibility problem in Banach spaces, Inverse Problems 24 (2008) Article ID 055008, 20 pp. [CrossRef]
- J. Yang, H. Liu, Z. Liu, Modified subgradient extragradient algorithms for solving monotone variational inequalities, Optimization 67 (2018) 2247-2258. [CrossRef]
- L.C. Ceng, A. Petrusel, X. Qin, J.C. Yao, A modified inertial subgradient extragradient method for solving pseudomonotone variational inequalities and common fixed point problems, Fixed Point Theory 21 (2020) 93-108.
- L.C. Ceng, S. Huang, A. Petrusel, Generalized projection and iterative methods for approximating fixed points of asymptotically weakly suppressive operators, Taiwanese J. Math. 14 (2010) 59-80. [CrossRef]
- L.C. Ceng, S. Huang, A. Petrusel, Weak convergence theorem by a modified extragradient method for nonexpansive mappings and monotone mappings, Taiwanese J. Math. 13 (2009) 225-238. [CrossRef]
- P.E. Maingé, Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization, Set-Valued Anal. 16 (2008) 899-912. [CrossRef]
- D. Butnariu, E. Resmerita, Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces, Abstr. Appl. Anal. 2006, Art. ID 84919, 39 pp. [CrossRef]
- P.T. Vuong, Y. Shehu, Convergence of an extragradient-type method for variational inequality with applications to optimal control problems, Numer. Algorithms 81 (2019) 269-291. [CrossRef]
- D. Reem, S. Reich and A. De Pierro, Re-examination of Bregman functions and new properties of their divergences, Optimization 68 (2019) 279-348. [CrossRef]
- D.V. Thong, D.V. Hieu, Modified subgradient extragradient method for variational inequality problems, Numer. Algorithms 79 (2018) 597-610. [CrossRef]
- R. Kraikaew, S. Saejung, Strong convergence of the Halpern subgradient extragradient method for solving variational inequalities in Hilbert spaces, J. Optim. Theory Appl. 163 (2014) 399-412. [CrossRef]
- L.C. Ceng, C.F. Wen, Systems of variational inequalities with hierarchical variational inequality constraints for asymptotically nonexpansive and pseudocontractive mappings, Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. RACSAM 113 (2019) 2431-2447. [CrossRef]
- G.M. Korpelevich, The extragradient method for finding saddle points and other problems, Ekonomikai Matematicheskie Metody 12 (1976) 747-756.
- L.C. Ceng, S. Huang, Modified extragradient methods for strict pseudo-contractions and monotone mappings, Taiwanese J. Math. 13 (2009) 1197-1211. [CrossRef]
- L.C. Ceng, S. Huang, A hybrid extragradient method for asymptotically strict pseudo-contractions in the intermediate sense, Fixed Point Theory 11 (2010) 189-201.
- S. Reich, D.V. Thong, Q.L. Dong, X.H. Li, V.T. Dung, New algorithms and convergence theorems for solving variational inequalities with non-Lipschitz mappings, Numer. Algorithms 87 (2021) 527-549. [CrossRef]
- A.N. Iusem, M. Nasri, Korpelevich’s method for variational inequality problems in Banach spaces, J. Global Optim. 50 (2011) 59-76. [CrossRef]
- Y.R. He, A new double projection algorithm for variational inequalities, J. Comput. Appl. Math. 185 (2006) 166-173. [CrossRef]
- D. Butnariu, A.N. Iusem, E. Resmerita, Total convexity for powers of the norm in uniformly convex Banach spaces, J. Convex Anal. 7 (2000) 319-334.
- G.Z. Eskandani, R. Lotfikar, M. Raeisi, Hybrid projection methods for solving pseudo-monotone variational inequalities in Banach spaces, to appear in Fixed Point Theory, 2023. [CrossRef]
- Y. Takahashi, K. Hashimoto, M. Kato, On sharp uniform convexity, smoothness, and strong type, cotype inequalities, J. Nonlinear Convex Anal. 3 (2002) 267-281.
- M.O. Osilike, S.C. Aniagbosor, B.G. Akuchu, Fixed points of asymptotically demicontractive mappings in arbitrary Banach spaces, PanAm. Math. J. 12 (2002) 77-88.
- Y. Yao, O.S. Iyiola, Y. Shehu, Subgradient extragradient method with double inertial steps for variational inequalities, J. Sci. Comput. 2022, Paper No. 71, 29 pp. [CrossRef]
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).