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 which are of symmetric structure mutually. 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 , is of both uniform continuity and pseudomonotonicity on C, s.t. with .
(C3) .
Algorithm 3.1. Initialization: Given arbitrarily and let for . Choose and s.t. , and . Moreover, assume , and given the iterates and , choose s.t. , where
Iterations: Compute below:
Step 1. Put
and calculate
,
,
and
, with
and
being the smallest
s.t.
Step 2. Calculate
, with
and
Step 3. Calculate
,
and
, with
and
being the smallest
s.t.
Step 4. Calculate
and
, with
,
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 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
, one has
Setting
in the last inequality, from (2.1) we get
which completes the proof.
Lemma 3.2. Linesearch rules (3.1), (3.3) of Armijo-type and sequence constructed in Algorithm 3.1 are well defined.
Proof. Observe that the rule (3.1) is analogous to the one (3.3). So it suffices to show that the latter is valid. Using the uniform continuity of on C, from one gets . In the case of , it is explicit that . In the case of , we obtain that s.t. (3.3) holds.
It is not hard to check that
and
are convex and closed for all
n. Let us show that
. Choose a
arbitrarily. Since
is Bregman’s relatively asymptotically nonexpansive mapping, by Lemma 2.2 one gets
which hence leads to
. Meanwhile, from Lemma 2.4, we get
. Thus,
So it follows from (3.3) that
By Lemma 3.1 we have
which together with (3.5), attains
Therefore, . As a result, the sequence is well defined.
Lemma 3.3. Suppose that and are the sequences generated by Algorithm 3.1. 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
, s.t.
and
. So, we have
. Noticing the convexity and closedness of
C, according to
and
, one gets
. In what follows, ones consider two aspects. If
, then
(due to
for all
). If
, by the condition on
, one gets
. So, we might assume that
. From (2.2), we get
and hence
Since
is uniformly continuous, using Lemma 2.3 we deduce that
is of boundedness. Observe that
is also of boundedness. So, using the uniform continuity of
on any bounded subset of
E, from (3.6) we have
To prove that
z lies in
, one picks
in
s.t.
. For any
k, we choose the smallest
s.t. for all
,
Because
is decreasing, we get the increasing property of
. For the sake of simplicity,
is still written as
. It is known that
for all
k (due to
). Then, putting
, one gets
. Indeed, it is evident that
. So, by (3.8) one has
. Again from the pseudomonotonicity of
one has
Let us show that
. Indeed, noticing
and
, we obtain that
Hence one gets as . Thus, taking the limit as in (3.9), from (C3) one has for all . In terms of Lemma 2.4 we conclude that z lies in .
Lemma 3.4. Suppose that and are the sequences generated by Algorithm 3.1. Then the following hold:
(i) ;
(ii) .
Proof. Note that the claim (i) is analogous to the one (ii). So it suffices to show that the second is valid. To verify the second, we discuss two cases. In case
, one 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 (2.1) we get
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, yields a contradiction. As a result, as .
In what follows, we show the first main result.
Theorem 3.1. Suppose that E is uniformly smooth and p-uniformly convex, where is of weakly sequential continuity. If under Algorithm 3.1, and , then .
Proof. Note that that the necessity is valid. So we need to only show the statement of sufficiency. Presume . Choose a arbitrarily. Clearly, . Using the definition of , we get . From (2.1), (2.6) and the three point identity of we get
where
for some
. By Lemma 2.2 we get
Noticing
, by (2.1) and (2.3) we get
Because
, by (2.1) and (2.3) we have
Combining these inequalities and (3.13), leads to
which hence leads to
Since
and
, by Lemma 2.9 we deduce that
exists. In addition, by the boundedness of
, we conclude that
,
and
are also bounded. From (3.14) we obtain
which immediately yields
Since
,
,
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 (2.1) and uniform continuity of
on bounded subsets of
, we conclude that
and
Since
is of boundedness and
E is of reflexivity, we obtain that
is nonempty. Next, let us show that
. Choose a
z in
arbitrarily. It is known that
satisfying
. By (3.15) one gets
. Since
is of boundedness, one knows that
satisfying
. So it follows that for all
,
which implies that
is
-Lipschitz continuous on
. Using Lemma 2.6, we get
Since
lies in
, by (3.14) one has
Since
,
,
and
exists, we have
and thus
. By (3.15) we get
Furthermore, by Lemma 2.2, we have
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
. Since
is uniformly continuous on any bounded subset of
, we deduce that
Now let us show
. Since
is of boundedness, it follows that
satisfying
. Thus we obtain that for all
,
which guarantees that
is
-Lipschitz continuous on
. By Lemma 2.6, we get
Combining (3.14), (3.16) and (3.19), we have
According to Lemma 3.4, we have
In addition, from (3.15) and
we infer that
and
. By Lemma 3.3 we obtain that
and
. Consequently,
Next we claim that
. Indeed, by (3.15) we immediately get
We first claim that
and
. Actually, using (3.15), (3.18) 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 2.5 one gets 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.
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
Iterations: Compute below:
Step 1. Put , and calculate , , and , where and is the smallest s.t.
.
Step 2. Calculate , with and
.
Step 3. Calculate , and , where and is the smallest s.t.
.
Step 4. Set , and calculate and , where and
.
Again put and return to Step 1.
Theorem 3.2. Suppose that the conditions (C1)-(C3) hold. If under Algorithm 3.2, and , then .
Proof. It is explicit that the necessity of Theorem 3.2 holds. Hence we need to only prove the statement of sufficiency. Assume that . In what follows, we divide our proof into four claims.
Claim 1. One shows that
for some . In fact, put . Noticing and , we obtain from (2.1) and (2.3) that
and
By the similar reasonings to those in the proof of the above theorem, we obtain
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 of boundedness.
Claim 2. One shows that
Indeed, set . By Lemma 2.2 we get
(3.22)
Set
. From (2.5), we have
Furthermore, from (3.23) one has
This together with (3.24), arrives at
which immediately yields
Indeed, by the analogous reasonings to those of (3.20), one gets
Applying (3.26), (3.23) and (3.22), we have
Claim 4. One shows that . Indeed, since E is reflexive and is bounded, one has . Choose a z in arbitrarily. It is known that satisfying . One writes for all n. In what follows, let us prove in the two possible aspects below.
Aspect 1. Assume that
s.t.
is non-increasing. It is known that
and hence
. From (3.25) and (3.22) we get
which hence yields
Since
and
is of boundedness, one obtains
,
, and
, which hence yields
. From
, it is easily known that
. Noticing
, we infer from
and the definition of
that
Hence, using (2.1) and uniform continuity of
on any bounded subset of
, we conclude that
and
Furthermore, from (3.24) and (3.22) we have
By the similar reasonings, we deduce 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 yields
So it follows that
and hence
. Thus, from (3.31) we get
We now claim that
and
. Indeed, using (3.28), (3.29) 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 (due to (3.30)), ensure that .
In what follows, we show that
. From (3.27), we have
So it follows that
, and hence
Applying (3.34) and Lemma 3.3, one gets
. Thus one has
. Consequently,
. Finally, let us prove
. One can pick
s.t.
Because
E is reflexive and
is bounded, we might assume
. Using (2.2) and
we infer that
which along with (3.31), arrives at
From (3.24) and (3.22), we get
Using uniform continuity of
on any bounded subset of
E, from (3.32) and the boundedness of
we get
Noticing
and
, we deduce that
Thanks to with , utilizing Lemma 2.8 to (3.36) one gets and hence .
Aspect 2. Assume that
satisfying
for all
k, with
being the natural-number set. Let
be formulated below
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 reasonings to those in Case 1, we get
This together with (3.38) implies that
Noticing
, by (3.39) one gets
Applying the same reasonings as in Case 1, one has 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 concludes that
Again using (3.37), one gets . Therefore, . 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.
Under Algorithm 3.1, setting one obtains the algorithm below for approximating a point in .
Algorithm 3.3. Initialization: Given arbitrarily and let . Choose and s.t. , and . Moreover, assume , and given the iterates and , choose s.t. , where
Iterations: Compute below:
Step 1. Put
, and calculate
,
,
and
, with
and
being the smallest
s.t.
Step 2. Calculate
, with
and
Step 3. Calculate and , with .
Again put and return to Step 1.
Corollary 3.1. Let the terms (C1)-(C2) with , be valid, and assume . If under Algorithm 3.3, and , then .
Next, put the identity mapping of E. Then we get . In this case, Algorithm 3.2 can be rewritten as the iterative scheme below for settling a pair of VIPs and the FPP of . By Theorem 3.2 one derives the strong convergence outcome below.
Corollary 3.2. Suppose that the condition (C2) 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, provided .