Research article

Projection methods for quasi-nonexpansive multivalued mappings in Hilbert spaces

  • Received: 29 August 2022 Revised: 02 December 2022 Accepted: 28 December 2022 Published: 12 January 2023
  • MSC : 47H09, 47H10

  • This paper proposes a modified D-iteration to approximate the solutions of three quasi-nonexpansive multivalued mappings in a real Hilbert space. Due to the incorporation of an inertial step in the iteration, the sequence generated by the modified method converges faster to the common fixed point of the mappings. Furthermore, the generated sequence strongly converges to the required solution using a shrinking technique. Numerical results obtained indicate that the proposed iteration is computationally efficient and outperforms the standard forward-backward with inertial step.

    Citation: Anantachai Padcharoen, Kritsana Sokhuma, Jamilu Abubakar. Projection methods for quasi-nonexpansive multivalued mappings in Hilbert spaces[J]. AIMS Mathematics, 2023, 8(3): 7242-7257. doi: 10.3934/math.2023364

    Related Papers:

    [1] Sani Salisu, Vasile Berinde, Songpon Sriwongsa, Poom Kumam . Approximating fixed points of demicontractive mappings in metric spaces by geodesic averaged perturbation techniques. AIMS Mathematics, 2023, 8(12): 28582-28600. doi: 10.3934/math.20231463
    [2] 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
    [3] 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
    [4] Liliana Guran, Khushdil Ahmad, Khurram Shabbir, Monica-Felicia Bota . Computational comparative analysis of fixed point approximations of generalized $ \alpha $-nonexpansive mappings in hyperbolic spaces. AIMS Mathematics, 2023, 8(2): 2489-2507. doi: 10.3934/math.2023129
    [5] Damrongsak Yambangwai, Chonjaroen Chairatsiripong, Tanakit Thianwan . Iterative manner involving sunny nonexpansive retractions for nonlinear operators from the perspective of convex programming as applicable to differential problems, image restoration and signal recovery. AIMS Mathematics, 2023, 8(3): 7163-7195. doi: 10.3934/math.2023361
    [6] Lu-Chuan Ceng, Yeong-Cheng Liou, Tzu-Chien Yin . On Mann-type accelerated projection methods for pseudomonotone variational inequalities and common fixed points in Banach spaces. AIMS Mathematics, 2023, 8(9): 21138-21160. doi: 10.3934/math.20231077
    [7] Junaid Ahmad, Kifayat Ullah, Reny George . Numerical algorithms for solutions of nonlinear problems in some distance spaces. AIMS Mathematics, 2023, 8(4): 8460-8477. doi: 10.3934/math.2023426
    [8] Asima Razzaque, Imo Kalu Agwu, Naeem Saleem, Donatus Ikechi Igbokwe, Maggie Aphane . Novel fixed point results for a class of enriched nonspreading mappings in real Banach spaces. AIMS Mathematics, 2025, 10(2): 3884-3909. doi: 10.3934/math.2025181
    [9] Kifayat Ullah, Junaid Ahmad, Hasanen A. Hammad, Reny George . Iterative schemes for numerical reckoning of fixed points of new nonexpansive mappings with an application. AIMS Mathematics, 2023, 8(5): 10711-10727. doi: 10.3934/math.2023543
    [10] Francis Akutsah, Akindele Adebayo Mebawondu, Austine Efut Ofem, Reny George, Hossam A. Nabwey, Ojen Kumar Narain . Modified mildly inertial subgradient extragradient method for solving pseudomonotone equilibrium problems and nonexpansive fixed point problems. AIMS Mathematics, 2024, 9(7): 17276-17290. doi: 10.3934/math.2024839
  • This paper proposes a modified D-iteration to approximate the solutions of three quasi-nonexpansive multivalued mappings in a real Hilbert space. Due to the incorporation of an inertial step in the iteration, the sequence generated by the modified method converges faster to the common fixed point of the mappings. Furthermore, the generated sequence strongly converges to the required solution using a shrinking technique. Numerical results obtained indicate that the proposed iteration is computationally efficient and outperforms the standard forward-backward with inertial step.



    Let K be a nonempty closed and convex subset of real Hilbert space H. Define S:KK to be a continuous mapping. A point ˉuK is said to be a fixed point of S if S(ˉu)=ˉu. Also, the F(S) represents the set of all fixed points of S. Several authors have investigated the existence of fixed points for theorems of single-valued nonexpansive mappings (for example, [1,2,3,4,5]).

    Mann [6] proposed the following method in 1953 for approximating the fixed point of a nonexpansive mapping S in a Hilbert space H:

    un+1=anun+(1an)Sun,n1, (1.1)

    where {an} is a sequence in [0,1].

    Ishikawa [7] generalized Mann's iterative algorithm (1.1) in 1974 by introducing the iteration:

    {u0Kchosen arbitrary,vn=(1an)un+anSun,un+1=(1bn)un+bnSvn,n0, (1.2)

    where {an} and {bn} are sequences in [0,1].

    Noor [8] introduced and generalized Ishikawa's iterative algorithm (1.2) in 2000 by introducing the following iterative procedure for solving the fixed point problem of a single-valued nonlinear mapping:

    {u1Kchosen arbitrary,vn=(1an)un+anSun,ρn=(1bn)un+bnSvn,un+1=(1cn)un+cnSρn,n1, (1.3)

    where {an},{bn} and {cn} are sequences in [0,1].

    Yildirim and Özdemir [9] introduced a new iteration process in 2009 which is an n-step for finding the common fixed points. It is produced by the following processes:

    {u1Kchosen arbitrary,vn=P((1arn)un+arnSr(PSr)n1un),vn+1=P((1a(r1)n)vn+a(r1)nSr1(PSr1)n1vn),vn+r2=P((1a2n)vn+r3+a2nS2(PS2)n1vn+r3),un+1=P((1a1n)vn+r2+a1nS1(PS1)n1vn+r2),n1andr2, (1.4)

    where {ajn} be a sequence in [ϵ,1ϵ] for some ϵ(0,1), for each j{1,2,,r}.

    Sainuan [10] developed a new iteration called P-iteration in 2015. The P-iteration is defined as:

    {u1Kchosen arbitrary,vn=(1an)un+anSun,ρn=(1bn)vn+bnSvn,un+1=(1cn)Svn+cnSρn,n1, (1.5)

    where {an},{bn} and {cn} are sequences in [0,1].

    The D-iteration was introduced in 2018 by Daengsaen and Khemphet [11], who used the Sainuan's iteration concept. It is produced by the following processes:

    {u1Kchosen arbitrary,vn=(1an)un+anSun,ρn=(1bn)Sun+bnSvn,un+1=(1cn)Svn+cnSρn,n1, (1.6)

    where {an},{bn} and {cn} are sequences in [0,1].

    The heavy ball method, which was studied in [12,13] for maximal monotone operators by the proximal point algorithm, was used by Alvarez and Attouch [19]. This algorithm is known as the inertial proximal point algorithm, and it is written as follows:

    {u0,u1Kchosen arbitrary,tn=un+λn(unun1),un+1=(I+γnB)1tn,n1, (1.7)

    where I is the identity mapping. It was proved that if {γn} is non-decreasing and {λn}[0,1) with

    n=1λnunun12<, (1.8)

    then algorithm (1.7) converges weakly to a zero of B.

    Nakajo and Takahashi [18] proposed modifying Mann's iteration method (1.1) to obtain a strong convergence theorem in Hilbert spaces H:

    {u0K,chosen arbitrary,vn=(1an)un+anSun,Kn={xK:vnxunx},Rn={xK:u0un,unx},un+1=PKnRnu0,n0, (1.9)

    where {an}[0,a] for some a[0,1). They proved that the sequence {un} converges strongly to PF(S)u0.

    In 2021, Chaolamjiak et al. [14] proposed modifying SP iteration method (1.4) to obtain a strong convergence theorem in Hilbert spaces H:

    {u0,u1K,R1=K,tn=un+λn(unun1),vn(1an)tn+anS1tn,ρn(1bn)vn+bnS2vn,wn(1cn)ρn+cnS3ρn,Kn={xK:wnx2unx2+2λ2nunun122λnunx,un1un},Rn={xRn1:u1un,unx0},un+1=PKnRnu1, (1.10)

    for all n1, where {an},{bn} and {cn}(0,1). They proved that the sequence {un} converges strongly to a common fixed point of S1,S2 and S3.

    The results [11,18,19,21] provide incentive. In order to locate a common fixed point of three quasi-nonexpansive multivalued mappings, we introduce the D-iterative approach with the inertial technical term. We can prove strong convergence theorems by combining shrinking projection methods with inertial D-iteration. Finally, we compare our inertial projection method to the traditional projection method and conduct numerical tests to support our major findings with different choices of the initial values x0 and x1 in 4 case.

    Let CB(K) and K(K) denote the families of nonempty closed bounded, and compact, respectively.

    The Hausdorff metric on CB(K) is defined by:

    H(C,Q)=max{supuCd(u,Q),supvQd(v,C)},C,QCB(K),

    where d(u,Q)=infαQ{uα}.

    A single-valued mapping S:KK is said to be nonexpansive if

    SuSvuv,u,vK.

    A multivalued mapping S:KCB(K) if ˉuSˉu and

    H(Su,Sˉu)uˉu,uKandˉuF(S).

    Then S is said to be quasi-nonexpansive.

    Condition (A). Let H be a Hilbert space and K be a subset of H. A multivalued mapping S:KCB(K) is said to satisfy Condition (A) if uˉu=d(u,Sˉu) for all uH and ˉuF(S).

    We now give the example of quasi-nonexpansive multivalued mapping S which satisfies Condition (A) and the fixed point set F(S) contains more than one element.

    Example. In Euclidean space R, let K =[0,2] and S:KCB(K) be defined by

    Su={[0,u2],ifu1,{2},ifu>1.

    It is easy to see that F(S)={0,2}.

    Lemma 2.1. [14] Let H be a real Hilbert space. Let S:HCB(H) be a quasi-nonexpansive mapping with F(S). Then, F(S) is closed, and if S satisfies Condition (A), then F(S) is convex.

    A multivalued mapping S:KCB(K) is said to be hybrid if

    3H(Su,Sv)2uv2+d(v,Su)2+d(u,Sv)2,u,vK.

    Lemma 2.2. [15] Let K be a closed convex subset of a real Hilbert space H. Let S:KK(K) be a hybrid multivalued mapping. Let {un} be a sequence in K such that unˉu and limnunxn=0 for some xnSun. Then, ˉuSˉu.

    Lemma 2.3. [16] Let X be a Banach space satisfying Opial's condition and let {un} be a sequence in X. Let x,yX be such that limnunx and limnuny exist. If {unk} and {umk} are subsequences of {un} which converge weakly to x and y, respectively, then x=y.

    Lemma 2.4. [17] Let K be a nonempty closed convex subset of a real Hilbert space H. For each x,yH and vR, the set

    D={uK:yu2xu2+z,u+v},

    is closed and convex.

    Lemma 2.5. [18] Let K be a nonempty closed convex subset of a real Hilbert space H and PK:HK be the metric projection from H onto K. Then

    vPKu2+uPKu2uv2,

    for all uH and vK.

    Lemma 2.6. [19] Let {αn},{βn} and {γn} be the sequences in [0,) such that

    αn+1αn+βn(αnαn1)+γn,

    for all n1,n=1γn<, and there exists a real number β with 0βnβ<1 for all n1. Then, the followings hold

    (a) n1[αnαn1]+<, where [t]+=max{t,0};

    (b) there exists α[0,) such that limnαn=α.

    Lemma 2.7. [20] Let H be a real Hilbert space. Then, for each u,vH and t[0,1]

    (a) uv2u2+v22u,v;

    (b) tu(1t)v2=tu2+(1t)v2t(1t)uv2;

    (c) If {un} is a sequence in H such that unu, then

    lim supnunv2=lim supn(unu2+uv2).

    Theorem 3.1. Let K be a closed convex subset of a real Hilbert space H and S1,S2,S3:HCB(K) be quasi-nonexpansive multivalued mappings with Υ:=F(S1)F(S2)F(S3) and ISi is demiclosed at 0 for all i{1,2,3}. Let {un} be a sequence generated by

    {u0,u1Kchosen arbitrary,tn=un+λn(unun1),vn(1an)tn+anS1tn,ρn(1bn)S1tn+bnS2vn,un+1(1cn)S2vn+cnS3ρn, (3.1)

    for all n1, where {an},{bn} and {cn}(0,1). Assume that the following conditions hold

    (a) n=1λnunun1<;

    (b) 0<lim infnan<lim supnan<1;

    (c) 0<lim infnbn<lim supnbn<1;

    (d) 0<lim infncn<lim supncn<1.

    If S1,S2 and S3 satisfy Condition (A), then the sequence {un} converges weakly to a common fixed point of S1,S2 and S3.

    Proof. Let ˉuΥ. From S1,S2 and S3 satisfy Condition (A), for xnS1tn,ynS2vn,znS3ρn and using (3.1), we obtain

    tnˉu=un+λn(unun1)ˉuunˉu+λnunun1, (3.2)
    vnˉu|=(1an)tn+anxnˉu=(1an)(tnˉu)+an(xnˉu)(1an)tnˉu+anxnˉu=(1an)tnˉu+and(xn,S1ˉu)(1an)tnˉu+anH(S1tn,S1ˉu)(1an)tnˉu+antnˉu)=tnˉuantnˉu+antnˉu)=tnˉu, (3.3)
    ρnˉu=(1bn)xn+bnynˉu=(1bn)(xnˉu)+bn(ynˉu)(1bn)xnˉu+bnynˉu=(1bn)d(xn,S1ˉu)+bnd(yn,S2ˉu)(1bn)H(S1tn,S1ˉu)+bnH(S2vn,S2ˉu)(1bn)tnˉu+bnvnˉu(1bn)tnˉu+bntnˉu=tnˉubntnˉu+bntnˉu=tnˉu (3.4)

    and

    un+1ˉu=(1cn)yn+cnznˉu=(1cn)(ynˉu)+cn(znˉu)(1cn)ynˉu+cnznˉu=(1cn)d(yn,S2ˉu)+cnd(zn,S3ˉu)(1cn)H(S2vn,S2ˉu)+cnH(S3ρn,S3ˉu)(1cn)vnˉu+cnρnˉu(1cn)tnˉu+cntnˉu=tnˉucntnˉu+cntnˉu=tnˉuunˉu+λnunun1. (3.5)

    Using Lemma 2.6, (3.5) and the assumption (a), we have limnunˉu exists. Thus, {un} is bounded and also {ρn},{vn} and {tn}. From Lemma 2.7(b), we get

    vnˉu2=(1an)tn+anxnˉu2=(1an)(tnˉu)+an(xnˉu)2=(1an)tnˉu2+anxnˉu2an(1an)tnxn2=(1an)tnˉu2+and(xn,S1ˉu)2an(1an)tnxn2(1an)tnˉu2+anH(S1tn,S1ˉu)2an(1an)tnxn2(1an)tnˉu2+antnˉu2an(1an)tnxn2=tnˉu2an(1an)tnxn2, (3.6)
    ρnˉu2=(1bn)xn+bnynˉu2=(1bn)(xnˉu)+bn(ynˉu)2=(1bn)xnˉu2+bnynˉu2bn(1bn)xnyn2=(1bn)d(xn,S1ˉu)2+bnd(yn,S2ˉu)2bn(1bn)xnyn2(1bn)H(S1tn,S1ˉu)2+bnH(S2vn,S2ˉu)2bn(1bn)xnyn2(1bn)tnˉu2+bnvnˉu2bn(1bn)xnyn2(1bn)tnˉu2+bntnˉu2an(1an)bntnxn2bn(1bn)xnyn2=tnˉu2an(1an)bntnxn2bn(1bn)xnyn2 (3.7)

    and

    un+1ˉu2=(1cn)yn+cnznˉu2=(1cn)(ynˉu)+cn(znˉu)2=(1cn)ynˉu2+cnznˉu2cn(1cn)ynzn2=(1cn)d(yn,S2ˉu)2+cnd(zn,S3ˉu)2cn(1cn)ynzn2(1cn)H(S2vn,S2ˉu)2+cnH(S3ρn,S3ˉu)2cn(1cn)ynzn2(1cn)vnˉu2+cnρnˉu2cn(1cn)ynzn2. (3.8)

    Combination (3.6)–(3.8), we get

    un+1ˉu2(1cn)tnˉu2an(1an)(1cn)tnxn2cn(1cn)ynzn2+cntnˉu2an(1an)bncntnxn2bn(1bn)cnxnyn2tnˉu2an(1an)bn(1cn)tnxn2cn(1cn)ynzn2an(1an)bncntnxn2bn(1bn)cnxnyn2unˉu2+2λnunun1,tnˉuan(1an)bn(1cn)tnxn2cn(1cn)ynzn2an(1an)bncntnxn2bn(1bn)cnxnyn2unˉu2+2λnunun1,tnˉuan(1an)bntnxn2cn(1cn)ynzn2bn(1bn)cnxnyn2. (3.9)

    The inequality (3.9) implies that

    an(1an)bntnxn2+cn(1cn)ynzn2+bn(1bn)cnxnyn2unˉu2un+1ˉu2+2λnunun1,tnˉu. (3.10)

    Using conditions (a)(d), limnunˉu exists and (3.10), we obtain

    limntnxn=limnxnyn=limnynzn=0. (3.11)

    This implies that

    limntnun=λnlimnunun1=0. (3.12)
    limnvntn=anlimntnxn=0. (3.13)
    limnρnxn=bnlimnxnyn=0. (3.14)

    Because {un} is bounded, there exists a subsequence {unk} of {un} such that unkˉu some ˉuK. From (3.12), we have tnkˉu. Because IS1 is demiclosed at 0 and (3.11), we obtain ˉuS1ˉu. From (3.13), we have vnkˉu. Because IS2 is demiclosed at 0 and (3.11), we obtain ˉuS2ˉu. It follows from (3.14) that ρnkˉu. Again, because IS3 is demiclosed at 0 and (3.11), we have ˉuS3ˉu. This implies that ˉuΥ. Now, we show that {un} converges weakly to ˉu. We take another subsequence {umk} of {un} converging weakly to some uΥ. Because limnunˉu exists and Lemma 2.3.Thus, we have ˉu=u.

    Theorem 3.2. Let K be a nonempty closed convex subset of a real Hilbert space H and S1,S2,S3:KCB(K) be quasi-nonexpansive multivalued mappings with Υ:=F(S1)F(S2)F(S3) and ISi is demiclosed at 0 for all i{1,2,3}. Let {un} be a sequence generated by

    {u0,u1K,K1=K,tn=un+λn(unun1),vn(1an)tn+anS1tn,ρn(1bn)S1tn+bnS2vn,wn(1cn)S2vn+cnS3ρn,Kn+1={xKn:wnx2unx2+2λ2nunun122λnunx,un1un},un+1=PKn+1u1, (3.15)

    for all n1, where {an},{bn} and {cn}(0,1). Assume that the following conditions hold

    (a) n=1λnunun1<;

    (b) 0<lim infnan<lim supnan<1;

    (c) 0<lim infnbn<lim supnbn<1;

    (d) 0<lim infncn<lim supncn<1.

    If S1,S2 and S3 satisfy Condition (A), then the sequence {un} converges strongly to a common fixed point of S1,S2 and S3.

    Proof. Step Ⅰ. Show that {un} is well defined. Using S1,S2 and S3 satisfy Condition (A), Lemma 2.1, Υ is closed and convex. Firstly, we show that Kn is closed and convex for all n1. Since induction on n that Kn is closed and convex. For n=1,K1=K is closed and convex. Suppose that Kn is closed and convex for some n1. Using the definition Kn+1 and Lemma 2.4, we have that Kn+1 is closed and convex. Thus, Kn is closed and convex for all n1. Next, we show that ΥKn for each n1. From Lemma 2.6(b) and S1,S2 and S3 satisfy Condition (A), let ˉuΥ for xnS1tn,ynS2vn,znS3ρn and using (3.15), we obtain

    vnˉu2=(1an)tn+anxnˉu2=(1an)(tnˉu)+an(xnˉu)2=(1an)tnˉu2+anxnˉu2an(1an)tnxn2(1an)tnˉu2+anxnˉu2=(1an)tnˉu2+and(xn,S1ˉu)2(1an)tnˉu2+anH(S1tn,S1ˉu)2(1an)tnˉu2+antnˉu2=tnˉu2, (3.16)
    ρnˉu2=(1bn)xn+bnynˉu2=(1bn)(xnˉu)+bn(ynˉu)2=(1bn)xnˉu2+bnynˉu2bn(1bn)xnyn2(1bn)xnˉu2+bnynˉu2=(1bn)d(xn,S1ˉu)2+bnd(yn,S2ˉu)2(1bn)H(S1tn,S1ˉu)2+bnH(S2vn,S2ˉu)2(1bn)tnˉu2+bnvnˉu2(1bn)tnˉu2+bntnˉu2=tnˉu2 (3.17)

    and

    wnˉu2=(1cn)yn+cnznˉu2=(1cn)(ynˉu)+cn(znˉu)2=(1cn)ynˉu2+cnznˉu2cn(1cn)ynzn2(1cn)ynˉu2+cnznˉu2=(1cn)d(yn,S2ˉu)2+cnd(zn,S3ˉu)2(1cn)H(S2vn,S2ˉu)2+cnH(S3ρn,S3ˉu)2(1cn)vnˉu2+cnρnˉu2(1cn)tnˉu2+cntnˉu2=tnˉu2=un+λn(unun1)ˉu2unˉu2+2λ2nunun122λnunˉu,unun1. (3.18)

    Therefore, from (3.18), ˉuKn,n1. This implies that ΥKn for each n1, and hence, Kn. Thus, {un} is well defined.

    Step Ⅱ. Show that unuK as n. Since unPKnu1,Kn+1Kn, and un+1Kn, we obtain

    unu1un+1u1,n1. (3.19)

    Since ΥKn, we obtain

    unu1xu1,n1, (3.20)

    for all xΥ. The inequalities (3.19) and (3.20) imply that the sequence {unu1} is bounded and non-decreasing. Therefore, limnunu1 exists.

    For m>n, from the definition of Kn, we obtain umPKmu1KmKn. Using Lemma 2.5, we have

    umun2umu12unu12. (3.21)

    From limnunu1 exists and follows (3.21), we have that limnunum=0. Therefore, {un} is a Cauchy sequence in K, and so unuK as n.

    Step Ⅲ. Show that limntnxn=limnxnyn=limnynzn=0, where xnS1tn,ynS2vn and znS3ρn. From Step Ⅱ, we obtain limnun+1un=0. Because un+1Kn, we have that

    wnunwnun+1+un+1ununun+12+2λ2nunun122λnunun+1,un1un+un+1un. (3.22)

    Using the assumption (a) and (3.22), we have

    limnwnun=0. (3.23)

    Because S1 satisfies condition (A) and using Lemma 2.7, we obtain

    wnˉu2(1cn)vnˉu2+cnρnˉu2cn(1cn)ynzn2. (3.24)

    Using (3.6), (3.7) and (3.24), we have

    wnˉu2(1cn)tnˉu2an(1an)(1cn)tnxn2+cntnˉu2an(1an)bncntnxn2bn(1bn)cnxnyn2cn(1cn)ynzn2(1cn)tnˉu2an(1an)bn(1cn)tnxn2+cntnˉu2an(1an)bncntnxn2bn(1bn)cnxnyn2cn(1cn)ynzn2=tnˉu2an(1an)bntnxn2bn(1bn)cnxnyn2cn(1cn)ynzn2unˉu2+2λnunun1,tnˉuan(1an)bntnxn2bn(1bn)cnxnyn2cn(1cn)ynzn2. (3.25)

    The inequality (3.25) implies that

    an(1an)bntnxn2+bn(1bn)cnxnyn2+cn(1cn)ynzn2unˉu2wnˉu2+2λnunun1,tnˉu. (3.26)

    From conditions (a)(d), (3.23) and (3.25), we have (3.11). From (3.13), (3.14) and the same proof in Theorem 3.1, we have

    limntnun=limnvntn=limnρnxn=0. (3.27)

    From Step Ⅱ, we know that unuK. It follows (3.27), we obtain that tnu. Because IS1 is demiclosed at 0, we have uF(S1). In the same way, we have that uF(S2) and uF(S3). This implies that uΥ.

    Step Ⅳ. Show that u=PΥu1. From uΥ and (3.19), we obtain

    uu1xu1,xΥ.

    Using the definition of the projection operator, we can conclude that u=PΥu1.

    Theorem 3.3. Let K be a nonempty closed convex subset of a real Hilbert space H and S1,S2,S3:KCB(K) be quasi-nonexpansive multivalued mappings with Υ:=F(S1)F(S2)F(S3) and ISi is demiclosed at 0 for all i{1,2,3}. Let {un} be a sequence generated by

    {u0,u1K,R1=K,tn=un+λn(unun1),vn(1an)tn+anS1tn,ρn(1bn)S1tn+bnS2vn,wn(1cn)S2vn+cnS3ρn,Kn={xK:wnx2unx2+2λ2nunun122λnunx,un1un},Rn={xRn1:u1un,unx0},un+1=PKnRnu1, (3.28)

    for all n1, where {an},{bn} and {cn}(0,1). Assume that the following conditions hold

    (a) n=1λnunun1<;

    (b) 0<lim infnan<lim supnan<1;

    (c) 0<lim infnbn<lim supnbn<1;

    (d) 0<lim infncn<lim supncn<1.

    If S1,S2 and S3 satisfy Condition (A), then the sequence {un} converges strongly to a common fixed point of S1,S2 and S3.

    Proof. From the same method of Theorem 3.2 step by step, we can conclude the proof by replacing Kn+1 by Kn, expect in Step 1. Showing that ΥKn for each n1. Next, we show that ΥRn for all n1. Indeed, by mathematical induction, for n=1, we obtain ΥK=R1. Suppose that ΥRn for all n1. Because un+1 is the projection of u1 onto KnRn, we obtain

    u1un+1,un+1x0,xKnRn.

    Therefore, ΥKn+1. Hence, ΥKnRn. This implies that {un} is well defined.

    Next, we show that unqK as n. Using the definition of Rn, we obtain un=PRnu1. Because un+1Rn, we have the inequality (3.19) and

    unu1qu1,qΥ. (3.29)

    From (3.19) and (3.29) we have the sequence {unu1} is bounded and non-decreasing, and so limnunu1 exists. For m>n, by definition of Rn, we have um=PRmu1RmRn. Using Lemma 2.5, we have (3.21). Because limnunu1 exists, it follows (3.21), we obtain limnumun=0. Therefore, {un} is a Cauchy sequence in K, and hence unqK as n. In fact, we have limnun+1un=0. Using the same proof of Steps 3 and 4 in Theorem 3.2, we obtain q=PΥu1.

    It is commonly known that computing the projection of a point on an intersection is quite difficult. However, this can also be stated as the following optimization problem for computing purposes

    PK:=minxKxu2, (4.1)

    where K=KnRn. See [22] for a list of several more approaches to handle projection onto intersection of sets computationally.

    The set Kn+1 can be found by KnRn, where

    Rn={xH:wnx2unx2+2λ2nunun122λnunx,un1un}. (4.2)

    The projection can be thought of as the following optimization problem by point (4.2):

    PKn+1:=minxKn+1xu2, (4.3)

    where Kn+1=KnRn.

    Example. Let H=R3 and K=[2,5]3.

    Let K1={u=(u1,u2,u3)R3:(u15)2+(u25)2+(u35)22}. We defined S1,S2,S3:R3CB(R3) as:

    S1u={{(5,5,5)}ifuK1,{v=(v1,v2,v3)K:(v15)2+(v25)2+(v35)21u1}otherwise,S2u={{(5,5,5)}ifuK1,{v=(5,v2,5)K:v2[(u2+5)(arctan(19u265)2)+u2,5]}otherwise,andS3u={{(5,5,5)}ifuK1,{v=(5,5,v3)K:v3[(u25)(sin(19u210)5)+u2,5]}otherwise.

    We see that S1,S2 and S3 are quasi-nonexpansive and F(S1)F(S2)F(S3)={(5,5,5)}. Let an=n+45n+5,bn=n+27n+2,cn=7n+79n+9 and

    λn={min{1(n+1)2unun1,0.035}ifunun1,0.035otherwise.

    We compare a numerical test between our inertial method defined in Theorem 3.3 and method (1.10). The stopping criterion is defined by un+1un<1010. We make different choices of the initial values x0 and x1 as follows (see Figure 1 and Table 1)

    Figure 1.  Valued of un+1un in Cases 1–4.
    Table 1.  Numerical results.
    Case our inertial method method (1.10)
    1 CPU time (sec) 0.01 0.03
    Number of Iterations 2 12
    2 CPU time (sec) 0.04 0.12
    Number of Iterations 2 11
    3 CPU time (sec) 0.03 0.09
    Number of Iterations 2 11
    4 CPU time (sec) 0.01 0.08
    Number of Iterations 2 11

     | Show Table
    DownLoad: CSV

    Case 1: x0=(2.6816,2.4389,2.8891) and x1=(2.7733,2.2146,2.2555).

    Case 2: x0=(3.9587,4.6121,2.9779) and x1=(3.7123,3.4894,4.8867).

    Case 3: x0=(4.9401,3.9274,2.8475) and x1=(3.8675,3.7185,4.7133).

    Case 4: x0=(3.9933,4.9899,4.2187) and x1=(3.7722,3.6190,2.9152).

    In this paper, we proved convergence theorems in Hilbert spaces using a modified D-iteration.We proved the weak and strong convergence of the iterative algorithms to the common fixed point under some suitable assumptions.

    Firstly, Anantachai Padcharoen (anantachai.p@rbru.ac.th) would like to thank the Research and Development Institute of Rambhai Barni Rajabhat University. Finally, Kritsana Sokhuma would like to thank Phranakhon Rajabhat University.

    The authors declare that they have no competing interests.



    [1] F. E. Browder, Nonexpansive nonlinear operators in a Banach space, Proc. Nat. Acad. Sci. USA., 54 (1965), 1041–1044. https://doi.org/10.1073/pnas.54.4.1041 doi: 10.1073/pnas.54.4.1041
    [2] D. Göhde, Zum prinzip der kontraktiven abbildung, Math. Nachr., 30 (1965), 251–258. https://doi.org/10.1002/mana.19650300312 doi: 10.1002/mana.19650300312
    [3] S. Reich, Approximate selections, best approximations, fixed points, and invariant sets, J. Math. Anal. Appl., 62 (1978), 104–113. https://doi.org/10.1016/0022-247X(78)90222-6 doi: 10.1016/0022-247X(78)90222-6
    [4] K. Goebel, W. A. Kirk, Topics in metric fixed point theory, Cambridge Studies in Advanced Mathematics, 28, Cambridge: Cambridge University Press, 1990.
    [5] W. A. Kirk, A fixed point theorem for mappings which do not increase distances, Am. Math. Mon., 72 (1965), 1004–1006. https://doi.org/10.2307/2313345 doi: 10.2307/2313345
    [6] W. R. Mann, Mean value methods in iteration, Proc. Am. Math. Soc., 4 (1953), 506–510. https://doi.org/10.2307/2032162 doi: 10.2307/2032162
    [7] S. Ishikawa, Fixed points by a new iteration method, Proc. Am. Math. Soc., 44 (1974), 147–150. https://doi.org/10.2307/2039245 doi: 10.2307/2039245
    [8] 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
    [9] I. Yildirim, M. Özdemir, A new iterative process for common fixed points of finite families of non-self-asymptotically non-expansive mappings, Nonlinear Anal.-Theor., 71 (2009), 991–999. https://doi.org/10.1016/j.na.2008.11.017 doi: 10.1016/j.na.2008.11.017
    [10] P. Sainuan, Rate of convergence of P-iteration and S-iteration for continuous functions on closed intervals, Thai J. Math., 13 (2015), 449–457.
    [11] J. Daengsaen, A. Khemphet, On the rate of convergence of P-iteration, SP-iteration, and D-iteration methods for continuous nondecreasing functions on closed intervals, Abstr. Appl. Anal., 2018 (2018), 7345401. https://doi.org/10.1155/2018/7345401 doi: 10.1155/2018/7345401
    [12] B. T. Polyak, Introduction to optimization, New York: Optimization Software, 1987.
    [13] B. T. Polyak, Some methods of speeding up the convergence of iterative methods, Zh. Vychisl. Mat. Mat. Fiz. 4 (1964), 1–17. https://doi.org/10.1016/0041-5553(64)90137-5 doi: 10.1016/0041-5553(64)90137-5
    [14] W. Chaolamjiak, D. Yambangwai, H. A. Hammad, Modified hybrid projection methods with SP iterations for quasi-nonexpansive multivalued mappings in Hilbert spaces, B. Iran. Math. Soc., 47 (2021), 1399–1422. https://doi.org/10.1007/s41980-020-00448-9 doi: 10.1007/s41980-020-00448-9
    [15] P. Cholamjiak, W. Cholamjiak, Fixed point theorems for hybrid multivalued mappings in Hilbert spaces, J. Fixed Point Theory Appl., 18 (2016), 673–688. https://doi.org/10.1007/s11784-016-0302-3 doi: 10.1007/s11784-016-0302-3
    [16] S. Suantai, Weak and strong convergence criteria of Noor iterations for asymptotically nonexpansive mappings, J. Math. Anal. Appl., 311 (2005), 506–517.
    [17] C. Martinez-Yanes, H. K. Xu, Strong convergence of the CQ method for fixed point iteration processes, Nonlinear Anal., 64 (2006), 2400–2411. https://doi.org/10.1016/j.na.2005.08.018 doi: 10.1016/j.na.2005.08.018
    [18] K. Nakajo, W. Takahashi, Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups, J. Math. Anal. Appl., 279 (2003), 372–379. https://doi.org/10.1016/S0022-247X(02)00458-4 doi: 10.1016/S0022-247X(02)00458-4
    [19] F. Alvarez, H. Attouch, An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping, Set-Valued Anal., 9 (2001), 3–11. https://doi.org/10.1023/A:1011253113155 doi: 10.1023/A:1011253113155
    [20] K. Goebel, S. Reich, Uniform convexity, hyperbolic geometry, and nonexpansive mappings, Monographs and Textbooks in Pure and Applied Mathematics, 83, New York: Marcel Dekker Inc, 1984. https://doi.org/10.1112/blms/17.3.293
    [21] W. Takahashi, Fixed point theorems for new nonlinear mappings in a Hilbert space, J. Nonlinear Convex Anal., 11 (2010), 79–88.
    [22] M. Stošsić, J. Xavier, M. Dodig, Projection on the intersection of convex sets, Linear Algebra Appl., 9 (2016), 191–205. https://doi.org/10.1016/j.laa.2016.07.023 doi: 10.1016/j.laa.2016.07.023
  • This article has been cited by:

    1. Vasile Berinde, Khairul Saleh, New averaged type algorithms for solving split common fixed point problems for demicontractive mappings, 2024, 2193-5343, 10.1007/s40065-024-00476-x
    2. Vasile Berinde, An inertial self-adaptive algorithm for solving split feasibility problems and fixed point problems in the class of demicontractive mappings, 2024, 2024, 1029-242X, 10.1186/s13660-024-03155-9
    3. Sani Salisu, Ma’aruf Shehu Minjibir, Iterative algorithms for common fixed points of a countable family of quasi-nonexpansive multivalued mappings in CAT(0) spaces, 2024, 2008-1359, 10.1007/s40096-024-00524-9
  • 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(1652) PDF downloads(76) Cited by(3)

Figures and Tables

Figures(1)  /  Tables(1)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog