1.
Introduction
In many areas of applied sciences, a given problem is often either very difficult or impossible to solve using the ordinary analytical techniques introduced in the present literature. In such a situation, the approximate value of the desired solution is always needed. Among other things, fixed point theory suggests very useful techniques for finding the approximate values of such solutions. The desired approximate solution for such types of problems can be written as the fixed point of an appropriate operator, i.e., as the solution of an equivalent fixed point equation
where the self-map F is any suitable operator defined on a subset of a certain space. Some of these types of operators are already known in the literature, here, we present some of them. Suppose a self-map F of the given subset W of a Banach space (BS) is given. Then F is known as a Banach contraction if, for all two points μ,ν in the set W, we have
where c is any fixed scalar in [0,1). Notice that when (1.1) true for the value c exactly equal to 1 then F is called nonexpansive. As almost always, we will write FF for the fixed point set of F, that is, FF={μ0∈W:Fμ0=μ0}. If W is closed subset of a BS (even of a complete metric space) then according to the Banach Contraction Principle (BCP, for short) (see, e.g., [1,2,3,4,5] and others) that each contraction F:W→W admits a unique fixed point, namely, μ0 in W and the sequence of Picard iterates, μλ+1=Fμλ converges strongly to μ0 for all the initial values. The class of nonexpansive mappings shares important application in different fields of applied sciences [6]. The first important result for these mappings proved by Browder [7] (see, also [8,9]) in a BS setting, that establishes an existence of fixed point for them. Precisely, Browder's result states that if W is any bounded closed convex subset of a uniformly convex BS (UCBS, for short), then each nonexpansive mapping F:W→W always admits a fixed point (however not necessary unique like in BCP). A natural question arises that whether the Picard iterates converge to a fixed of a nonexpansive mapping in general like in BCP? The following simple example shows that it is not the case.
Example 1.1. Suppose W=[0,1] and assume that F:W→W is read as:
One can easily notices that F is nonexpansive but not contraction and admits a unique fixed point μ0=0.5. For all μ1=μ∈W−{0.5}, the Picard iterates produce the following sequence,
this sequence is not convergent to the desired fixed point of F.
Hence the Picard iterates are not necessarily convergent in the case of nonexpansive mappings. In this research, we are interested in providing a new class of nonlinear mappings that includes all nonexpansive mappings. The basic properties of these mappings will be established in the setting of Banach spaces. Using these properties, we prove the related convergence theorems using an appropriate, faster iterative method. The superiority of this method is compared with the other known methods by way of an example. We provide an application to our main results.
2.
Preliminaries
We need some of the known results. Suppose a Banach space L is equipped with ‖.‖. The space L will be called a UCBS [10] provided that for each choice of 0≤ε<1, a real number 0<δ<∞ can be found satisfying ‖μ+v‖2≤(1−δ), for all two elements μ,ν∈L with ‖μ‖≤1, ‖ν‖≤1 and ‖μ+v‖≥ε. On the other side, if L satisfies the property that ‖μ+ν‖<2 for all two different μ,ν∈L with ‖μ‖=‖ν‖=1, then L is called strictly convex.
The space L is said to be equipped with the Opial's property [11], if and only if for any given weakly convergent sequence, namely, {μλ} in L having limit μ0∈L, then for all ν0∈L−{μ0}, one has
Definition 2.1. [12] A function F whose domain of definition is some subset W possibly of a BS is referred to as a equipped with a condition (I) if and only if there is a self-map S:[0,∞)→[0,∞) with the restrictions S(0)=0 and S(ν)>0 for each scalar ν∈(0,∞) and ‖Fμ−μ‖≥S(ds(μ,FF)) for each choice of μ∈W, where ds(μ,FF) is the norm distance between the element μ and the set FF.
Definition 2.2. Consider a bounded sequence and denote it by {μλ} in a BS L and ∅≠W⊆L. The asymptotic radius of {μλ} corresponding to W we shall denote and define as r(W,{μλ})=inf{lim supλ→∞‖μλ−μ‖:μ∈W}. The asymptotic center of {μλ} corresponding to W we shall denote and define as A(W,μλ})={μ∈W:lim supλ→∞‖μλ−μ‖=r(W,μλ)}.
Remark 2.1. The set A(W,{μλ}) contains only one point provided that L is a UCBS. The property that A(W,{μλ}) is convex is also known in the setting of weakly compact convex sets (see, e.g., [2,3] and others).
Every UCBS has the following important property [13].
Lemma 2.1. Consider two sequences {μλ} and {νλ} in a UCBS L with lim sup λ→∞‖μλ‖≤τ, lim supλ→∞‖νλ‖≤τ. In addition, if 0<a≤aλ≤b<1 and limλ→∞‖aλμλ+(1−aλ)νλ‖=τ for some τ≥0, then limλ→∞‖μλ−νλ‖=0.
3.
The class of (α,β,γ)-nonexpansive mappings
We have precisely described some operators from the literature in the first section and provided some basic knowledge associated with them. Our strategy here is to first create a new class of operators and investigate their relationship to nonexpansive operators. Some elementary and basic results associated with these new operators (including convergence results) will also be established.
Definition 3.1. A self-map F whose domain of definition is possibly a subset W of a BS is called (α,β,γ)-nonexpansive if for all μ,ν∈W, one gets the following estimate:
where α,β,γ∈R+ are fixed scalars such that γ∈[0,1) and α+γ≤1.
From the above definition, we have the statement of the following obvious proposition.
Proposition 3.1. Suppose F is nonexpansive self-map whose domain of definition is possibly a subset W of a BS, then F is (α,β,γ)-nonexpansive.
Now one can thinks that whether the converse of the Proposition 1 holds in general? The following numerical example answers this question in negative.
Example 3.1. We now suggest a self-map F:[0,2]→[0,2] by the formula
Here F is discontinuous and so not nonexpansive. The aim is to prove that F is (α,β,γ)-nonexpansive. Put α=β=γ=12. Now
Case (1). If μ,ν∈[0,2) or μ=ν=2, then
Case (2). If μ∈[0,2) and ν=2. Then
Case (3). If ν∈[0,2) and μ=2. Then
Since each of the case, we get the desired result. It immediately follows that in this example, F is (α,β,γ)-nonexpansive self-map on its domain of definition [0,2]. Accordingly, the class of (α,β,γ)-nonexpansive self-maps properly contains as a subset the class of all nonexpansive self-maps.
Lemma 3.1. Suppose F is (α,β,γ)-nonexpansive self-map whose domain of definition is possibly a subset W of a BS with a fixed point, namely, μ0. In such a case, the estimate ‖Fμ−Fμ0‖≤‖μ−μ0‖ holds for all μ∈W and μ0∈FF.
Proof. Since μ0 is fixed point of F, we have Fμ0=μ0. Hence
Consequently ‖Fμ−Fμ0‖≤‖μ−μ0‖. This completes the required proof.
Now Lemma 3.1 suggests the following result.
Lemma 3.2. Suppose F is (α,β,γ)-nonexpansive self-map whose domain of definition is possibly a subset W of a BS L. Consequently, the set FF is closed. Also, the set FF is convex provided that W is convex and the space L is strictly convex.
The next lemma shows a very basic property of the (α,β,γ)-nonexpansive mappings.
Lemma 3.3. Suppose F is (α,β,γ)-nonexpansive self-map whose domain of definition is possibly a subset W of a BS. Then for all μ,ν∈W, it follows that
Proof. For any μ,ν∈E, we have
Accordingly, we obtained
It follows that
This is what we need.
Now we prove a demiclosedness principle.
Lemma 3.4. Suppose F is (α,β,γ)-nonexpansive self-map whose domain of definition is possibly a subset W of a BS. If the given BS satisfies the Opial's property, then the following implication holds.
Proof. From Lemma 3.3, we have
Since α+γ≤1, so α≤1−γ. It follows that
Since the underlying space has the Opial's property, one get Fμ0=μ0. This finishes the proof.
4.
Results of fixed point convergence
The study of iterative scheme is an important area of research on its own [14,15]. As we have seen in Example 1, Picard iteration is not necessarily convergent in the case of nonexpansive operators. This example suggests that we use other iterative methods. In the literature of fixed-point iterations, one can search for many iterative methods that converge in the case of nonexpansive operators and also suggest better accuracy as compared to the Picard iteration method. If W is a closed and convex subset of a Banach space, λ∈N and aλ,bλ,cλ∈(0,1). Then for μ1=μ∈W, Mann [16], Ishikawa [17], Noor [18], Agarwal [19], Abbas [20], and Thakur [21] iterative methods respectively read as follows:
Remark 4.1. It is known from [21] that the Thakur iterative method (4.6) converges faster than the iterative methods (4.1)–(4.5) under certain assumptions.
A natural question arises: does there exist an iterative method that is essentially better than all of the above iterative methods, including the Thakur iterative method (4.6)? To answer this question, Hussain et al. [22] introduced and studied the following K−iterative method:
Now, we apply the previously established properties of (α,β,γ)-nonexpansive mappings in this paper and prove the convergence of the K-iterative method (4.7) to the fixed point of these mappings. After this, we then provide another example of these mappings, which essentially exceed nonexpansive mappings, to compare the high accuracy of the K iterative method in this new setting. Using these convergence results, we suggest the K-type iterative method to solve variational inequality problems on Hilbert spaces. This will complete the paper's goals.
Lemma 4.1. Suppose that W is a self-map whose domain is possibly a closed convex subset of a UCBS L and F:W→W is any (α,β,γ)-nonexpansive mappings with FF≠∅. If {μλ} is a sequence of K iterative method (4.7), then limλ→∞||μλ−μ0|| exists for all μ0 in the set FF.
Proof. To prove the required result, we take any μ0∈FF. According to the (4.7) and Lemma 3.1,
Hence
Accordingly, it is seen that {‖μλ−μ0‖} is bounded and non-increasing sequence of real's. It follows that limλ→∞‖μλ−μ0‖ exists for each μ0 in the set FF.
The next theorem suggests the necessary and sufficient requirements for the existence of a fixed point for (α,β,γ)-nonexpansive self-maps.
Theorem 4.1. Suppose that F is a self-map whose domain is possibly closed convex subset of a UCBS L such that F:W→W is any (α,β,γ)-nonexpansive self-map with the fixed point set FF. Assume that {μλ} is a sequence of K iterative method (4.7). Then the set FF≠∅ iff the sequence {μλ} is bounded as well as limλ→∞‖Fμλ−μλ‖=0.
Proof. First prove the existence of a fixed point in the case when {μλ} is bounded and limλ→∞‖Fμλ−μλ‖=0.
To do this, we choose any μ0∈A(E,{μλ}). By Lemma 3.3, we have
It is seen that μ0,Fμ0 are both the elements of A(W,{μλ}. Since A(W,{μλ}) is a singleton set, we have μ0=Fμ0. Hence F has a fixed point, that is, FF≠∅.
In the converse, the aim is to prove that {μλ} is bounded and limλ→∞‖Fμλ−μλ‖=0 whenever FF≠∅. As by the assumption FF≠∅, we may choose any μ0∈W. So that by Lemma 6, limλ→∞||μλ−μ0|| exists as well as the sequence {μλ} is bounded. Thus we can set
It is proved in the proof of Lemma 4.1 that ‖ωλ−μ0‖≤‖μλ−μ0‖. Accordingly, one has
Now μ0 is the point of F, by Lemma 3.1, ‖Fμλ−μ0‖≤‖μλ−μ0‖. It follows that
The proof of Lemma 4.1 that ‖μλ+1−μ0‖≤aλ‖ωλ−μ0‖+(1−aλ)‖μλ−μ0‖. It follows that
Hence
From (4.9) and (4.11), we have
From (4.12), we have
Hence,
By Lemma 2.1, we have
This finishes the proof.
Sometimes the strong convergence for a certain operator is not possible in general; therefore, we need the weak convergence in such a case. Under the following conditions, we establish the weak convergence result for (α,β,γ)-nonexpansive self-maps.
Theorem 4.2. Suppose that F is a self-map whose domain is possibly closed convex subset of a UCBS L such that F:W→W is any (α,β,γ)-nonexpansive self-map with FF≠∅. Assume that {μλ} is a sequence of K iterative method (4.7) and L satisfies the Opial's property. Then the sequence {μλ} converges weakly to some fixed point of F.
Proof. The sequence {μλ} is bounded as shown in the Theorem 4.1. The space L is reflexive because of the convexity of L. Accordingly, we can find a weakly convergent subsequence {μλm} of the sequence {μλ} with a some weak limit μ0∈W. Theorem 4.1 suggests that limm→∞||Fμλm−μλm||=0. All the requirements for Lemma 3.4 are proved and hence μ0∈FF. If μ0 is the weak limit of μλ then we have done. Suppose that μ0 is not the weak limit of {μλ}, that is, there exists ν0 different form μ0 and a subsequence {μλr} of {μλ} such that {μλr} converges weakly to ν0. Using the previous technique, it follows that ν0∈FF. By keeping Lemma 4.1 and Opial's property of L, we have
Consequently, we proved, lim supλ→∞||μλ−μ0||<lim supλ→∞||μλ−μ0||. This is a contradiction and accordingly, we proved that μ0 is the only weak limit of the sequence {μλ}.
The next result is related to the strong convergence, which is based on the assumption that the domain of F is a compact set.
Theorem 4.3. Suppose that F is a self-map whose domain is possibly compact convex subset of a UCBS L such that F:W→W is any (α,β,γ)-nonexpansive self-map with FF≠∅. Assume that {μλ} is a sequence of K iterative method (4.7). Then the sequence {μλ} converges strongly to some fixed point of F.
Proof. Since the set W is convex and compact, {μλ} contained in E and has a convergent subsequence. We denote this subsequence by {μλm} with a strong limit q0∈E, that is, limλm→∞‖μλm−μ0‖=0. Suppose μ=μλm and ν=μ0, then applying Lemma 3.3, one has
By Theorem 4.1, limλk→∞||μλk−Fμλk||=0 and also from the above limλm→∞||μλm−q0||=0. Accordingly, (4.14) provides that μλm→Fμ0. It follows that Fμ0=μ0. By Lemma 4.1, limk→∞||μλ−μ0|| exists. Consequently, we have proved that μ0∈FF and μλ→μ0. This finishes proof.
In the following result, we drop the assumption that the domain of F is a compact set.
Theorem 4.4. Suppose that F is a self-map whose domain is possibly closed convex subset of a UCBS L such that F:W→W is any (α,β,γ)-nonexpansive self-map with the fixed point set FF. Assume that {μλ} is a sequence of K iterative method (4.7). If lim infλ→∞ds(μλ,FF)=0 holds, then the sequence {μλ} converges strongly to some fixed point of F.
Proof. For any μ0∈W, we have from Lemma 4.1 that limλ→∞‖μλ−μ0‖ exists. If follows that limμ→∞ds(μλ,FF) also exists. Accordingly, limλ→∞ds(μλ,FF)=0. Hence, two subsequences, namely, {μλm} of {μλ} and {pm} in FF exists with property ‖μλm−μm‖≤12m. It is aim to prove that {pm} is Cauchy in FF. To do this, we can use Lemma 6 to write that {μλ} is non-increasing. Thus, we have
It follows that limm→∞‖pm+1−pm‖=0. This proves the required. It follows from Lemma 3.2 that FF is closed hence {pm} converges to some μ0∈FF. By Lemma 4.1, limλ→∞||μλ−μ0|| exists and hence μ0 is the strong limit of {μλ}.
Now, we establish final result of this section, which is concerned with Senter and Dotson [12].
Theorem 4.5. Suppose that F is a self-map whose domain is possibly closed convex subset of a UCBS L such that F:W→W is any (α,β,γ)-nonexpansive self-map with the fixed point set FF. Assume that {μλ} is a sequence of K iterative method (4.7). If F possess condition (I), then the sequence {μλ} converges strongly to some fixed point of F.
Proof. We prove this result using the Theorem 4.4. To do this, we can write from the Theorem 4.1, lim infλ→∞||Fμλ−μλ||=0. By applying condition (I) of F, we have lim infλ→∞ds(μλ,FF)=0. Now, we can apply Theorem 4.4 to obtain the required result. This finishes the proof.
5.
Rate of convergence
In this section, we build a new example of an (α,β,γ)-nonexpansive mapping and demonstrate that it is not nonexpansive. Using this example, we compare our studied method with some other iterative methods (see tables and graphs below). According to the observations, the K-iterative method is this new class of mappings that converges faster than the corresponding iterative methods.
Example 5.1. Suppose W=[0,1] and set F on W as:
Case (1). If μ,ν∈[0,12). Then
Case (2). If μ,ν∈[12,1]. Then
Case (3). If μ∈[0,12) and ν∈[12,1]. Then
Case (4). If ν∈[0,12) and μ∈[12,1]. Then
As a result, all of the preceding cases indicate that the operator F is (α,β,γ)-nonexpansive.
Now we use Example 5.1 to compare the K iteration and other iterations numerically and graphically. First we choose aλ=0.7000,bλ=0.6500,cλ=0.9000 and list the numerical data in the Table 1. Next for u∗∈FF, we keep ||μλ−μ∗||<10−15 as our criterion for stopping point, and obtaining the graphs shown in Figure 1, where aλ=29λ+131λ+3,bλ=4λ+122λ+3,cλ=9λ+120λ+4. Tables 1–4 and Figure 1 suggest the high accuracy of the K iterates to the fixed point of F.
6.
Application
This section suggests an application of our main outcome. Suppose H denotes a Hilbert space, ∅≠W⊂H is convex as well closed. Then M:H→H is known as a monotone mapping if and only if for all μ,ν in the domain, we have
Notice that, we shall denote by V(M,W) a variational inequality problem endowed with M and W and define as
Suppose that I:H→H and PW, respectively denote the identity self-map and the nearest point projection onto W. Then according to the Bryne [23], if η>0 then the point μ∗ solves the V(M,W) if and only if μ∗ solves the equation PW(I−ηM)u. From now on, we denote by SV(M,W), the solution set of the V(M,W).
Under suitable assumptions, Byrne [23] shown that if SV(M,W) is nonempty and I−ηM, PW(I−ηM) are averaged nonexpansive, the sequence {μλ} generated by the iterative method μλ+1=PW(I−ηM)μλ, converges weakly to a solution of a point of SV(M,W).
Now, we study a V(M,W) in the setting of (α,β,γ)-nonexpansive mappings that are discontinuous in general (as shown by two examples of this paper), instead of nonexpansive operators, which are already well-known to be uniformly continuous. We suggest K-type iterative method, which is better than the many other iterative methods as shown in this paper.
Since it is well-known that every Hilbert space satisfies the Opial's condition. Hence we have the following weak convergence result.
Theorem 6.1. Suppose that SV(M,W) is non-empty and F:=PW(I−ηM) with η>0 is (α,β,γ)-nonexpansive and {μλ} is a sequence of K iterative method (4.7). Consequently, {μλ} converges weakly to a point of SV(M,W).
Proof. According to the supposition, F is (α,β,γ)-nonexpansive. The conclusions now follows from the Theorem 4.2.
Theorem 6.2. Suppose that SV(M,W) is non-empty and F:=PW(I−ηM) with η>0 is (α,β,γ)-nonexpansive and {μλ} is a sequence of K iterative method (4.7). Consequently, {μλ} converges weakly to a point of SV(M,W) provided that lim infλ→∞ds(μλ,SV(M,W))=0.
Proof. According to the supposition, F is (α,β,γ)-nonexpansive. The conclusions now follows from the Theorem 4.4.
7.
Conclusions and future works
The concept of (α,β,γ)-nonexpansive operators is introduced, and it has been shown that these operators are more general than the concept of nonexpansive operators. We studied the basic properties of these operators in a general Banach-space setting. The iterative method K is used to compute the fixed points of these operatos. The main result is used to solve variational inequality problems on Hilbert spaces. Next, we will try to use the concept of (α,β,γ)-nonexpansive mappings for solving some other problems involving differential and integral operators. As future works, the authors also have a plan to study multi-valued versions of these operators in order to solve Nash equilibrium, optimization, and inclusion problems in a more general setting of operators. Finally, we appointed the following:
(1) If we define a mapping F in a Hilbert space H endowed with inner product space, we can find a common solution to the variational inequality problem by using our iteration (4.7). This problem can be stated as follows: find ℘∗∈Δ such that
where F:W→W is a nonlinear mapping. Variational inequalities are an important and essential modeling tool in many fields such as engineering mechanics, transportation, economics, and mathematical programming, see [24,25].
(2) We can generalize our algorithm to gradient and extra-gradient projection methods, these methods are very important for finding saddle points and solving many problems in optimization, see [26].
(3) We can accelerate the convergence of the proposed algorithm by adding shrinking projection and CQ terms. These methods stimulate algorithms and improve their performance to obtain strong convergence, for more details, see [27,28,29].
(4) If we consider the mapping F as an α-inverse strongly monotone and the inertial term is added to our algorithm, then we have the inertial proximal point algorithm. This algorithm is used in many applications such as monotone variational inequalities, image restoration problems, convex optimization problems, and split convex feasibility problems, see [31,32,33,34]. For more accuracy, these problems can be expressed as mathematical models such as machine learning and the linear inverse problem.
Acknowledgments
This study is supported via funding from Prince Sattam bin Abdulaziz University project number (PSAU/2023/R/1444).
Conflict of interest
The authors declare that they have no conflict of interest.