
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
[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:K→K to be a continuous mapping. A point ˉu∈K 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+(1−an)Sun,∀n≥1, | (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:
{u0∈Kchosen arbitrary,vn=(1−an)un+anSun,un+1=(1−bn)un+bnSvn,n≥0, | (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:
{u1∈Kchosen arbitrary,vn=(1−an)un+anSun,ρn=(1−bn)un+bnSvn,un+1=(1−cn)un+cnSρn,n≥1, | (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:
{u1∈Kchosen arbitrary,vn=P((1−arn)un+arnSr(PSr)n−1un),vn+1=P((1−a(r−1)n)vn+a(r−1)nSr−1(PSr−1)n−1vn),⋮vn+r−2=P((1−a2n)vn+r−3+a2nS2(PS2)n−1vn+r−3),un+1=P((1−a1n)vn+r−2+a1nS1(PS1)n−1vn+r−2),n≥1andr≥2, | (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:
{u1∈Kchosen arbitrary,vn=(1−an)un+anSun,ρn=(1−bn)vn+bnSvn,un+1=(1−cn)Svn+cnSρn,n≥1, | (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:
{u1∈Kchosen arbitrary,vn=(1−an)un+anSun,ρn=(1−bn)Sun+bnSvn,un+1=(1−cn)Svn+cnSρn,n≥1, | (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,u1∈Kchosen arbitrary,tn=un+λn(un−un−1),un+1=(I+γnB)−1tn,n≥1, | (1.7) |
where I is the identity mapping. It was proved that if {γn} is non-decreasing and {λn}⊂[0,1) with
∞∑n=1λn‖un−un−1‖2<∞, | (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:
{u0∈K,chosen arbitrary,vn=(1−an)un+anSun,Kn={x∈K:‖vn−x‖≤‖un−x‖},Rn={x∈K:⟨u0−un,un−x⟩},un+1=PKn∩Rnu0,∀n≥0, | (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,u1∈K,R1=K,tn=un+λn(un−un−1),vn∈(1−an)tn+anS1tn,ρn∈(1−bn)vn+bnS2vn,wn∈(1−cn)ρn+cnS3ρn,Kn={x∈K:‖wn−x‖2≤‖un−x‖2+2λ2n‖un−un−1‖2−2λn⟨un−x,un−1−un⟩},Rn={x∈Rn−1:⟨u1−un,un−x⟩≥0},un+1=PKn∩Rnu1, | (1.10) |
for all n≥1, 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{supu∈Cd(u,Q),supv∈Qd(v,C)},∀C,Q∈CB(K), |
where d(u,Q)=infα∈Q{‖u−α‖}.
A single-valued mapping S:K→K is said to be nonexpansive if
‖Su−Sv‖≤‖u−v‖,∀u,v∈K. |
A multivalued mapping S:K→CB(K) if ˉu∈Sˉu and
H(Su,Sˉu)≤‖u−ˉu‖,∀u∈Kandˉu∈F(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:K→CB(K) is said to satisfy Condition (A) if ‖u−ˉu‖=d(u,Sˉu) for all u∈H and ˉu∈F(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:K→CB(K) be defined by
Su={[0,u2],ifu≤1,{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:H→CB(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:K→CB(K) is said to be hybrid if
3H(Su,Sv)2≤‖u−v‖2+d(v,Su)2+d(u,Sv)2,∀u,v∈K. |
Lemma 2.2. [15] Let K be a closed convex subset of a real Hilbert space H. Let S:K→K(K) be a hybrid multivalued mapping. Let {un} be a sequence in K such that un→ˉu and limn→∞‖un−xn‖=0 for some xn∈Sun. Then, ˉu∈Sˉ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,y∈X be such that limn→∞‖un−x‖ and limn→∞‖un−y‖ 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,y∈H and v∈R, the set
D={u∈K:‖y−u‖2≤‖x−u‖2+⟨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:H→K be the metric projection from H onto K. Then
‖v−PKu‖2+‖u−PKu‖2≤‖u−v‖2, |
for all u∈H and v∈K.
Lemma 2.6. [19] Let {αn},{βn} and {γn} be the sequences in [0,∞) such that
αn+1≤αn+βn(αn−αn−1)+γn, |
for all n≥1,∑∞n=1γn<∞, and there exists a real number β with 0≤βn≤β<1 for all n≥1. Then, the followings hold
(a) ∑n≥1[αn−αn−1]+<∞, 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,v∈H and t∈[0,1]
(a) ‖u−v‖2≤‖u‖2+‖v‖2−2⟨u,v⟩;
(b) ‖tu−(1−t)v‖2=t‖u‖2+(1−t)‖v‖2−t(1−t)‖u−v‖2;
(c) If {un} is a sequence in H such that un⇀u, then
lim supn→∞‖un−v‖2=lim supn→∞(‖un−u‖2+‖u−v‖2). |
Theorem 3.1. Let K be a closed convex subset of a real Hilbert space H and S1,S2,S3:H→CB(K) be quasi-nonexpansive multivalued mappings with Υ:=F(S1)∩F(S2)∩F(S3)≠∅ and I−Si is demiclosed at 0 for all i∈{1,2,3}. Let {un} be a sequence generated by
{u0,u1∈Kchosen arbitrary,tn=un+λn(un−un−1),vn∈(1−an)tn+anS1tn,ρn∈(1−bn)S1tn+bnS2vn,un+1∈(1−cn)S2vn+cnS3ρn, | (3.1) |
for all n≥1, where {an},{bn} and {cn}⊂(0,1). Assume that the following conditions hold
(a) ∑∞n=1λn‖un−un−1‖<∞;
(b) 0<lim infn→∞an<lim supn→∞an<1;
(c) 0<lim infn→∞bn<lim supn→∞bn<1;
(d) 0<lim infn→∞cn<lim supn→∞cn<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 xn∈S1tn,yn∈S2vn,zn∈S3ρn and using (3.1), we obtain
‖tn−ˉu‖=‖un+λn(un−un−1)−ˉu‖≤‖un−ˉu‖+λn‖un−un−1‖, | (3.2) |
‖vn−ˉu‖|=‖(1−an)tn+anxn−ˉu‖=‖(1−an)(tn−ˉu)+an(xn−ˉu)‖≤(1−an)‖tn−ˉu‖+an‖xn−ˉu‖=(1−an)‖tn−ˉu‖+and(xn,S1ˉu)‖≤(1−an)‖tn−ˉu‖+anH(S1tn,S1ˉu)≤(1−an)‖tn−ˉu‖+an‖tn−ˉu)‖=‖tn−ˉu‖−an‖tn−ˉu‖+an‖tn−ˉu)‖=‖tn−ˉu‖, | (3.3) |
‖ρn−ˉu‖=‖(1−bn)xn+bnyn−ˉu‖=‖(1−bn)(xn−ˉu)+bn(yn−ˉu)‖≤(1−bn)‖xn−ˉu‖+bn‖yn−ˉu‖=(1−bn)d(xn,S1ˉu)+bnd(yn,S2ˉu)≤(1−bn)H(S1tn,S1ˉu)+bnH(S2vn,S2ˉu)≤(1−bn)‖tn−ˉu‖+bn‖vn−ˉu‖≤(1−bn)‖tn−ˉu‖+bn‖tn−ˉu‖=‖tn−ˉu‖−bn‖tn−ˉu‖+bn‖tn−ˉu‖=‖tn−ˉu‖ | (3.4) |
and
‖un+1−ˉu‖=‖(1−cn)yn+cnzn−ˉu‖=‖(1−cn)(yn−ˉu)+cn(zn−ˉu)‖≤(1−cn)‖yn−ˉu‖+cn‖zn−ˉu‖=(1−cn)d(yn,S2ˉu)+cnd(zn,S3ˉu)≤(1−cn)H(S2vn,S2ˉu)+cnH(S3ρn,S3ˉu)≤(1−cn)‖vn−ˉu‖+cn‖ρn−ˉu‖≤(1−cn)‖tn−ˉu‖+cn‖tn−ˉu‖=‖tn−ˉu‖−cn‖tn−ˉu‖+cn‖tn−ˉu‖=‖tn−ˉu‖≤‖un−ˉu‖+λn‖un−un−1‖. | (3.5) |
Using Lemma 2.6, (3.5) and the assumption (a), we have limn→∞‖un−ˉu‖ exists. Thus, {un} is bounded and also {ρn},{vn} and {tn}. From Lemma 2.7(b), we get
‖vn−ˉu‖2=‖(1−an)tn+anxn−ˉu‖2=‖(1−an)(tn−ˉu)+an(xn−ˉu)‖2=(1−an)‖tn−ˉu‖2+an‖xn−ˉu‖2−an(1−an)‖tn−xn‖2=(1−an)‖tn−ˉu‖2+and(xn,S1ˉu)2−an(1−an)‖tn−xn‖2≤(1−an)‖tn−ˉu‖2+anH(S1tn,S1ˉu)2−an(1−an)‖tn−xn‖2≤(1−an)‖tn−ˉu‖2+an‖tn−ˉu‖2−an(1−an)‖tn−xn‖2=‖tn−ˉu‖2−an(1−an)‖tn−xn‖2, | (3.6) |
‖ρn−ˉu‖2=‖(1−bn)xn+bnyn−ˉu‖2=‖(1−bn)(xn−ˉu)+bn(yn−ˉu)‖2=(1−bn)‖xn−ˉu‖2+bn‖yn−ˉu‖2−bn(1−bn)‖xn−yn‖2=(1−bn)d(xn,S1ˉu)2+bnd(yn,S2ˉu)2−bn(1−bn)‖xn−yn‖2≤(1−bn)H(S1tn,S1ˉu)2+bnH(S2vn,S2ˉu)2−bn(1−bn)‖xn−yn‖2≤(1−bn)‖tn−ˉu‖2+bn‖vn−ˉu‖2−bn(1−bn)‖xn−yn‖2≤(1−bn)‖tn−ˉu‖2+bn‖tn−ˉu‖2−an(1−an)bn‖tn−xn‖2−bn(1−bn)‖xn−yn‖2=‖tn−ˉu‖2−an(1−an)bn‖tn−xn‖2−bn(1−bn)‖xn−yn‖2 | (3.7) |
and
‖un+1−ˉu‖2=‖(1−cn)yn+cnzn−ˉu‖2=‖(1−cn)(yn−ˉu)+cn(zn−ˉu)‖2=(1−cn)‖yn−ˉu‖2+cn‖zn−ˉu‖2−cn(1−cn)‖yn−zn‖2=(1−cn)d(yn,S2ˉu)2+cnd(zn,S3ˉu)2−cn(1−cn)‖yn−zn‖2≤(1−cn)H(S2vn,S2ˉu)2+cnH(S3ρn,S3ˉu)2−cn(1−cn)‖yn−zn‖2≤(1−cn)‖vn−ˉu‖2+cn‖ρn−ˉu‖2−cn(1−cn)‖yn−zn‖2. | (3.8) |
Combination (3.6)–(3.8), we get
‖un+1−ˉu‖2≤(1−cn)‖tn−ˉu‖2−an(1−an)(1−cn)‖tn−xn‖2−cn(1−cn)‖yn−zn‖2+cn‖tn−ˉu‖2−an(1−an)bncn‖tn−xn‖2−bn(1−bn)cn‖xn−yn‖2≤‖tn−ˉu‖2−an(1−an)bn(1−cn)‖tn−xn‖2−cn(1−cn)‖yn−zn‖2−an(1−an)bncn‖tn−xn‖2−bn(1−bn)cn‖xn−yn‖2≤‖un−ˉu‖2+2λn⟨un−un−1,tn−ˉu⟩−an(1−an)bn(1−cn)‖tn−xn‖2−cn(1−cn)‖yn−zn‖2−an(1−an)bncn‖tn−xn‖2−bn(1−bn)cn‖xn−yn‖2≤‖un−ˉu‖2+2λn⟨un−un−1,tn−ˉu⟩−an(1−an)bn‖tn−xn‖2−cn(1−cn)‖yn−zn‖2−bn(1−bn)cn‖xn−yn‖2. | (3.9) |
The inequality (3.9) implies that
an(1−an)bn‖tn−xn‖2+cn(1−cn)‖yn−zn‖2+bn(1−bn)cn‖xn−yn‖2≤‖un−ˉu‖2−‖un+1−ˉu‖2+2λn⟨un−un−1,tn−ˉu⟩. | (3.10) |
Using conditions (a)–(d), limn→∞‖un−ˉu‖ exists and (3.10), we obtain
limn→∞‖tn−xn‖=limn→∞‖xn−yn‖=limn→∞‖yn−zn‖=0. | (3.11) |
This implies that
limn→∞‖tn−un‖=λnlimn→∞‖un−un−1‖=0. | (3.12) |
limn→∞‖vn−tn‖=anlimn→∞‖tn−xn‖=0. | (3.13) |
limn→∞‖ρn−xn‖=bnlimn→∞‖xn−yn‖=0. | (3.14) |
Because {un} is bounded, there exists a subsequence {unk} of {un} such that unk⇀ˉu some ˉu∈K. From (3.12), we have tnk⇀ˉu. Because I−S1 is demiclosed at 0 and (3.11), we obtain ˉu∈S1ˉu. From (3.13), we have vnk⇀ˉu. Because I−S2 is demiclosed at 0 and (3.11), we obtain ˉu∈S2ˉu. It follows from (3.14) that ρnk⇀ˉu. Again, because I−S3 is demiclosed at 0 and (3.11), we have ˉu∈S3ˉ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 limn→∞‖un−ˉ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:K→CB(K) be quasi-nonexpansive multivalued mappings with Υ:=F(S1)∩F(S2)∩F(S3)≠∅ and I−Si is demiclosed at 0 for all i∈{1,2,3}. Let {un} be a sequence generated by
{u0,u1∈K,K1=K,tn=un+λn(un−un−1),vn∈(1−an)tn+anS1tn,ρn∈(1−bn)S1tn+bnS2vn,wn∈(1−cn)S2vn+cnS3ρn,Kn+1={x∈Kn:‖wn−x‖2≤‖un−x‖2+2λ2n‖un−un−1‖2−2λn⟨un−x,un−1−un⟩},un+1=PKn+1u1, | (3.15) |
for all n≥1, where {an},{bn} and {cn}⊂(0,1). Assume that the following conditions hold
(a) ∑∞n=1λn‖un−un−1‖<∞;
(b) 0<lim infn→∞an<lim supn→∞an<1;
(c) 0<lim infn→∞bn<lim supn→∞bn<1;
(d) 0<lim infn→∞cn<lim supn→∞cn<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 n≥1. 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 n≥1. 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 n≥1. Next, we show that Υ⊆Kn for each n≥1. From Lemma 2.6(b) and S1,S2 and S3 satisfy Condition (A), let ˉu∈Υ for xn∈S1tn,yn∈S2vn,zn∈S3ρn and using (3.15), we obtain
‖vn−ˉu‖2=‖(1−an)tn+anxn−ˉu‖2=‖(1−an)(tn−ˉu)+an(xn−ˉu)‖2=(1−an)‖tn−ˉu‖2+an‖xn−ˉu‖2−an(1−an)‖tn−xn‖2≤(1−an)‖tn−ˉu‖2+an‖xn−ˉu‖2=(1−an)‖tn−ˉu‖2+and(xn,S1ˉu)2≤(1−an)‖tn−ˉu‖2+anH(S1tn,S1ˉu)2≤(1−an)‖tn−ˉu‖2+an‖tn−ˉu‖2=‖tn−ˉu‖2, | (3.16) |
‖ρn−ˉu‖2=‖(1−bn)xn+bnyn−ˉu‖2=‖(1−bn)(xn−ˉu)+bn(yn−ˉu)‖2=(1−bn)‖xn−ˉu‖2+bn‖yn−ˉu‖2−bn(1−bn)‖xn−yn‖2≤(1−bn)‖xn−ˉu‖2+bn‖yn−ˉu‖2=(1−bn)d(xn,S1ˉu)2+bnd(yn,S2ˉu)2≤(1−bn)H(S1tn,S1ˉu)2+bnH(S2vn,S2ˉu)2≤(1−bn)‖tn−ˉu‖2+bn‖vn−ˉu‖2≤(1−bn)‖tn−ˉu‖2+bn‖tn−ˉu‖2=‖tn−ˉu‖2 | (3.17) |
and
‖wn−ˉu‖2=‖(1−cn)yn+cnzn−ˉu‖2=‖(1−cn)(yn−ˉu)+cn(zn−ˉu)‖2=(1−cn)‖yn−ˉu‖2+cn‖zn−ˉu‖2−cn(1−cn)‖yn−zn‖2≤(1−cn)‖yn−ˉu‖2+cn‖zn−ˉu‖2=(1−cn)d(yn,S2ˉu)2+cnd(zn,S3ˉu)2≤(1−cn)H(S2vn,S2ˉu)2+cnH(S3ρn,S3ˉu)2≤(1−cn)‖vn−ˉu‖2+cn‖ρn−ˉu‖2≤(1−cn)‖tn−ˉu‖2+cn‖tn−ˉu‖2=‖tn−ˉu‖2=‖un+λn(un−un−1)−ˉu‖2≤‖un−ˉu‖2+2λ2n‖un−un−1‖2−2λn⟨un−ˉu,un−un−1⟩. | (3.18) |
Therefore, from (3.18), ˉu∈Kn,n≥1. This implies that Υ⊆Kn for each n≥1, and hence, Kn≠∅. Thus, {un} is well defined.
Step Ⅱ. Show that un→u∈K as n→∞. Since un∈PKnu1,Kn+1⊆Kn, and un+1∈Kn, we obtain
‖un−u1‖≤‖un+1−u1‖,∀n≥1. | (3.19) |
Since Υ⊆Kn, we obtain
‖un−u1‖≤‖x−u1‖,∀n≥1, | (3.20) |
for all x∈Υ. The inequalities (3.19) and (3.20) imply that the sequence {un−u1} is bounded and non-decreasing. Therefore, limn→∞‖un−u1‖ exists.
For m>n, from the definition of Kn, we obtain um∈PKmu1∈Km⊆Kn. Using Lemma 2.5, we have
‖um−un‖2≤‖um−u1‖2−‖un−u1‖2. | (3.21) |
From limn→∞‖un−u1‖ exists and follows (3.21), we have that limn→∞‖un−um‖=0. Therefore, {un} is a Cauchy sequence in K, and so un→u∈K as n→∞.
Step Ⅲ. Show that limn→∞‖tn−xn‖=limn→∞‖xn−yn‖=limn→∞‖yn−zn‖=0, where xn∈S1tn,yn∈S2vn and zn∈S3ρn. From Step Ⅱ, we obtain limn→∞‖un+1−un‖=0. Because un+1∈Kn, we have that
‖wn−un‖≤‖wn−un+1‖+‖un+1−un‖≤√‖un−un+1‖2+2λ2n‖un−un−1‖2−2λn⟨un−un+1,un−1−un⟩+‖un+1−un‖. | (3.22) |
Using the assumption (a) and (3.22), we have
limn→∞‖wn−un‖=0. | (3.23) |
Because S1 satisfies condition (A) and using Lemma 2.7, we obtain
‖wn−ˉu‖2≤(1−cn)‖vn−ˉu‖2+cn‖ρn−ˉu‖2−cn(1−cn)‖yn−zn‖2. | (3.24) |
Using (3.6), (3.7) and (3.24), we have
‖wn−ˉu‖2≤(1−cn)‖tn−ˉu‖2−an(1−an)(1−cn)‖tn−xn‖2+cn‖tn−ˉu‖2−an(1−an)bncn‖tn−xn‖2−bn(1−bn)cn‖xn−yn‖2−cn(1−cn)‖yn−zn‖2≤(1−cn)‖tn−ˉu‖2−an(1−an)bn(1−cn)‖tn−xn‖2+cn‖tn−ˉu‖2−an(1−an)bncn‖tn−xn‖2−bn(1−bn)cn‖xn−yn‖2−cn(1−cn)‖yn−zn‖2=‖tn−ˉu‖2−an(1−an)bn‖tn−xn‖2−bn(1−bn)cn‖xn−yn‖2−cn(1−cn)‖yn−zn‖2≤‖un−ˉu‖2+2λn⟨un−un−1,tn−ˉu⟩−an(1−an)bn‖tn−xn‖2−bn(1−bn)cn‖xn−yn‖2−cn(1−cn)‖yn−zn‖2. | (3.25) |
The inequality (3.25) implies that
an(1−an)bn‖tn−xn‖2+bn(1−bn)cn‖xn−yn‖2+cn(1−cn)‖yn−zn‖2≤‖un−ˉu‖2−‖wn−ˉu‖2+2λn⟨un−un−1,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
limn→∞‖tn−un‖=limn→∞‖vn−tn‖=limn→∞‖ρn−xn‖=0. | (3.27) |
From Step Ⅱ, we know that un→u∈K. It follows (3.27), we obtain that tn→u. Because I−S1 is demiclosed at 0, we have u∈F(S1). In the same way, we have that u∈F(S2) and u∈F(S3). This implies that u∈Υ.
Step Ⅳ. Show that u=PΥu1. From u∈Υ and (3.19), we obtain
‖u−u1‖≤‖x−u1‖,∀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:K→CB(K) be quasi-nonexpansive multivalued mappings with Υ:=F(S1)∩F(S2)∩F(S3)≠∅ and I−Si is demiclosed at 0 for all i∈{1,2,3}. Let {un} be a sequence generated by
{u0,u1∈K,R1=K,tn=un+λn(un−un−1),vn∈(1−an)tn+anS1tn,ρn∈(1−bn)S1tn+bnS2vn,wn∈(1−cn)S2vn+cnS3ρn,Kn={x∈K:‖wn−x‖2≤‖un−x‖2+2λ2n‖un−un−1‖2−2λn⟨un−x,un−1−un⟩},Rn={x∈Rn−1:⟨u1−un,un−x⟩≥0},un+1=PKn∩Rnu1, | (3.28) |
for all n≥1, where {an},{bn} and {cn}⊂(0,1). Assume that the following conditions hold
(a) ∑∞n=1λn‖un−un−1‖<∞;
(b) 0<lim infn→∞an<lim supn→∞an<1;
(c) 0<lim infn→∞bn<lim supn→∞bn<1;
(d) 0<lim infn→∞cn<lim supn→∞cn<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 n≥1. Next, we show that Υ⊆Rn for all n≥1. Indeed, by mathematical induction, for n=1, we obtain Υ⊆K=R1. Suppose that Υ⊆Rn for all n≥1. Because un+1 is the projection of u1 onto Kn∩Rn, we obtain
⟨u1−un+1,un+1−x⟩≥0,∀x∈Kn∩Rn. |
Therefore, Υ⊆Kn+1. Hence, Υ⊆Kn∩Rn. This implies that {un} is well defined.
Next, we show that un→q∈K as n→∞. Using the definition of Rn, we obtain un=PRnu1. Because un+1∈Rn, we have the inequality (3.19) and
‖un−u1‖≤‖q−u1‖,∀q∈Υ. | (3.29) |
From (3.19) and (3.29) we have the sequence {un−u1} is bounded and non-decreasing, and so limn→∞‖un−u1‖ exists. For m>n, by definition of Rn, we have um=PRmu1∈Rm⊆Rn. Using Lemma 2.5, we have (3.21). Because limn→∞‖un−u1‖ exists, it follows (3.21), we obtain limn→∞‖um−un‖=0. Therefore, {un} is a Cauchy sequence in K, and hence un→q∈K as n→∞. In fact, we have limn→∞‖un+1−un‖=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∗:=minx∈K∗‖x−u‖2, | (4.1) |
where K∗=Kn∩Rn. 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 Kn∩Rn, where
Rn={x∈H:‖wn−x‖2≤‖un−x‖2+2λ2n‖un−un−1‖2−2λn⟨un−x,un−1−un⟩}. | (4.2) |
The projection can be thought of as the following optimization problem by point (4.2):
PKn+1:=minx∈Kn+1‖x−u‖2, | (4.3) |
where Kn+1=Kn∩Rn.
Example. Let H=R3 and K=[2,5]3.
Let K1={u=(u1,u2,u3)∈R3:√(u1−5)2+(u2−5)2+(u3−5)2≤2}. We defined S1,S2,S3:R3→CB(R3) as:
S1u={{(5,5,5)}ifu∈K1,{v=(v1,v2,v3)∈K:√(v1−5)2+(v2−5)2+(v3−5)2≤1‖u‖1}otherwise,S2u={{(5,5,5)}ifu∈K1,{v=(5,v2,5)∈K:v2∈[(u2+5)(arctan(19u2−65)2)+u2,5]}otherwise,andS3u={{(5,5,5)}ifu∈K1,{v=(5,5,v3)∈K:v3∈[(u2−5)(sin(19u2−10)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)2‖un−un−1‖,0.035}ifun≠un−1,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+1−un‖<10−10. We make different choices of the initial values x0 and x1 as follows (see Figure 1 and Table 1)
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 |
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
![]() |
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 |
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 |