Processing math: 100%
Research article

Iterative schemes for numerical reckoning of fixed points of new nonexpansive mappings with an application

  • Received: 13 December 2022 Revised: 12 February 2023 Accepted: 16 February 2023 Published: 03 March 2023
  • MSC : 47H09, 47H10

  • The goal of this manuscript is to introduce a new class of generalized nonexpansive operators, called (α,β,γ)-nonexpansive mappings. Furthermore, some related properties of these mappings are investigated in a general Banach space. Moreover, the proposed operators utilized in the K-iterative technique estimate the fixed point and examine its behavior. Also, two examples are provided to support our main results. The numerical results clearly show that the K-iterative approach converges more quickly when used with this new class of operators. Ultimately, we used the K-type iterative method to solve a variational inequality problem on a Hilbert space.

    Citation: Kifayat Ullah, Junaid Ahmad, Hasanen A. Hammad, Reny George. Iterative schemes for numerical reckoning of fixed points of new nonexpansive mappings with an application[J]. AIMS Mathematics, 2023, 8(5): 10711-10727. doi: 10.3934/math.2023543

    Related Papers:

    [1] Shahram Rezapour, Maryam Iqbal, Afshan Batool, Sina Etemad, Thongchai Botmart . A new modified iterative scheme for finding common fixed points in Banach spaces: application in variational inequality problems. AIMS Mathematics, 2023, 8(3): 5980-5997. doi: 10.3934/math.2023301
    [2] Junaid Ahmad, Kifayat Ullah, Hasanen A. Hammad, Reny George . On fixed-point approximations for a class of nonlinear mappings based on the JK iterative scheme with application. AIMS Mathematics, 2023, 8(6): 13663-13679. doi: 10.3934/math.2023694
    [3] Muhammad Waseem Asghar, Mujahid Abbas, Cyril Dennis Enyi, McSylvester Ejighikeme Omaba . Iterative approximation of fixed points of generalized αm-nonexpansive mappings in modular spaces. AIMS Mathematics, 2023, 8(11): 26922-26944. doi: 10.3934/math.20231378
    [4] Liliana Guran, Khushdil Ahmad, Khurram Shabbir, Monica-Felicia Bota . Computational comparative analysis of fixed point approximations of generalized α-nonexpansive mappings in hyperbolic spaces. AIMS Mathematics, 2023, 8(2): 2489-2507. doi: 10.3934/math.2023129
    [5] Thabet Abdeljawad, Kifayat Ullah, Junaid Ahmad, Muhammad Arshad, Zhenhua Ma . On the convergence of an iterative process for enriched Suzuki nonexpansive mappings in Banach spaces. AIMS Mathematics, 2022, 7(11): 20247-20258. doi: 10.3934/math.20221108
    [6] Maryam Iqbal, Afshan Batool, Aftab Hussain, Hamed Al-Sulami . A faster iterative scheme for common fixed points of G-nonexpansive mappings via directed graphs: application in split feasibility problems. AIMS Mathematics, 2024, 9(5): 11941-11957. doi: 10.3934/math.2024583
    [7] Buthinah A. Bin Dehaish, Rawan K. Alharbi . On fixed point results for some generalized nonexpansive mappings. AIMS Mathematics, 2023, 8(3): 5763-5778. doi: 10.3934/math.2023290
    [8] Godwin Amechi Okeke, Akanimo Victor Udo, Rubayyi T. Alqahtani, Melike Kaplan, W. Eltayeb Ahmed . A novel iterative scheme for solving delay differential equations and third order boundary value problems via Green's functions. AIMS Mathematics, 2024, 9(3): 6468-6498. doi: 10.3934/math.2024315
    [9] Hasanen A. Hammad, Hassan Almusawa . Modified inertial Ishikawa iterations for fixed points of nonexpansive mappings with an application. AIMS Mathematics, 2022, 7(4): 6984-7000. doi: 10.3934/math.2022388
    [10] Dong Ji, Yao Yu, Chaobo Li . Fixed point and endpoint theorems of multivalued mappings in convex b-metric spaces with an application. AIMS Mathematics, 2024, 9(3): 7589-7609. doi: 10.3934/math.2024368
  • The goal of this manuscript is to introduce a new class of generalized nonexpansive operators, called (α,β,γ)-nonexpansive mappings. Furthermore, some related properties of these mappings are investigated in a general Banach space. Moreover, the proposed operators utilized in the K-iterative technique estimate the fixed point and examine its behavior. Also, two examples are provided to support our main results. The numerical results clearly show that the K-iterative approach converges more quickly when used with this new class of operators. Ultimately, we used the K-type iterative method to solve a variational inequality problem on a Hilbert space.



    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

    μ=Fμ,

    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

    FμFνcμν, (1.1)

    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={μ0W: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:WW 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:WW 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:WW is read as:

    Fμ=μ+1 μW.

    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,

    μ,(1μ),μ,(1μ),μ,(1μ),...,

    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.

    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 μ+v2(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 μ0L, then for all ν0L{μ0}, one has

    lim supλμλμ0<lim supλμλν0.

    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 WL. 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<aaλb<1 and limλaλμλ+(1aλ)νλ=τ for some τ0, then limλμλνλ=0.

    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:

    FμFναμν||+βμFμ+γμFν,

    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

    Fμ={0ifμ21ifμ=2.

    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

    FμFν=0αμν+βμFμ+γμFν.

    Case (2). If μ[0,2) and ν=2. Then

    FμFν=1=ν2=μνμ2μν2+μ02μν2+μ02+μ12=αμν+βμFμ+γμFν.

    Case (3). If ν[0,2) and μ=2. Then

    FμFν=132=μ12=2μ12(μ1)+(μ0)2μ12+μ02μν2+μ12+μ02=αμν+βμFμ+γμFν.

    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 μ0FF.

    Proof. Since μ0 is fixed point of F, we have Fμ0=μ0. Hence

    FμFμ0αμμ0+βμ0Fmu0+γμFμ0=αμμ0+βμ0Fμ0+γμμ0=αμμ0+βμ0μ0+γμμ0αμμ0+γμμ0=(α+γ)μμ0μμ0.

    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

    μFν(1+β)(1γ)μFμ+α(1γ)μν.

    Proof. For any μ,νE, we have

    μFνμFμ+FμFνμFμ+αμν+βμFμ+γμFν=(1+β)μFμ+αμν+γμFν.

    Accordingly, we obtained

    μFν(1+β)μFμ+αμν+γμFν.

    It follows that

    μFν(1+β)(1γ)μFμ+α(1γ)μν.

    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.

    μλW, Fμλμλ0 and μλμ0 μ0FF.

    Proof. From Lemma 3.3, we have

    μkFμ0(1+β)(1γ)μkFμλ+α(1γ)μλμ0.

    Since α+γ1, so α1γ. It follows that

    lim supλμλFμ0lim supλμλμ0.

    Since the underlying space has the Opial's property, one get Fμ0=μ0. This finishes the proof.

    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:

    μλ+1=aλFμλ+(1aλ)μλ,} (4.1)
    μλ+1=aλFνλ+(1aλ)μλ,vλ=bλFμλ+(1bλ)μλ,} (4.2)
    μλ+1=aλFνλ+(1aλ)μλ,νλ=bλFωλ+(1bλ)μλ,ωλ=cλFμλ+(1cλ)μλ,} (4.3)
    μλ+1=aλFνλ+(1aλ)μλ,vλ=bλFμλ+(1bλ)Fμλ,} (4.4)
    μλ+1=aλFωλ+(1aλ)Fνλ,νλ=bλFωλ+(1bλ)Fμλ,ωλ=cλFμλ+(1cλ)μλ,} (4.5)
    μλ+1=Fνλ,νλ=F(aλωλ+(1aλ)μλ),ωλ=bλFμλ+(1bλ)μλ.} (4.6)

    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 Kiterative method:

    μλ+1=Fνλ,νλ=F(aλFωλ+(1aλ)Fμλ),ωλ=bλFμλ+(1bλ)μλ.} (4.7)

    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:WW 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 μ0FF. According to the (4.7) and Lemma 3.1,

    ωλμ0=bλFμλ+(1bλ)μλμ0=bλ(Fμλμ0)+(1bλ)(μλμ0)bλFμλμ0+(1bλ)μλμ0bλμλμ0+(1bλ)μλμ0=uλμ0.

    Hence

    μλ+1μ0=Fνλμ0||νλμ0=F(aλFωλ+(1aλ)Fμλ)μ0aλFωλ+(1aλ)Fμλμ0=aλ(Fωλμ0)+(1aλ)(Fμλμ0)aλFωλμ0+(1aλ)Fμλμ0aλωλμ0+(1aλ)||μkμ0aλμλμ0+(1aλ)μλμ0=μλμ0.

    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:WW 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 μ0A(E,{μλ}). By Lemma 3.3, we have

    r(Fμ0,{μλ})=lim supkμλFμ0lim supλ((1+β)(1γ)μλFμλ+α(1γ)μλμ0)=lim supλμλμ0=r(μ0,{μλ}).

    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 μ0W. So that by Lemma 6, limλ||μλμ0|| exists as well as the sequence {μλ} is bounded. Thus we can set

    limλμλμ0=τ. (4.8)

    It is proved in the proof of Lemma 4.1 that ωλμ0μλμ0. Accordingly, one has

    lim supλ||ωλω0||lim supλ||μλμ0||=τ. (4.9)

    Now μ0 is the point of F, by Lemma 3.1, Fμλμ0μλμ0. It follows that

    lim supλFμλμ0lim supλμλμ0=τ. (4.10)

    The proof of Lemma 4.1 that μλ+1μ0aλωλμ0+(1aλ)μλμ0. It follows that

    μλ+1μ0μλμ0μλ+1μ0μλμ0aλωλμ0μλμ0.

    Hence

    τ=lim infλμλ+1μ0lim infλωkμ0. (4.11)

    From (4.9) and (4.11), we have

    τ=limλωλμ0. (4.12)

    From (4.12), we have

    τ=limλωkμ0=limλbλ(Fμλμ0)+(1bλ)(μλμ0).

    Hence,

    τ=limλbλ(Fμλμ0)+(1bλ)(μλμ0). (4.13)

    By Lemma 2.1, we have

    limλFμλμλ||=0.

    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:WW 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 μ0W. Theorem 4.1 suggests that limm||Fμλmμλm||=0. All the requirements for Lemma 3.4 are proved and hence μ0FF. 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 ν0FF. By keeping Lemma 4.1 and Opial's property of L, we have

    lim supλ||μλμ0||=lim supm||μλmμ0||<lim supm||μλmμ0||=lim supλ||μλν0||=lim supr||μλrν0||<lim supr||μλrμ0||=lim suplimλ||μλμ0||.

    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:WW 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 q0E, that is, limλmμλmμ0=0. Suppose μ=μλm and ν=μ0, then applying Lemma 3.3, one has

    ||μλmFμ0||(1+β)(1γ)μλmFμλm+α(1γ)μλmμ0. (4.14)

    By Theorem 4.1, limλk||μλkFμλk||=0 and also from the above limλm||μλmq0||=0. Accordingly, (4.14) provides that μλmFμ0. It follows that Fμ0=μ0. By Lemma 4.1, limk||μλμ0|| exists. Consequently, we have proved that μ0FF 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:WW 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 μ0W, 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μm12m. 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

    pm+1pmpm+1μλm+1+μλm+1pm12m+1+12m.

    It follows that limmpm+1pm=0. This proves the required. It follows from Lemma 3.2 that FF is closed hence {pm} converges to some μ0FF. 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:WW 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.

    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:

    Fμ={μ3onμ[0,12)μ4onμ[12,1].

    Case (1). If μ,ν[0,12). Then

    FμFν=μv3μν2μν2+2(μμ3)3μν2+2(μμ3)3+(μν3)2=αμν+βμFμ+γμFν.

    Case (2). If μ,ν[12,1]. Then

    FμFν=μν4μν2μv2+2(μμ4)3μv2+2(μμ4)3+(μν4)2=αμν+βμFμ+γμFν.

    Case (3). If μ[0,12) and ν[12,1]. Then

    FFν=μ3ν4ν4+μ33ν8+4μ9=(νν4)2+4μ9=((μν)(μν4))2+2(μμ3)3μν2+2(μμ3)3+(μν4)2=α||μν||+β||μFμ||+γ||μFν||.

    Case (4). If ν[0,12) and μ[12,1]. Then

    FμFν=μ4ν3ν3+μ42ν6+μ2=(νν3)2+6μ12=((μν)(μν3))2+2(μμ4)3μν2+2(μμ4)3+(μν3)2=α||μν||+β||μFμ||+γ||μFν||.

    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 uFF, we keep ||μλμ||<1015 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 14 and Figure 1 suggest the high accuracy of the K iterates to the fixed point of F.

    Table 1.  Numerical date of the different iterates for F of Example 3.
    Steps K Thakur Abbas Agarwal Noor Ishikawa Mann
    1 0.5000 0.5000 0.5000 0.5000 0.5000 0.5000 0.5000
    2 0.0108 0.0324 0.0458 0.0972 0.1990 0.2097 0.2375
    3 0.0002 0.0025 0.0052 0.0225 0.0799 0.0906 0.1266
    4 0.0000 0.0001 0.0005 0.0052 0.0321 0.0391 0.0675
    5 0.0000 0.0000 0.0000 0.0012 0.0129 0.0169 0.0360
    6 0.0000 0.0000 0.0000 0.0002 0.0051 0.0073 0.0192
    7 0.0000 0.0000 0.0000 0.0000 0.0020 0.0031 0.0102
    8 0.0000 0.0000 0.0000 0.0000 0.0008 0.0013 0.0054

     | Show Table
    DownLoad: CSV
    Table 2.  aλ=2λ5λ+4, bk=λ(3k+9) and cλ=4λ10λ+2.
    Number of steps required to get the value of the fixed point
    Initial value Abbas (4.5) Thakur (4.6) K(4.7)
    0.13 16 12 09
    0.31 16 13 09
    0.53 16 13 09
    0.74 16 13 09
    0.98 16 13 09

     | Show Table
    DownLoad: CSV
    Table 3.  aλ=λ6λ+1, bk=λ9λ+9 and cλ=12λ9λ+1.
    Number of steps required to get the value of the fixed point
    Intial value Abbas (4.5) Thakur (4.6) K (4.7)
    0.13 18 14 10
    0.31 19 15 10
    0.53 19 15 10
    0.74 19 15 10
    0.98 20 15 10

     | Show Table
    DownLoad: CSV
    Table 4.  aλ=λ712λ+27, bλ=1(1λ+4) and cλ=2λλ+5.
    Number of steps required to get the value of the fixed point
    Intial value Abbas (4.5) Thakur (4.6) K (4.7)
    0.13 22 13 08
    0.31 23 14 08
    0.53 23 14 08
    0.74 24 15 08
    0.98 24 15 08

     | Show Table
    DownLoad: CSV
    Figure 1.  Comparison between K and other iterations with the help of graphs by using F of Example 3, where μ1=0.5000.

    This section suggests an application of our main outcome. Suppose H denotes a Hilbert space, WH is convex as well closed. Then M:HH is known as a monotone mapping if and only if for all μ,ν in the domain, we have

    MμMν,μν0.

    Notice that, we shall denote by V(M,W) a variational inequality problem endowed with M and W and define as

    find μW : Mμ,μμ0 for each μH.

    Suppose that I:HH 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.

    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

    F,0 for all H,

    where F:WW 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.

    This study is supported via funding from Prince Sattam bin Abdulaziz University project number (PSAU/2023/R/1444).

    The authors declare that they have no conflict of interest.



    [1] S. Banach, Sur les operations dans les ensembles abstraits et leur application aux equations integrales, Fund. Math., 3 (1922), 133–181. https://cir.nii.ac.jp/crid/1570572700413342720
    [2] D. R. Sahu, D. O'Regan, R. P. Agarwal, Fixed point theory for Lipschitzian-type mappings with applications series, New York: Springer, 2009. https://doi.org/10.1007/978-0-387-75818-3
    [3] W. Takahashi, Nonlinear functional analysis, Yokohoma: Yokohoma Publishers, 2000.
    [4] H. A. Hammad, M. De la Sen, Tripled fixed point techniques for solving system of tripled-fractional differential equations, Aims Math., 6 (2021), 2330–2343. https://doi:10.3934/math.2021141 doi: 10.3934/math.2021141
    [5] H. A. Hammad, M. Zayed, Solving a system of differential equations with infinite delay by using tripled fixed point techniques on graphs, Symmetry, 14 (2022), 1388. https://doi.org/10.3390/sym14071388 doi: 10.3390/sym14071388
    [6] K. Goebel, S. Reich, Uniform convexity, hyperbolic geometry and nonexpansive mappings, New York: Marcel Dekkae, 1984.
    [7] F. E. Browder, Nonexpansive nonlinear operators in a Banach space, P. Natl. A. Sci., 54 (1965), 1041–1044. https://doi.org/10.1073/pnas.54.4.1041 doi: 10.1073/pnas.54.4.1041
    [8] D. Gohde, Zum prinzip der kontraktiven abbildung, Math. Nachr., 30 (1965), 251–258. https://doi.org/10.1002/mana.19650300312 doi: 10.1002/mana.19650300312
    [9] W. A. Kirk, A fixed point theorem for mappings which do not increase distance, Am. Math. Mon., 72 (1965), 1004–1006. https://doi.org/10.2307/2313345 doi: 10.2307/2313345
    [10] J. A. Clarkson, Uniformly convex spaces, Trans. Amer. Math. Soc., 40 (1936), 396–414. https://doi.org/10.2307/1989630 doi: 10.2307/1989630
    [11] Z. Opial, Weak convergence of the sequence of successive approximations for nonexpansive mappings, Bull. Amer. Math. Soc., 73 (1967), 591–597. https: file: ///C: /Users/Hp/Downloads/1183528964.pdf
    [12] H. F. Senter, W. G. Dotson, Approximating fixed points of non-expansive mappings, Proc. Amer. Math. Soc., 44 (1974), 375–380. https://doi.org/10.2307/2040440 doi: 10.2307/2040440
    [13] J. Schu, Weak and strong convergence to fixed points of asymptotically nonexpansive mappings, B. Aust. Math. Soc., 43 (1991), 153–159. https://doi:10.1017/S0004972700028884 doi: 10.1017/S0004972700028884
    [14] X. Zhang, L. Dai, Image enhancement based on rough set and fractional order differentiator, Fractal Fract., 6 (2022), 214. https://doi.org/10.3390/fractalfract6040214 doi: 10.3390/fractalfract6040214
    [15] J. X. Zhang, G. H. Yang, Fault-tolerant output-constrained control of unknown Euler-Lagrange systems with prescribed tracking accuracy, Automatica, 111 (2020), 108606. https://doi.org/10.1016/j.automatica.2019.108606 doi: 10.1016/j.automatica.2019.108606
    [16] W. R. Mann, Mean value methods in iteration, Proc. Amer. Math. Soc., 4 (1953), 506–510.
    [17] S. Ishikawa, Fixed points by a new iteration method, Proc. Amer. Math. Soc., 44 (1974), 147–150. https://doi.org/10.2307/2039245 doi: 10.2307/2039245
    [18] M. A. Noor, New approximation schemes for general variational inequalities, J. Math. Anal. Appl., 251 (2000), 217–229. https://doi.org/10.1006/jmaa.2000.7042 doi: 10.1006/jmaa.2000.7042
    [19] R. P. Agarwal, D. O'Regon, D. R. Sahu, Iterative construction of fixed points of nearly asymptotically nonexpansive mappings, J. Nonlinear Convex A., 8 (2007), 61–79.
    [20] M. Abbas, T. Nazir, A new faster iteration process applied to constrained minimization and feasibility problems, Mat. Vestn., 66 (2014), 223–234.
    [21] B. S. Thakur, D. Thakur, M. Postolache, New iteration scheme for approximating fixed point of nonexpansive mappings, Filomat, 30 (2016), 2711–2720. https://doi.org/10.2298/FIL1610711T doi: 10.2298/FIL1610711T
    [22] N. Hussain, K. Ullah, M. Arshad, Fixed point approximation of Suzuki generalized non-expansive mappings via new faster iteration process, J. Nonlinear Convex A., 19 (2018), 1383–1393. https://doi.org/10.48550/arXiv.1802.09888 doi: 10.48550/arXiv.1802.09888
    [23] C. Byrne, A unified treatment of some iterative algorithms in signal processing and image reconstruction, Inverse Probl., 20 (2004), 103–120. https://doi.org/10.1088/0266-5611/20/1/006 doi: 10.1088/0266-5611/20/1/006
    [24] F. Facchinei, J. S. Pang, Finite-dimensional variational inequalities and complementarity problems, New York: Springer, 2003.
    [25] I. Konnov, Combined relaxation methods for variational inequalities, Berlin: Springer-Verlag, 2001.
    [26] G. M. Korpelevich, The extragradient method for finding saddle points and other problems, Matecon, 12 (1976), 747–756.
    [27] C. Martinez-Yanes, H. K. Xu, Strong convergence of the CQ method for fixed point iteration processes, Nonlinear Anal. Theor., 64 (2006), 2400–2411. https://doi.org/10.1016/j.na.2005.08.018 doi: 10.1016/j.na.2005.08.018
    [28] H. A. Hammad, H. U. Rahman, M. De la Sen, Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications, Math. Probl. Eng., 2020 (2020), 7487383. https://doi.org/10.1155/2020/7487383 doi: 10.1155/2020/7487383
    [29] T. M. Tuyen, H. A. Hammad, Effect of shrinking projection and CQ-methods on two inertial forward–backward algorithms for solving variational inclusion problems, Rend. Circ. Mat. Palerm. Ser. Ⅱ, 70 (2021), 1669–1683. https://doi.org/10.1007/s12215-020-00581-8 doi: 10.1007/s12215-020-00581-8
    [30] H. A. Hammad, W. Cholamjiak, D. Yambangwai, H. Dutta, A modified shrinking projection methods for numerical reckoning fixed points of G-nonexpansive mappings in Hilbert spaces with graph, Miskolc Math. Notes, 20 (2019), 941–956. https://doi.org/10.18514/MMN.2019.2954 doi: 10.18514/MMN.2019.2954
    [31] H. H. Bauschke, P. L. Combettes, Convex analysis and monotone operator theory in Hilbert spaces, New York: Springer, 2011. https://doi.org/10.1007/978-1-4419-9467-7
    [32] H. H. Bauschke, J. M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev., 38 (1096), 367–426. https://doi.org/10.1137/S0036144593251710 doi: 10.1137/S0036144593251710
    [33] P. Chen, J. Huang, X. Zhang, A primal-dual fixed point algorithm for convex separable minimization with applications to image restoration, Inverse Probl., 29 (2013), 025011. https://doi.org/10.1088/0266-5611/29/2/025011 doi: 10.1088/0266-5611/29/2/025011
    [34] Y. Dang, J. Sun, H. Xu, Inertial accelerated algorithms for solving a split feasibility problem, J. Ind. Manag. Optim., 13 (2017), 1383-1394. https://doi.org/10.3934/jimo.2016078 doi: 10.3934/jimo.2016078
  • This article has been cited by:

    1. Khurram Shabbir, Khushdil Ahmad, Liliana Guran, 2024, Chapter 13, 978-981-99-9545-5, 301, 10.1007/978-981-99-9546-2_13
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1682) PDF downloads(101) Cited by(1)

Figures and Tables

Figures(1)  /  Tables(4)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog