The main aim of this manuscript is to work on the split equilibrium problem with the combined results of the fixed point problem and split variational inequality problem. This paper is an extension of the recent work of Lohawech et al. We proposed a sequence that converges weakly to the common solution of all the three problems mentioned earlier. In the end, we supply some direct consequences of the main result, as the paper is an extension of various existing results.
Citation: Savita Rathee, Monika Swami. Algorithm for split variational inequality, split equilibrium problem and split common fixed point problem[J]. AIMS Mathematics, 2022, 7(5): 9325-9338. doi: 10.3934/math.2022517
[1] | Saud Fahad Aldosary, Mohammad Farid . A viscosity-based iterative method for solving split generalized equilibrium and fixed point problems of strict pseudo-contractions. AIMS Mathematics, 2025, 10(4): 8753-8776. doi: 10.3934/math.2025401 |
[2] | James Abah Ugboh, Joseph Oboyi, Hossam A. Nabwey, Christiana Friday Igiri, Francis Akutsah, Ojen Kumar Narain . Double inertial extrapolations method for solving split generalized equilibrium, fixed point and variational inequity problems. AIMS Mathematics, 2024, 9(4): 10416-10445. doi: 10.3934/math.2024509 |
[3] | Wenlong Sun, Gang Lu, Yuanfeng Jin, Zufeng Peng . Strong convergence theorems for split variational inequality problems in Hilbert spaces. AIMS Mathematics, 2023, 8(11): 27291-27308. doi: 10.3934/math.20231396 |
[4] | Jamilu Abubakar, Poom Kumam, Jitsupa Deepho . Multistep hybrid viscosity method for split monotone variational inclusion and fixed point problems in Hilbert spaces. AIMS Mathematics, 2020, 5(6): 5969-5992. doi: 10.3934/math.2020382 |
[5] | Meiying Wang, Luoyi Shi, Cuijuan Guo . An inertial iterative method for solving split equality problem in Banach spaces. AIMS Mathematics, 2022, 7(10): 17628-17646. doi: 10.3934/math.2022971 |
[6] | Mohammad Dilshad, Aysha Khan, Mohammad Akram . Splitting type viscosity methods for inclusion and fixed point problems on Hadamard manifolds. AIMS Mathematics, 2021, 6(5): 5205-5221. doi: 10.3934/math.2021309 |
[7] | Lu-Chuan Ceng, Shih-Hsin Chen, Yeong-Cheng Liou, Tzu-Chien Yin . Modified inertial subgradient extragradient algorithms for generalized equilibria systems with constraints of variational inequalities and fixed points. AIMS Mathematics, 2024, 9(6): 13819-13842. doi: 10.3934/math.2024672 |
[8] | Lu-Chuan Ceng, Li-Jun Zhu, Tzu-Chien Yin . Modified subgradient extragradient algorithms for systems of generalized equilibria with constraints. AIMS Mathematics, 2023, 8(2): 2961-2994. doi: 10.3934/math.2023154 |
[9] | Yali Zhao, Qixin Dong, Xiaoqing Huang . A self-adaptive viscosity-type inertial algorithm for common solutions of generalized split variational inclusion and paramonotone equilibrium problem. AIMS Mathematics, 2025, 10(2): 4504-4523. doi: 10.3934/math.2025208 |
[10] | Bancha Panyanak, Chainarong Khunpanuk, Nattawut Pholasa, Nuttapol Pakkaranang . A novel class of forward-backward explicit iterative algorithms using inertial techniques to solve variational inequality problems with quasi-monotone operators. AIMS Mathematics, 2023, 8(4): 9692-9715. doi: 10.3934/math.2023489 |
The main aim of this manuscript is to work on the split equilibrium problem with the combined results of the fixed point problem and split variational inequality problem. This paper is an extension of the recent work of Lohawech et al. We proposed a sequence that converges weakly to the common solution of all the three problems mentioned earlier. In the end, we supply some direct consequences of the main result, as the paper is an extension of various existing results.
Split equilibrium problem (SEP), introduced by He [20] in 2012, which is defined as: find the solution of equilibrium problem (EP) whose image is also a solution of another EP under a given bounded linear operator. Let H1 and H2 be two real Hilbert spaces and C and Q be closed convex subsets of H1 and H2, respectively and B:H1→H2 be a linear and bounded operator. Let f and F be two functions from C×C and Q×Q to R, respectively, then SEP is to get a point c∈C such that
f(c,c∗)≥0 ∀c∗∈C | (1.1) |
and
d=Bc∈Q solves F(d,d∗)≥0 ∀d∗∈Q. | (1.2) |
Equation (1.1) is named as classical Equilibrium Problem given by Blum [2] and its solution set is denoted by EP(f).
SEP provides us a way to split the solution between two different subsets such that the solution of one problem and its image implies the solution of another problem under the imposed bounded linear operator. As the special case of SEP, split variational inequality problem (SVIP) was introduced by Censor et al. [17], in 2012. The SVIP is stated as: consider g and g′ be two operator for H1 and H2, two Hilbert Spaces, respectively, B:H1→H2 be a linear and bounded operator, C and Q be the same as defined above, then
c∈C suchthat ⟨g(c),c∗−c⟩≥0 ∀ c∗∈C | (1.3) |
and
d=Bc∈Q suchthat ⟨g′(d),d∗−d⟩≥0 ∀ d∗∈Q. | (1.4) |
and the equation (1.2) separately gives classical variational inequality (VI).
Split common fixed point problem (SCFPP), introduced by Censor and Segal [18], in 2009. The SCFPP problem is to find a point c∈Fix(S) gives Bc∈Fix(T), where B:H1→H2 is linear and bounded operator with S:H1→H1 and T:H2→H2 are the general operators and Fix() denoted the solution set of fixed point of the considered mapping. SCFPP is the generalization of Split Feasibility Problem, given by Censor and Elfving [19], in 1994 and this problem formulate a point c∈C with Bc∈Q where C and Q are convex subsets of H1 and H2, respectively.
Korpelevich [3], in 1976, introduced the extragradient method for solving Eq (1.2) when g is monotone and k-Lipschitz continuous in the finite dimensional Euclidean space. In 2003, Takahashi and Toyoda [13] introduced the following method to calculate the common solution of VIP and fixed point problem (FPP)
xn+1=λnxn+(1−λn)SPC(xn−γnfxn), |
where S:C→C is nonexpansive mapping and f:C→H1 is a ν-inverse strongly monotone mapping.
After that, in 2006 Nadezhkina and Takahashi [14] suggested the modified extragradient method to prove the weak convergence of the defined iteration to the common solution of VIP and FPP:
yn=PC(xn−γnfxn),xn+1=λnxn+(1−λn)SPC(xn−γnfyn), |
where S:C→C is nonexpansive mapping and f:C→H1 is a monotone and k-Lipschitz continuous mapping. Later on, in 2011, Kangtunyakarn [1] proved the convergence theorem for calculating the common point of the three sets of solutions of equilibrium problem, variational inequality and the fixed point problems by practicing with a newly developed mapping achieved by infinite family of real numbers and of nonexpansive mappings.
In 2017, Tian et al. [11] proposed an algorithm for finding an element to solve the class of SVIP by combining extragradient method with CQ algorithm. In 2018, Lohawech et al. [12] proved the existence of common solution of the SVIP and FPP by the introduced iterative method which was inspired from Nadezhkina and Takahashi's [14] modified extragradient method and Xu's [7] algorithm and proved its weak convergence.
Inspired from work of Tian et al. [11] and Lohewech et al. [12], we extend results in the direction of findings the common solution of SVIP and SEP with SCFPP.
Lemma 2.1. [9] Given a∈H and z∈C, then the following statements are equivalent:
(i) z=PCa;
(ii) ⟨a−z,z−b⟩≥0 ∀ b∈C;
(iii) ⟨a−PCa,b−PCa⟩≤0 ∀ a∈H,b∈C;
(iv) ‖a−b‖2≥‖a−z‖2+‖b−z‖2 ∀ b∈C.
Lemma 2.2. [2] Let the function f:C×C→R satisfy the following conditions:
(i) f(u,u)=0∀u∈C;
(ii) f is monotone, i.e. f(u,v)+f(v,u)≤0 ∀u,v∈C;
(iii) for each u,v,w∈C,limt→0f(tw+(1−t)u,v)≤f(u,v);
(iv) for each u∈C,f(u,.) is convex and lower semicontinuous.$
Then EP(f)≠ϕ.
Lemma 2.3. [2] Let r>0,u∈H, and f satisfy the conditions (i)-(iv) in Lemma (2.2), then there exists w∈C such that f(w,v)+1r⟨v−w,w−u⟩≥0∀v∈C.
Lemma 2.4. [2] Let r>0,u∈H, and f satisfy the conditions (i)-(iv) in Lemma (2.2). Define a mapping Tr:H→C as Tr(u)={w∈C:f(w,v)+1r⟨v−w,w−u⟩≥0∀v∈C}. Then the following hold:
(i) Tr is single-valued;
(ii) Tr is firmly nonexpansive, i.e., ‖Tru−Trv‖≤⟨Tru−Trv,u−v⟩ for all u,v∈H;
(iii) EP(f)=F(Tr), where F(Tr) denotes the sets of fixed point of Tr;
(iv) EP(f) is closed and convex.
Definition 2.1. [15] Let A:H→H be a set valued mapping with the effective domain D(A)={x∈H:Ax≠ϕ}.
The set valued mapping A is said to be monotone if, for each x,y∈D(A),u∈Ax and v∈Ay, we have
⟨x−y,u−v⟩≥0. |
As, graph of A is defined by G(A)={(x,y):y∈Ax} and the mapping A is maximal if its graph G(A) is not appropriately contained in the graph of any other mapping which is of same type as A. The accompanying nature of the maximal monotone mappings is advantageous and supportive to utilize:
A monotone mapping A is maximal if and only if, for (x,u)∈H×H,
⟨x−y,u−v⟩≥0 foreach (y,v)∈G(A) implies u∈Ax. |
For maximal monotone set-valued mapping A on H and r>0, the operator
Jr:=(I−rA)−1:H→D(A) |
is called the resolvent of A.
Consider f:C→H be a monotone and k-Lipschitz continuous mapping. In [5], normal cone to C is specified by
NCx={z∈H:⟨z,y−x⟩≤0, ∀ y∈C} forall x∈C |
is maximal monotone and resolvent of NC is PC.
Lemma 2.5. [14] Let H1 and H2 be real Hilbert spaces. Let A:H1→H1 be a maximal monotone mapping and Jr be the resolvent of A for r<0. Suppose that T:H2→H2 is a nonexpansive mapping and B:H1→H1 is a bounded linear operator. Assume that A−10∩B−1Fix(T)≠ϕ. Let r,α>0 and z∈H1. Then the following statements are equivalent:
(i) z=Jr(I−αB∗(I−T)B)z;
(ii) 0∈B∗(I−T)Bz+Az;
(iii) z∈A−10∩B−1Fix(T).
Lemma 2.6. [16] Let {βn} be a real sequence satisfying 0<a≤βn≤b<1 for all n≥0, and let {μn} and {νn} be two sequences in H such that, for some η≥0,
limn→∞sup‖μn‖≤η,limn→∞sup‖{νn}≤η,andlimn→∞‖βnμn+(1−βn)νn‖=η. |
Lemma 2.7. [6] Let {an} be a sequence in H satisfying the properties:
(i) limn→∞‖an−a‖ exists for each a∈C;
(ii) ωw(an)⊂C, where ωw(an) represents the set of all weak cluster points of {an}.
Then {an} converges weakly to a point in C.
Throughout, we consider C and Q both are nonempty closed convex subsets of real Hilbert spaces H1 and H2, respectively. Suppose that B:H1→H2 is a non-zero bounded linear operator, f:C×C→R and F:Q×Q→R be two functions satisfiy the conditions (i) to (iv) of Lemma (2.2), g:C→H1 is a monotone and k-Lipschitz continuous mapping and g′:H2→H2 is a δ- inverse strongly monotone mapping. Suppose T:H2→H2 and S:C→C are nonexpansive mappings. Let {μn},{αn}⊂(0,1),{γn}⊂[a,b] for some a,b∈(0,1‖B‖2) and {λn}⊂[c,d] where c,d∈(0,1k).
Initially, we define an algorithm for solving VIP, SCFPP and SEP, the purpose of which is to discover an element a∗ in such a way that
a∗∈VI(C,g)∩Fix(S)∩EP(f) and Ba∗∈Fix(T)∩EP(F). | (3.1) |
Theorem 3.1. Fix ℸ={u∈VI(C,g)∩Fix(S)∩EP(f):Bu∈Fix(T)∩EP(F)} and consider that ℸ≠ϕ. Let the sequences {un},{vn},{an},{bn} and {cn} be defined by a1=a∈C and
f(vn,z)+1rn⟨z−vn,vn−an⟩≥0,F(un,y)+1rn⟨y−un,un−Bvn⟩≥0,cn=μnun+(1−μn)PC(un−γnB∗(I−T)Bun),bn=PC(cn−λng(cn)),an+1=αncn+(1−αn)SPC(cn−λng(bn)), | (3.2) |
for all n∈N. Then, the sequence {an} weakly converges to an element u∈ℸ, where u=limn→∞Pℸan.
Proof. Let a∈ℸ and consider {Trn} be a sequence of mapping as stated in Lemma (2.4), gives a=PC(a−λnBa)=Tfrna, also a=TFrnBa as a∈EP(f) and Ba∈EP(F).
From Theorem 3.1 of [11] that PC(I−γnB∗(I−T)B) is 1+γn‖B‖22 averaged. It is clear to see from Lemma 2.2 of [10] that μnI+(1−μn)PC(I−γnB∗(I−T)B) is μn+(1−μn)1+γn‖B‖22 averaged. So, cn can be written as
cn=(1−βn)un+βnVnun | (3.3) |
where βn=μn+(1−μn)1+γn‖B‖22 and Vn is a nonexpansive mapping for each n∈N.
Let a∈ℸ and from Lemma (2.4), we obtain
‖vn−a‖2=‖Tfrnan−Tfrna‖2≤⟨Tfrnan−Tfrna,an−a⟩=⟨vn−a,an−a⟩=12(‖vn−a‖2+‖an−a‖2−‖an−vn‖2) |
and hence,
‖vn−a‖2≤‖an−a‖2−‖an−vn‖2≤‖an−a‖2. | (3.4) |
Also,
‖un−a‖2=‖TFrnvn−TFrna‖≤⟨un−a,vn−a⟩=12(‖un−a‖2+‖vn−a‖2−‖un−vn‖2),‖un−a‖2≤‖vn−a‖2−‖un−vn‖2≤‖an−a‖2−‖un−vn‖2≤‖an−a‖2. | (3.5) |
From (3.5)
‖cn−a‖2≤‖(1−βn)(un−a)+βn(Vnun−a)2‖=(1−βn)‖un−a‖2+βn‖Vnun−a‖2−βn(1−βn)‖un−Vnun‖2≤‖un−a‖2−βn(1−βn)‖un−Vnun‖2≤‖un−a‖2≤‖an−a‖2, | (3.6) |
implies
βn(1−βn)‖un−Vnun‖2≤‖an−a‖2−‖cn−a‖2. | (3.7) |
Now, set zn=PC(cn−λng(bn)) for all n≥0. It pursue from Lemma (2.1) that
‖zn−a‖2≤‖cn−λng(bn)−a‖2−‖cn−λng(bn)−zn‖2≤‖cn−a‖2−‖cn−zn‖2+2λn⟨g(bn),a−zn⟩≤‖cn−a‖2−‖cn−zn‖2+2λn⟨g(bn)−g(a),a−bn⟩+2λn⟨g(a),a−bn⟩+2⟨g(bn),bn−zn⟩. | (3.8) |
Using the monotonicity of g and a is solution of VIP(g,C), we have
⟨g(bn)−g(a),a−bn⟩≤0 and ⟨g(a),a−bn⟩≤0. | (3.9) |
From Eqs (3.8) and (3.9), we obtain
‖zn−a‖2≤‖cn−a‖2−‖cn−zn‖2+2λn⟨g(bn),bn−zn⟩=‖cn−a‖2−‖cn−bn‖2−‖bn−zn‖2−2⟨cn−bn,bn−zn⟩+2λn⟨g(bn),bn−zn⟩=‖cn−a‖2−‖cn−bn‖2−‖bn−zn‖2+2⟨cn−bn−λngbn,zn−bn⟩. |
Using condition (iii) of Lemma (2.1) again, this yields
⟨cn−bn−λng(bn),zn−bn⟩ =⟨cn−λng(cn)−bn,zn−bn⟩ +⟨λng(cn)−λng(bn),zn−bn⟩≤⟨λng(cn)−λng(bn),zn−bn⟩≤λnk‖cn−bn‖⋅‖zn−bn‖ |
and so,
‖zn−a‖2≤‖cn−a‖2−‖cn−bn‖2−‖bn−zn‖2+2λnk‖cn−bn‖⋅‖zn−bn‖ |
for each n∈N, we obtain that
0≤(‖zn−bn‖−λnk‖cn−bn‖)2=‖zn−bn‖2−2λnk‖zn−bn‖.‖cn−bn‖+λ2nk2‖cn−bn‖2, |
that is,
2λnk‖zn−bn‖⋅‖cn−bn‖ ≤‖zn−bn‖2+λ2nk2‖cn−bn‖2, |
implies
‖zn−a‖2≤‖cn−a‖2−‖cn−bn‖2−‖bn−zn‖2+λ2nk2‖cn−bn‖2+‖zn−bn‖2≤‖cn−a‖2+(λ2nk2−1)‖cn−bn‖2≤‖cn−a‖2. | (3.10) |
Now, by Eqs (3.6) and (3.10), we have
‖an+1−a‖2=‖(αncn+(1−αn)Szn)−a‖2=‖αn(cn−a)+(1−αn)(Szn−a)‖2≤αn‖cn−a‖2+(1−αn)‖Szn−a‖2−αn(1−αn)‖cn−a−(Szn−a)‖2≤αn‖cn−a‖2+(1−αn)‖Szn−Sa‖2≤αn‖cn−a‖2+(1−αn)‖zn−a‖2≤αn‖cn−a‖2+(1−αn)[‖cn−a‖2+(λ2nk2−1)‖cn−bn‖2]≤‖cn−a‖2+(1−αn)(λ2nk2−1)‖cn−bn‖2≤‖cn−a‖2≤‖an−a‖2. | (3.11) |
Hence, there exists a constant s≥0 such that
limn→∞‖an−a‖=s, | (3.12) |
implies {an} is bounded. This gives us that, {bn},{cn},{un} and {vn} are all bounded.
From Eqs (3.7) and (3.11), we deduce
βn(1−βn)‖un−Vnun‖2≤‖an−a‖2−‖cn−a‖2≤‖an−a‖2−‖an+1−a‖2. |
By using Eq (3.12), we find
(un−Vnun)→0 as n→∞. |
From Eq (3.3), we calculate
un−cn=βn(un−Vnun)→0 as n→∞. | (3.13) |
Using Eqs (3.5), (3.6) in (3.11), we get
‖an+1−a‖2≤‖cn−a‖2≤‖an−a‖2−‖un−vn‖2⟹‖un−vn‖2≤‖an−a‖2−‖an+1−a‖2≤‖an−an+1‖{‖an−a‖+‖an+1−a‖}→0 as n→∞⟹un−vn→0 as n→∞. | (3.14) |
Again, using Eqs (3.4), (3.5), (3.6) in (3.11), we obtain
‖an+1−a‖2≤‖an−a‖2≤‖un−a‖2≤‖vn−a‖2≤‖an−a‖2−‖an−vn‖2⟹‖an−vn‖2≤‖an−a‖2−‖an+1−a‖2⟹an−vn→0 as n→∞. | (3.15) |
By triangle inequality, we find
‖an−un‖ ≤‖an−vn‖+‖vn−un‖→0 as n→∞. | (3.16) |
Also,
‖an−cn‖ ≤‖an−vn‖+‖vn−un‖+‖un−cn‖→0 as n→∞. | (3.17) |
Equations (3.6), (3.11) and (3.17), implies
(1−αn)(1−λ2nk2)‖cn−bn‖2≤‖cn−a‖2−‖an+1−a‖2 |
and so
cn−bn→0 as n→∞. |
Thus,
‖an−bn‖ ≤‖an−vn‖+‖vn−un‖+‖un−cn‖+‖cn−bn‖→0 as n→∞. | (3.18) |
Also, by definition of {bn}, we have
‖bn−zn‖2=‖PC(cn−λng(cn))−PC(cn−λng(bn))‖2≤‖(cn−λng(cn))−(cn−λng(bn))‖2=‖λng(cn)−λng(bn)‖2≤λ2nk2‖cn−bn‖2, |
implies, bn−zn→0 as n→∞. Again using triangle inequality, we have
‖cn−zn‖ ≤‖cn−bn‖+‖bn−zn‖ |
and
‖vn−zn‖ ≤‖vn−un‖+‖un−cn‖+‖cn−zn‖ |
gives, when n→∞
‖cn−zn‖ and ‖vn−zn‖→0. | (3.19) |
From the definition of {cn}, we implies
(1−μn)(un−PC(un−γnB∗(I−T)Bun))=cn−un. |
Thus, Equation (3.13) gives
un−PC(un−γnB∗(I−T)Bun)→0 as n→∞. | (3.20) |
Let z∈ωw(un). Then there exists a subsequence {uni} of {un} which weakly convergent to z. We acquire that {B∗(I−T)Bun} is bounded, reason being B∗(I−T)B is 12‖B‖2 inverse strongly monotone. From the firm nonexpansive nature of PC, we have
‖PC(I−γniB∗(I−T)B)uni−PC(I−ˆγB∗(I−T)B)uni‖≤|γni−ˆγ|⋅‖B∗(I−T)Bani‖. |
Without loss of generality, we assume that γni→ˆγ∈(0,1‖B‖2) and so,
PC(I−γniB∗(I−T)B)uni−PC(I−ˆγB∗(I−T)B)uni→0 as i→∞. | (3.21) |
Consider
‖ani−PC(I−ˆγB∗(I−T)B)ani‖≤‖(ani−uni)+(uni−PC(I−ˆγB∗(I−T)B)uni)+(PC(I−ˆγB∗(I−T)B)uni−PC(I−ˆγB∗(I−T)B)ani)‖≤‖ani−uni‖+‖uni−PC(I−ˆγB∗(I−T)B)uni‖+‖uni−ani‖. | (3.22) |
In particular
‖uni−PC(I−ˆγB∗(I−T)B)uni‖≤‖uni−PC(I−γniB∗(I−T)B)uni‖+‖PC(I−γniB∗(I−T)B)uni−PC(I−ˆγB∗(I−T)B)uni‖. | (3.23) |
From Eqs (3.18), (3.20) and (3.21) in (3.23), we obtain
uni−PC(I−ˆγB∗(I−T)B)uni→0 as i→∞. | (3.24) |
Now, using Eq (3.16), (3.24) in (3.22), we find
ani−PC(I−ˆγB∗(I−T)B)ani→0 as i→∞. | (3.25) |
By the demiclosedness principle [8], (3.24) and (3.25), respectively, implies
z∈Fix(PC(I−ˆγB∗(I−T)B)),z∈Fix(PC(I−ˆγB∗(I−TFr)B)). |
From Corollary 2.9 [11] and Lemma (2.4), we obtain
z∈C∩B−1(Fix(T)),z∈C∩B−1(Fix(TFr))=z∈C∩B−1(EP(F))). |
Now we claim that z∈VI(C,g). From Eqs (3.13), (3.14), (3.17), (3.18) and (3.19), we obtain bni→u, cni→u,zni→u,uni→u and vni→u. Interpret the set-valued mapping A:H→H by
Av={g(v)+NCv,if ∀ v∈Cϕ,if ∀ v∉C |
In 2006, Takahashi [14] suggested that A is maximal monotone and for this 0∈Av iff v∈VI(C,g). For (v,w)∈D(A) we have w∈Av=g(v)+NCv and implies w−g(v)∈NCv. Therefore, for any x∈C, we get
⟨v−x,w−g(v)⟩≥0. | (3.26) |
As v∈C. The explanation of bn and Lemma (2.1) implies that
⟨cn−λng(cn)−bn,bn−v⟩≥0. |
Continuing
⟨cn−bnλn+g(cn),v−bn⟩≥0. |
By Equation (3.25) with {bni}, we obtain
⟨w−g(v),v−bni⟩≥0. |
Thus,
⟨w,v−bni⟩ ≥⟨g(v),v−bni⟩≥⟨g(v),v−bni⟩−⟨cni−bniλni+g(cni),v−bni⟩=⟨g(v)−g(bni),v−bni⟩+⟨g(bni)−g(cni),v−bni⟩−⟨cni−bniλni,v−bni⟩≥⟨g(bni)−g(cni),v−bni⟩−⟨cni−bniλni,v−bni⟩. |
By considering i→∞, we have
⟨w,v−z⟩ ≥0. |
By maximal monotonicity of A, we obtain 0∈Az and then z∈VI(C,g).
Now, we will exhibit that z∈Fix(S).
From Eqs (3.6), (3.10) and the nonexpansive nature of S, we get
‖S(zn)−a‖ =‖S(zn)−S(a)‖≤‖zn−a‖≤‖cn−a‖≤‖an−a‖. |
By taking limit superior
limn→∞‖S(zn)−a‖ ≤c |
and
limn→∞‖cn−a‖ ≤c. |
Further
limn→∞‖αn(cn−a)+(1−αn)(S(zn)−a)‖ =limn→∞‖αncn+(1−αn)Szn−a‖=limn→∞‖an+1−a‖=c. |
Thus, Lemma (2.6), implies
limn→∞‖Szn−cn‖=0. | (3.27) |
Again from the fact of
‖S(cn)−cn‖ =‖(S(cn)−S(zn))+(S(zn)−cn)‖≤‖S(cn)−S(zn)‖+‖S(zn)−cn‖≤‖cn−zn‖+‖S(zn)−cn‖. |
By Eqs (3.19) and (3.27), we find
limn→∞‖S(cn)−cn‖ =0. |
This infers that
limi→∞‖(I−S)cni‖ =limi→∞‖cni−Scni‖=0. |
Thus, we have z∈Fix(S).
Now, we prove z∈EP(f). As un=Tfran and
f(un,z)+1r⟨z−un,un−an⟩≥0 ∀ z∈C. |
From monotonicity of f, we have
1r⟨z−un,un−an⟩≥−f(un,z)≥f(z,un) |
and hence
⟨z−uni,uni−anir⟩≥f(z,uni). |
Since uni−anir→0 as uni→0 weakly lower semicontinuity of f(a,y) on second variable y, we have
f(z,u)≤0∀z∈C. |
For k with 0≤k≤1 and z∈C, let zt=kz+(1−t)u
0=f(zt,zt)≤tf(zt,z)+(1−t)f(zt,u)≤tf(zt,z)⟹f(zt,z)≥0⟹f(u,z)≥0u∈EP(f). |
Consequently, ww(an)⊂ℸ. From the Lemma (2.7), the sequence {an} converges weakly to an element u∈ℸ and Lemma 3.2 [13] satisfies u=limn→∞Pℸan.
The successive result gives us the suitable conditions to obtain the presence of a common solution of the split variational inequality problems, fixed point problems and split equilibrium problems, that is, to discover an element a∗ in such a way that
a∗∈VI(C,g)∩Fix(S)∩EP(f) andBa∗∈VI(Q,g′)∩EP(F). |
Theorem 3.2. Set ℸ={u∈VI(C,g)∩Fix(S)∩EP(f):Bu∈VI(Q,g′)∩EP(F)} and consider that ℸ≠ϕ. Let the sequences {un},{vn},{an},{bn} and {cn} be defined by a1=a∈C and{
f(vn,z)+1rn⟨z−vn,vn−an⟩≥0,F(un,y)+1rn⟨y−un,un−Bvn⟩≥0,cn=μnun+(1−μn)PC(un−γnB∗(I−PQ(I−θg′))Bun),bn=PC(cn−λng(cn)),an+1=αncn+(1−αn)SPC(cn−λng(bn)), |
for all n∈N. Then, the sequence {an} weakly converges to an element u∈ℸ, where u=limn→∞Pℸan.
Proof. From the δ-inverse strongly monotonicity of g′, it is 1δ- Lipschitz continuous and so, θ∈(0,2δ), we find that I−θg′ is nonexpansive. Also, PQ is firmly nonexpansive, implies PQ(I−θg′) is nonexpansive. With replacement of T=PQ(I−θg′) in Theorem (3.1), we get that {an} is weakly convergent to an element u∈VI(C,g)∩Fix(S)∩EP(f) and Bu∈Fix(PQ(I−θg′)∩TFrn). We pursue from Bu=PQ(I−θg′)Bu and Bu∈EP(F) and Lemma (2.1) that Bu∈VI(Q,g′)∩EP(F). This completes the proof.
The following results are the direct consequences of Theorem (3.1).
Theorem 3.3. Let A:H2→H2 be a maximal monotone mapping with D(A)≠ϕ. Consider ℸ={u∈VI(C,g)∩Fix(S)∩EP(f):Bu∈A−10∩EP(F)} and assume ℸ≠ϕ. Let the sequences {un},{vn},{an},{bn} and {cn} be defined by a1=a∈C and{
f(vn,z)+1rn⟨z−vn,vn−an⟩≥0,F(un,y)+1rn⟨y−un,un−Bvn⟩≥0,cn=μnun+(1−μn)PC(un−γnB∗(I−Jr)Bun),bn=PC(cn−λng(cn)),an+1=αncn+(1−αn)SPC(cn−λng(bn)), |
for all n∈N, where J−r is resolvent of A for r>0. Then, the sequence {an} weakly converges to an element u∈ℸ, where u=limn→∞Pℸan.
Proof. From the firmly nonexpansive nature of Jr and Fix(Jr)=A−10, the proof remains the same as of Theorem (3.1) by considering Jr=T.
Theorem 3.4. Let A:H2→H2 be a maximal monotone mapping with D(A)≠ϕ and G:H2→H2 be a δ-inverse strongly monotone mapping. Set ℸ={u∈VI(C,g)∩Fix(S)∩EP(f):Bu∈(A+G)−10∩EP(F)} and assume ℸ≠ϕ. Let the sequences {un},{vn},{an},{bn} and {cn} be defined by a1=a∈C and{
f(vn,z)+1rn⟨z−vn,vn−an⟩≥0,F(un,y)+1rn⟨y−un,un−Bvn⟩≥0,cn=μnun+(1−μn)PC(un−γnB∗(I−Jr(I−rG))Bun),bn=PC(cn−λng(cn)),an+1=αncn+(1−αn)SPC(cn−λng(bn)), |
}for all n∈N, where J−r is resolvent of A for r>0. Then, the sequence {an} weakly converges to an element u∈ℸ, with u=limn→∞Pℸan.
Proof. From the δ− strongly inverse monotone nature of G implies that I−rG is nonexpansive. Also, from the nonexpansive nature of Jr, we get that Jr(I−rG) is also nonexpansive. As u∈(A+G)−10 if and only if u=Jr(I−rG)u. Thus, the proof remains the same as of Theorem (3.1) by considering Jr(I−rG)=T.
We obtained the weak convergence of the defined algorithm for solving variational inequality, split common fixed point and split equilibrium problems, by extending the results of Tian et al. [11] and Lohewech et al. [12].
Special thanks to CSIR PUSA Delhi to provide scholarship for the research under the file no-09/382(0187)/2017-EMR-I.
There is no conflict of interest.
[1] | A. Kangtunyakarn, A new iterative algorithm for the set of fixed-point problems of nonexpansive mappings and the set of equilibrium problem and variational inequality problem, Abstr. Appl. Anal., 2011 (2011), 1–24. |
[2] |
E. Blum, W. Oettli, From optimization and variational inequalities to equilibrium problems, Math. Stud., 63 (1994), 123–145. Corpus ID: 117484413. https://doi.org/10.2307/3977996 doi: 10.2307/3977996
![]() |
[3] |
G. M. Korpelevich, An extragradient method for finding saddle points and for other problems, Ekonomika i Matematicheskie Metody, 12 (1976), 747–756. https://doi.org/10.3103/S0278641910030039 doi: 10.3103/S0278641910030039
![]() |
[4] |
G. Stampacchia, Formes bilineaires coercivites sur les ensembles convexes, C. R. Acad. Sci. Paris, 258 (1964), 4413–4416. https://doi.org/10.1186/s13660-018-1942-1 doi: 10.1186/s13660-018-1942-1
![]() |
[5] | H. H. Bauschke, P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces, Springer, (2011), New York. https://doi.org/10.1007/978-1-4419-9467-7 |
[6] |
H. K. Xu, Averaged mappings and the gradient-projection algorithm, J. Optim. Theory Appl., 105 (2011), 360–378. https://doi.org/10.1007/s10957-011-9837-z doi: 10.1007/s10957-011-9837-z
![]() |
[7] |
H. K. Xu, Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces, Inverse Probl., 26 (2010), 17 pages. https://doi.org/10.1088/0266-5611/26/10/105018 doi: 10.1088/0266-5611/26/10/105018
![]() |
[8] |
H. K. Xu, Viscosity approximation methods for nonexpansive mappings, J. Optim. Theory Appl., 298 (2004), 279–291. https://doi.org/10.1016/j.jmaa.2004.04.059 doi: 10.1016/j.jmaa.2004.04.059
![]() |
[9] |
L. C. Ceng, Q. H. Ansari, J. C. Yao, Some iterative methods for finding fixed points and for solving constrained convex minimization problems, Nonlinear Anal., 74 (2011), 5286–5302. https://doi.org/10.1016/j.na.2011.05.005 doi: 10.1016/j.na.2011.05.005
![]() |
[10] |
M. Suwannaprapa, N. Petrot, S. Suantai, Weak convergence theorems for split feasibility problems on zeros of the sum of monotone operators and fixed point sets in Hilbert spaces, Fixed Point Theory Appl., (2017), 6 pages. https://doi.org/10.1186/s13663-017-0599-7 doi: 10.1186/s13663-017-0599-7
![]() |
[11] |
M. Tian, B. N. Jiang, Weak convergence theorem for a class of split variational inequality problems and applications in a Hilbert space, J. Inequal. Appl., 123 (2017), 17 pages. https://doi.org/10.1186/s13660-017-1397-9 doi: 10.1186/s13660-017-1397-9
![]() |
[12] |
P. Lohawech, A. Kaewcharoen, A. Farajzadeh, Algorithm for the common solution of the split variational inequality problems and fixed point problems with applications, J. Inequal. Appl., (2018), 27 pages. https://doi.org/10.1186/s13660-018-1942-1 doi: 10.1186/s13660-018-1942-1
![]() |
[13] |
W. Takahashi, M. Toyoda, Weak convergence theorem for nonexpansive mappings and monotone mappings, J. Optim. Theory Appl., 118 (2003), 417–423. https://doi.org/10.1023/A:1025407607560 doi: 10.1023/A:1025407607560
![]() |
[14] |
W. Takahashi, N. Nadezhkina, Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings, J. Optim. Theory Appl., 128 (2006), 191–201. https://doi.org/10.1007/s10957-005-7564-z doi: 10.1007/s10957-005-7564-z
![]() |
[15] |
W. Takahashi, H. K. Xu, J. C. Yao, Iterative methods for generalized split feasibility problems in Hilbert spaces, St-Valued Var. Anal., 23 (2015), 205–221. https://doi.org/10.1007/s11228-014-0285-4 doi: 10.1007/s11228-014-0285-4
![]() |
[16] | X. Qin, J. C. Yao, Projection splitting algorithms for nonself operators, J. Nonlinear Convex A., 18 (2017), 925–935. |
[17] |
Y. Censor, A. Gibali, S. Reich, Algorithm for the split variational inequality problem, Numer. Algorithms, 58 (2012), 117–136. https://doi.org/10.1007/s11075-011-9490-5 doi: 10.1007/s11075-011-9490-5
![]() |
[18] |
Y. Censor, A. Segal, The split common fixed point problem for directed operators, J. Convex Anal., 16 (2009), 587–600. https://doi.org/10.1088/0266-5611/26/5/055007 doi: 10.1088/0266-5611/26/5/055007
![]() |
[19] | Y. Censor, T. Elfving, A multiprojection algorithms using Bragman projection in a product space, 8 (1994), 221–239. https://doi.org/10.1007/BF02142692 |
[20] |
Z. He, The split Equilibrium problem and its convergence algorithms, J. Inequal. Appl., 162 (2012), 15 pages. https://doi.org/10.1186/1029-242X-2012-162 doi: 10.1186/1029-242X-2012-162
![]() |
1. | Fahim Uddin, Faizan Adeel, Khalil Javed, Choonkil Park, Muhammad Arshad, Double controlled $ M $-metric spaces and some fixed point results, 2022, 7, 2473-6988, 15298, 10.3934/math.2022838 | |
2. | Tzu-Chien Yin, Nawab Hussain, Hind Alamri, Asim Asiri, Maha Mohammed Saeed, A nonlinear split problem regarding variational inequalities and equilibrium problems, 2024, 2024, 1029-242X, 10.1186/s13660-024-03196-0 |