
Citation: Jamilu Abubakar, Poom Kumam, Jitsupa Deepho. Multistep hybrid viscosity method for split monotone variational inclusion and fixed point problems in Hilbert spaces[J]. AIMS Mathematics, 2020, 5(6): 5969-5992. doi: 10.3934/math.2020382
[1] | 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 |
[2] | Pongsakorn Yotkaew, Nopparat Wairojjana, Nuttapol Pakkaranang . Accelerated non-monotonic explicit proximal-type method for solving equilibrium programming with convex constraints and its applications. AIMS Mathematics, 2021, 6(10): 10707-10727. doi: 10.3934/math.2021622 |
[3] | Mohammad Dilshad, Fahad Maqbul Alamrani, Ahmed Alamer, Esmail Alshaban, Maryam G. Alshehri . Viscosity-type inertial iterative methods for variational inclusion and fixed point problems. AIMS Mathematics, 2024, 9(7): 18553-18573. doi: 10.3934/math.2024903 |
[4] | 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 |
[5] | 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 |
[6] | Jun Yang, Prasit Cholamjiak, Pongsakorn Sunthrayuth . Modified Tseng's splitting algorithms for the sum of two monotone operators in Banach spaces. AIMS Mathematics, 2021, 6(5): 4873-4900. doi: 10.3934/math.2021286 |
[7] | 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 |
[8] | Yasir Arfat, Supak Phiangsungnoen, Poom Kumam, Muhammad Aqeel Ahmad Khan, Jamshad Ahmad . Some variant of Tseng splitting method with accelerated Visco-Cesaro means for monotone inclusion problems. AIMS Mathematics, 2023, 8(10): 24590-24608. doi: 10.3934/math.20231254 |
[9] | Mohammad Dilshad, Mohammad Akram, Md. Nasiruzzaman, Doaa Filali, Ahmed A. Khidir . Adaptive inertial Yosida approximation iterative algorithms for split variational inclusion and fixed point problems. AIMS Mathematics, 2023, 8(6): 12922-12942. doi: 10.3934/math.2023651 |
[10] | Habib ur Rehman, Poom Kumam, Kanokwan Sitthithakerngkiet . Viscosity-type method for solving pseudomonotone equilibrium problems in a real Hilbert space with applications. AIMS Mathematics, 2021, 6(2): 1538-1560. doi: 10.3934/math.2021093 |
It is known that variational inequality, as a very important tool, has already been studied for a wide class of unilateral, obstacle, and equilibrium problems arising in several branches of pure and applied sciences in a unified and general framework. Many numerical methods have been developed for solving variational inequalities and some related optimization problems; see [1,2,3,4,5,6] and the references therein.
Let H be a real Hilbert space whose inner product and norm are denoted by ⟨⋅,⋅⟩ and ‖⋅‖, respectively. Let C be a nonempty, closed and convex subset of H and A:C→H be a nonlinear mapping. The variational inequality problem (VIP) associated with the set C and the mapping A is stated as follows:
findx∗∈Csuch that⟨Ax∗,x−x∗⟩≥0,∀x∈C. | (1.1) |
In particular, the VIP(1.1) in the case C is the set Fix(T) of fixed points of a nonexpansive self-mapping T of C and A is of the form A=I−S, with S another nonexpansive self-mapping of C. In other words, VIP is of the form
findx∗∈Fix(T)such that⟨x∗−Sx∗,x−x∗⟩≥0,∀x∈Fix(T). | (1.2) |
This problem, introduced by Mainge and Moudafi [8], is called hierarchical fixed point problem (HFPP).
Subsequently, Moudafi and Mainge [7] studied the explicit scheme for computing a solution of VIP(1.2) by introducing the following iterative algorithm:
xn+1=λnf(xn)+(1−λn)(αnSxn+(1−αn)Txn), | (1.3) |
where f:C→C and {αn},{λn}⊂(0,1). They also proved the strong convergence of the sequence {xn} generalized by (1.3) to a solution of VIP(1.2).
Yao et al. [9] introduced and analyzed the following two-step iterative algorithm that generates a sequence {xn} by the following explicit scheme:
{yn=βnSxn+(1−βn)xn,xn+1=αnf(xn)+(1−αn)Tyn,n≥1. | (1.4) |
Under appropriate conditions, the above iterative sequence {xn} converges strongly to some fixed point of T where T is nonexpansive mapping and {xn} is solves VIP(1.2).
Marino et al. [10] introduced a multistep iterative method that generalizes the two-step method studied in [9] from two nonexpansive mappings to a finite family of nonexpansive mappings that generates a sequence {xn} by the following iterative scheme:
{F(un,y)+h(un,y)+1rn⟨y−un,un−xn⟩,∀y∈C,yn,1=βn,1S1un+(1−βn,1)un,yn,i=βn,iSiun+(1−βn,i)yn,i−1,i=2,…,N,xn+1=αnf(xn)+(1−αn)Tyn,N],n≥1. | (1.5) |
They prove that strong convergence of the method to a common fixed point of a finite number of nonexpansive mappings that also solves a suitable equilibrium problem.
On the other hand, by combining the regularization method, the hybrid steepest descent method, and the projection method, Ceng et al. [11] proposed an iterative algorithm that generates a sequence via the explicit scheme and proved that this sequence converges strongly to a unique solution of the following problem.
Problem 1.1 Let F:C→H be k-Lipschitzian and η-strongly monotone on the nonempty, closed and convex subset C of H, where k and η are positive constants, that is,
‖Fx−Fy‖≤k‖x−y‖and⟨Fx−Fy,x−y⟩≥η‖x−y‖2,∀x,y∈C. | (1.6) |
Let f:C→H be a ρ-contraction with a coefficient ρ∈[0,1) and S,T:C→C be two nonexpansive mappings with Fix(T)≠∅. Let 0<μ<2ηk2 and 0<γ≤τ, where τ=1−√1−μ(2η−μk2). Consider the following triple hierarchical variational inequality problem (THVI): find x∗∈Ξ such that
⟨(μF−γf)x∗,x−x∗⟩≥0,∀x∈Ξ, | (1.7) |
where Ξ denotes the solution set of the following hierarchical variational inequality problem (HVIP): find z∗∈Fix(T) such that
⟨(μF−γS)z∗,z−z∗⟩≥0,∀z∈Fix(T), | (1.8) |
where the solution set Ξ is assumed to be nonempty.
Since Problem 1.1 has a triple hierarchical structure, in contrast to bilevel programming problems [12,13], that is, a variational inequality problem with a variational inequality constraint over the fixed point set Fix(T), we also call (1.8) a triple hierarchical variational inequality problem (THVIP), which is a generalization of the triple hierarchical constrained optimization problem (THCOP) considered by [14,15].
Recently, many authors introduced the split monotone variational inequality inclusion problem, which is the core of the modeling of many inverse problems arising in phase retrieval and other real-world problems. It has been widely studied in sensor networks, intensity-modulated radiation therapy treatment planning, data compression, and computerized tomography in recent years; see, e.g., [18,19,21,26,27] and the references therein.
The split monotone variational inclusion problem (SMVIP) was first introduced by Moudafi [20] as follows: find x∗∈H1 such that
{0∈f1x∗+B1x∗,y∗=Ax∗∈H2:0∈f2y∗+B2y∗, | (1.9) |
where f1:H1→H1 and f2:H2→H2 are two given single-valued mappings, A:H1→H2 is a bounded linear operator, and B1:H1→2H1 and B2:H2→2H2 are multivalued maximal monotone mappings.
If f1=f2≡0, then (1.9) reduces to the following split variational inclusion problem (SVIP): find x∗∈H1 such that
{0∈B1x∗,y∗=Ax∗∈H2:0∈B2y∗. | (1.10) |
Additionally, if f1≡0, then (1.9) reduces to the following split monotone variational inclusion problem (SMVIP): find x∗∈H1 such that
{0∈B1x∗,y∗=Ax∗∈H2:0∈fy∗+B2y∗. | (1.11) |
We denote the solution sets of variational inclusion 0∈B1x∗ and 0∈fy∗+B2y∗ by SOLVIP(B1) and SOLVIP(f+B2), respectively. Thus, the solution set of (1.11) can denoted by Γ={x∗∈H1:x∗∈SOLVIP(B1),Ax∗∈SOLVIP(f+B2)}.
In 2012, Byrne et al. [21] studied the following iterative scheme for SVIP(1.10): for a given x0∈H1 and λ>0,
xn+1=JB1λ[xn+ϵA∗(JB2λ−I)Axn]. | (1.12) |
In 2014, Kazmi and Rizvi [22] introduced a new iterative scheme for SVIP(1.10) and the fixed point problem of a nonexpansive mapping:
{un=JB1λ[xn+ϵA∗(JB2λ−I)Axn],xn+1=αnf(xn)+(1−αn)Tun, | (1.13) |
where A is a bounded linear operator, A∗ is the adjoint of A, f is a contraction on H1, and T is a nonexpansive mapping of H1. They obtained a strong convergence theorem under some mild restrictions on the parameters.
Jitsupa et al. [1] modified algorithm (1.13) for SVIP(1.10) and the fixed point problem of a family of strict pseudo-contractions:
{un=JB1λ[xn+γA∗(JB2λ−I)Axn],yn=βnun+(1−βn)∞∑n=1η(n)iTiun,xn+1=αnτf(xn)+(I−αnD)yn,n≥1, | (1.14) |
where A is a bounded linear operator, A∗ is the adjoint of A, {Ti}Ni=1 is a family of ki-strictly pseudo-contractions, f is a contraction, and D is a strong positive linear bounded operator. In [1], they prove under certain appropriate assumptions on the sequences {αn},{βn} and {η(n)i}Ni=1 that {xn}, defined by (1.14), converges strongly to a common solution of SVIP(1.10) and a fixed point of a finite family of ki-strictly pseudo-contractions, which solve a variational inequality problem (1.1).
In this paper, we consider the following system of variational inequalities defined over a set consisting of the set of solutions of split monotone variational inclusion, the set of common fixed points of nonexpansive mappings, and the set of fixed points of a mapping.
Problem 1.2 Let F:C→H be k-Lipschitzian and η-strongly monotone on the nonempty closed and convex subset C of H, ψ:C→H be a ρ-contraction with coefficient ρ∈[0,1) and Si,S,T:C→C be nonexpansive mappings for all i∈{1,…,N}. Let 0<μ<2ηk2 and 0<ξ≤τ, where τ=1−√1−μ(2η−μk2). Then, the objective is to find x∗∈Ω such that
{⟨(μF−ξψ)x∗,x−x∗⟩≥0,∀x∈Ω,⟨(μF−ξS)x∗,y−x∗⟩≥0,∀y∈Ω, | (1.15) |
where Ω=Fix(T)∩(⋂iFix(Si))∩Γ≠∅.
Motivated and inspired by the Moudafi and Mainge [7], Marino et al. [10], Ceng et al. [11] and Kazmi and Rizvi [22], in this paper, we consider a multistep which difference from (1.5). It is proven that under appropriate assumptions the proposed iterative method, the sequence {xn} converges strongly to a unique solution to Problem 1.2 and which is solve THVI(1.7). Finally, we give some example and numerical results to illustrate our main results.
In this section, we collect some notations and lemmas. Let C be a nonempty closed convex subset of a real Hilbert space H. We denote the strong convergence and the weak convergence of the sequence {xn} to a point x∈H by xn→x and xn⇀x, respectively. It is also well known [24] that the Hilbert space H satisfies Opail′scondition, that is, for any sequence {xn} with xn⇀x, the inequality
lim supn→∞‖xn−x‖<lim supn→∞‖xn−y‖ | (2.1) |
holds for every y∈H with y≠x.
In the sequel, given a sequence {zn}, we denote with ωw(zn) the set of cluster points of {zn} with respect to the weak topology, that is,
ωw(zn)={z∈H:there existsnk→∞for whichznk⇀z}. |
Analogously, we denote by ωs(zn) the set of cluster points of {zn} with respect to the norm topology, that is,
ωs(zn)={z∈H:there existsnk→∞for whichznk→z}. |
Lemma 2.1. In a real Hilbert space H, the following inequalities hold:
(1) ‖x−y‖2=‖x‖2−‖y‖2−2⟨x−y,y⟩,∀x,y∈H;
(2) ‖x+y‖2≤‖x‖2+2⟨y,x+y⟩,∀x,y∈H;
(3) ‖λx+(1−λ)y‖2=λ‖x‖2+(1−λ)‖y‖2−λ(1−λ)‖x−y‖2,∀λ∈[0,1],∀x,y∈H;
An element x∈C is called a fixedpoint of S if x∈Sx. The set of all fixed point of S is denoted by Fix(S), that is, Fix(S)={x∈C:x∈Sx}.
Recall the following definitions. Moreover, S:H1→H1 is called
(1) a nonexpansive mapping if
‖Sx−Sy‖≤‖x−y‖,∀x,y∈H1. | (2.2) |
A nonexpansive mapping with k=1 can be strengthened to a firmly nonexpansive mapping in H1 if the following holds:
‖Sx−Sy‖2≤⟨x−y,Sx−Sy⟩,∀x,y∈H1. | (2.3) |
We note that every nonexpansive operator S:H1→H1 satisfies, for all (x,y)∈H1×H1, the inequality
⟨(x−Sx)−(y−Sy),Sy−Sx)⟩≤12‖(Sx−x)−(Sy−y)‖2, | (2.4) |
and therefore, we obtain, for all (x,y)∈H1×Fix(S),
⟨x−Sx,y−Sx⟩≤12‖Sx−x‖2 | (2.5) |
(see, e.g., Theorem 3 in [16] and Theorem 1 in [17]).
(2) a contractive if there exists a constant α∈(0,1) such that
‖Sx−Sy‖≤α‖x−y‖,∀x,y∈H1. | (2.6) |
(3) an L-Lipschitzian if there exists a positive constant L such that
‖Sx−Sy‖≤L‖x−y‖,∀x,y∈H1. | (2.7) |
(4) an η-strongly monotone if there exists a positive constant η such that
⟨Sx−Sy,x−y⟩≥η‖x−y‖2,∀x,y∈H1. | (2.8) |
(5) an β-inverse strongly monotone (β−ism) if there exists a positive constant β such that
⟨Sx−Sy,x−y⟩≥β‖Sx−Sy‖2,∀x,y∈H1. | (2.9) |
(6) averaged if it can be expressed as the average of the identity mapping and a nonexpansive mapping, i.e.,
S:=(1−α)I+αT, | (2.10) |
where α∈(0,1),I is the identity operator on H1 and T:H1→H1 is nonexpansive.
It is easily seen that averaged mappings are nonexpansive. In the meantime, firmly nonexpansive mappings are averaged.
(7) A linear operator D is said to be a strongly positive bounded linear operator on H1 if there exists a positive constant ˉτ>0 such that
⟨Dx,x⟩≥ˉτ‖x‖2,∀x∈H1. | (2.11) |
From the definition above, we easily find that a strongly positive bounded linear operator D is ˉτ-strongly monotone and ‖D‖-Lipschitzian.
(8) A multivalued mapping M:D(M)⊆H1→2H1 is called monotone if for all x,y∈D(M),u∈Mx and v∈My,
⟨x−y,u−v⟩≥0. | (2.12) |
A monotone mapping M is maximal if the Graph(M) is not properly contained in the graph of any other monotone mapping. It is well known that a monotone mapping M is maximal if and only if for x∈D(M),u∈H1,⟨x−y,u−v⟩≥0 for each (y,v)∈Graph(M), u∈Mx.
(9) Let M:D(M)⊆H1→2H1 be a multivalued maximal monotone mapping. Then, the resolvent operator JMλ:H1→D(M) is defined by
JMλx:=(I+λM)−1(x),∀x∈H1, | (2.13) |
for ∀λ>0, where I stands for the identity operator on H1. We observe that JMλ is single-valued, nonexpansive, and firmly nonexpansive.
We recall some concepts and results that are needed in the sequel. A mapping PC is said to be a metric projection of H1 onto C if for every point x∈H1, there exists a unique nearest point in C denoted by PCx such that
‖x−PCx‖≤‖x−y‖,∀y∈C. | (2.14) |
It is well known that PC is a nonexpansive mapping and is characterized by the following property:
‖PCx−PCy‖2≤⟨x−y,PCx−PCy⟩,∀x,y∈H1. | (2.15) |
Moreover, PCx is characterized by the following properties:
⟨x−PCx,y−PCx⟩≤0,∀x∈H1,y∈C, | (2.16) |
‖x−y‖2≥‖x−PCx‖2+‖y−PCx‖2,∀x∈H1,y∈C, | (2.17) |
and
‖(x−y)−(PCx−PCy)‖2≥‖x−y‖2−‖PCx−PCy‖2,∀x,y∈H1. | (2.18) |
Proposition 2.2. [20]
(1) If T=(1−α)S+αV, where S:H1→H1 is averaged, V:H1→H1 is nonexpansive, and if α∈[0,1], then T is averaged.
(2) The composite of finitely many averaged mappings is averaged.
(3) If the mappings {Ti}Ni=1 are averaged and have a nonempty common fixed point, then
N⋂i=1F(Ti)=F(T1∘T2∘…∘TN). | (2.19) |
(4) If T is a v−ism, then for γ>0,γT is a vγ−ism.
(5) T is averaged if and only if its complement I−T is a v−ism for some v>12.
Proposition 2.3. [20] Let λ>0,h be an α−ism operator, and B be a maximal monotone operator. If λ∈(0,2α), then it is easy to see that the operator JBλ(I−λh) is averaged.
Proposition 2.4. [20] Let λ>0 and B1 be a maximal monotone operator. Then,
x∗solves(1.9)⇔x∗=JB1λ(I−λf1)x∗andAx∗=JB2λ(I−λf2)Ax∗. | (2.20) |
Lemma 2.5. [23] Let {sn} be a sequence of nonnegative numbers satisfying the condition
sn+1≤(1−γn)sn+γnδn,n≥1, |
where {γn},{δn} are the sequences of real numbers such that
(i) {γn}⊂[0,1] and ∞∑n=1γn=∞, or equivalently,
∞Πn=1(1−γn):=limn→∞∞Πk=1(1−γk)=0; |
(ii) lim supn→∞δn≤0, or
(iii) ∞∑n=1γnδn is convergent.
Then, limn→∞sn=0.
Lemma 2.6. [23] Let λ be a number (0,1], and let μ>0. Let F:C→H be an operator on C such that for some constant k,η>0,F is k-Lipschitzian and η-strongly monotone. Associating with a nonexpansive mapping T:C→C, we define the following the mapping Tλ:C→H by
Tλx:=Tx−λμF(Tx),∀x∈C. | (2.21) |
Then, Tλ is a contraction provided μ<2ηk2, that is,
‖Tλx−Tλy‖≤(1−λτ)‖x−y‖,∀x,y∈C, | (2.22) |
where τ=1−√1−μ(2η−μk2)∈(0,1].
Lemma 2.7. [25] Let {αn} be a sequence of nonnegative real numbers with lim supn→∞αn<∞ and {βn} be a sequence of real numbers with lim supn→∞βn≤0. Then, lim supn→∞αnβn≤0.
Lemma 2.8. [28] Assume that T is nonexpansive self-mapping of a closed convex subset C of a Hilbert space H1. If T has a fixed point, then I−T is demiclosed, i.e., whenever {xn} weakly converges to some x and {(I−T)xn} converges strongly to y, it follows that (I−T)x=y. Here, I is the identity mapping on H1.
Theorem 3.1. Let C be a nonempty closed convex subset of a real Hilbert space H1 and Q be a nonempty closed convex subset of a real Hilbert space H2. Let A:H1→H2 be a bounded linear operator, A∗ be the adjoint of A, and r be the spectral radius of the operator A∗A. Let f:H2→H2 be a ς-inverse strongly monotone operator, B1:C→2H1,B2:H2→2H2 be two multivalued maximal monotone operators, and F:C→H1 be k-Lipschitzian and η-strongly monotone. Let ψ:C→H1 be a ρ-contraction with a coefficient ρ∈[0,1) and Si,S,T:C→C be nonexpansive mappings for all i∈{1,…,N}. Let {λn},{αn},{βn,i},i=1,…,N be sequences in (0,1) such that βn,i→βi∈(0,1) as n→∞ for all i∈{1,…,N}, 0<μ<2ηk2 and 0<ξ≤τ, where τ=1−√1−μ(2η−μk2). Then, the sequence {xn} is generated from an arbitrary initial point x1∈C by the following:
{un=JB1λ1[xn+γA∗(JB2λ2(I−λ2f)−I)Axn],yn,1=βn,1S1un+(1−βn,1)un,yn,i=βn,iSiun+(1−βn,i)yn,i−1,i=2,…,N,xn+1=PC[λnξ(αnψ(xn)+(1−αn)Sxn)+(I−λnμF)Tyn,N],n≥1. | (3.1) |
Assume that Problem 1.2 has a solution. Suppose that the following conditions are satisfied:
(C1) 0<lim infn→∞αn≤lim supn→∞αn<1;
(C2) limn→∞λn=0 and ∞∑n=1λn=∞;
(C3) ∞∑n=2|αnλn−αn−1λn−1|<∞ or limn→∞|αnλn−αn−1λn−1|λn=0;
(C4) ∞∑n=2|λn−λn−1|<∞ or limn→∞|λn−λn−1|λn=0;
(C5) ∞∑n=2|βn,i−βn−1,i|<∞ or limn→∞|βn,i−βn−1,i|λn=0 for all i∈{1,…,N};
(C6) λ1>0,0<λ2<2ς,0<γ<1r.
Then, {xn} converges strongly to a unique solution x∗∈Ω of Problem 1.2.
Proof. Let {xn} be a sequence generated by scheme (4.1). First, note that 0<ξ≤τ and
μη≥τ⇔μη≥1−√1−μ(2η−μk2)⇔√1−μ(2η−μk2)≥1−μη⇔1−2μη+μ2k2≥1−2μη+μ2η2⇔k2≥η2⇔k≥η. |
Then, it follows from the ρ-contractiveness of ψ that
⟨(μF−ξψ)x−(μF−ξψ)y,x−y⟩≥(μη−ξρ)‖x−y‖2,∀x,y∈C. |
Hence, from ξρ<ξ≤τ≤μη, we deduce that μF−ξψ is (μη−ξρ)-strongly monotone. Since it is clear that μF−ξψ is Lipshitz continuous, there exists a unique solution to the VIP:
findx∗∈Ωsuch that⟨(μF−ξψ)x∗,x−x∗⟩≥0,∀x∈Ω. |
Additionally, since Problem 1.2 has a solution, it is easy to see that Problem 1.2 has a unique solution. In addition, taking into account condition (C1), without loss of generality, we may assume that {αn}⊂[a,b] for some a,b∈(0,1).
Let U:=JB2λ2(I−λ2f); the iterative scheme (4.1) can be rewritten as
{un=JB1λ1[xn+γA∗(U−I)Axn],yn,1=βn,1S1un+(1−βn,1)un,yn,i=βn,iSiun+(1−βn,i)yn,i−1,i=2,…,N,xn+1=PC[λnξ(αnψ(xn)+(1−αn)Sxn)+(I−λnμF)Tyn,N],n≥1. | (3.2) |
The rest of the proof is divided into several steps.
Step 1. We show that the sequences {xn},{yn,i} for all i,{un} are bounded.
Indeed, take a point p∈Ω arbitrarily. Then, JB1λ1p=p,U(Ap)=Ap, and it is easily seen that Wp=p, where W:=I+γA∗(U−I)A. From the definition of firm nonexpansion and Proposition 2.3, we have that JB1λ1 and U are averaged. Likewise, W is also averaged because it is a vr−ism for some v>12. Actually, by Proposition 2.2 (5), we know that I−U is a v−ism with v>12. Hence, we have
⟨A∗(I−U)Ax−A∗(I−U)Ay,x−y⟩=⟨(I−U)Ax−(I−U)Ay,Ax−Ay⟩≥v‖(I−U)Ax−(I−U)Ay‖2≥vr‖A∗(I−U)Ax−A∗(I−U)Ay‖2. |
Thus, γA∗(I−U)A is a vγr−ism. Due to the condition 0<γ<1r, the complement I−γA∗(I−U)A is averaged, as well as M:=JB1λ1[I+γA∗(U−I)A]. Therefore, JB1λ1,U,W, and M are nonexpansive mappings.
From (3.2), we estimate
‖un−p‖2=‖JB1λ1[xn+γA∗(U−I)Axn]−JB1λ1p‖2≤‖xn+γA∗(U−I)Axn−p‖2=‖xn−p‖2+γ2‖A∗(U−I)Axn‖2+2γ⟨xn−p,A∗(U−I)Axn⟩. | (3.3) |
Thus, we obtain
‖un−p‖2≤‖xn−p‖2+γ2⟨(U−I)Axn,AA∗(U−I)Axn⟩+2γ⟨xn−p,A∗(U−I)Axn⟩. | (3.4) |
Next, setting ϑ1:=γ2⟨(U−I)Axn,AA∗(U−I)Axn⟩, we estimate
ϑ1=γ2⟨(U−I)Axn,AA∗(U−I)Axn⟩≤rγ2⟨(U−I)Axn,(U−I)Axn⟩=rγ2‖(U−I)Axn‖2. | (3.5) |
Setting ϑ2:=2γ⟨xn−p,A∗(U−I)Axn⟩, we obtain from (2.5) the following:
ϑ2=2γ⟨xn−p,A∗(U−I)Axn⟩=2γ⟨A(xn−p),(U−I)Axn⟩=2γ⟨A(xn−p)+(U−I)Axn−(U−I)Axn,(U−I)Axn⟩=2γ(⟨UAxn−Ap,(U−I)Axn⟩−‖(U−I)Axn‖2)≤2γ(12‖(U−I)Axn‖2−‖(U−I)Axn‖2)≤−γ‖(U−I)Axn‖2. | (3.6) |
In view of (3.4)-(3.6), we have
‖un−p‖2≤‖xn−p‖2+γ(rγ−1)‖(U−I)Axn‖2. | (3.7) |
From 0<γ<1r, we obtain
‖un−p‖≤‖xn−p‖. | (3.8) |
Thus, we have from (3.2) and (3.8) that
‖yn,1−p‖≤βn,1‖S1un−p‖+(1−βn,1)‖un−p‖≤‖un−p‖≤‖xn−p‖. | (3.9) |
For all i from i=2 to i=N, by induction, one proves that
‖yn,i−p‖≤βn,i‖un−p‖+(1−βn,i)‖yn,i−1−p‖≤‖un−p‖≤‖xn−p‖. | (3.10) |
Hence, we obtain that for all i∈{1,…,N},
‖yn,i−p‖≤‖un−p‖≤‖xn−p‖. | (3.11) |
In addition, utilizing Lemma 2.6 and (3.2), we have
‖xn+1−p‖=‖PC[λnξ(αnψ(xn)+(1−αn)Sxn)+(I−λnμF)Tyn,N]−PCp‖≤‖λnξ(αnψ(xn)+(1−αn)Sxn)+(I−λnμF)Tyn,N−p‖=‖λnξ(αnψ(xn)+(1−αn)Sxn)−λnμFTp+(I−λnμF)Tyn,N−(I−λnμF)Tp‖≤‖λnξ(αnψ(xn)+(1−αn)Sxn)−λnμFTp‖+‖(I−λnμF)Tyn,N−(I−λnμF)Tp‖=λn‖αn(ξψ(xn)−μFp)+(1−αn)(ξSxn−μFp)‖+‖(I−λnμF)Tyn,N−(I−λnμF)Tp‖≤λn[αn‖ξψ(xn)−μFp‖+(1−αn)‖ξSxn−μFp‖]+(1−λnτ)‖yn,N−p‖≤λn[αn(‖ξψ(xn)−ξψ(p)‖+‖ξψ(p)−μFp‖)+(1−αn)(‖ξSxn−ξSp‖+‖ξSp−μFp‖)]+(1−λnτ)‖yn,N−p‖≤λn[αnξρ‖xn−p‖+αn‖ξψ(p)−μFp‖+(1−αn)ξ‖xn−p‖+(1−αn)‖ξSp−μFp‖]+(1−λnτ)‖xn−p‖≤λn[ξ(1−αn(1−ρ))‖xn−p‖+max{‖ξψ(p)−μFp‖,‖ξSp−μFp‖}]+(1−λnτ)‖xn−p‖≤(1−λnξαn(1−ρ))‖xn−p‖+λnmax{‖ξψ(p)−μFp‖,‖ξSp−μFp‖}≤(1−λnξa(1−ρ))‖xn−p‖+λnmax{‖ξψ(p)−μFp‖,‖ξSp−μFp‖}, | (3.12) |
due to 0<ξ≤τ. Thus, calling
M=max{‖x1−p‖,‖ξψ(p)−μFp‖ξa(1−ρ),‖ξSp−μFp‖ξa(1−ρ)}, |
by induction, we derive ‖xn−p‖≤M for all n≥1. We thus obtain the claim.
Step 2. We show that limn→∞‖xn+1−xn‖=0.
Indeed, for each n≥1, we set
zn=λnξ(αnψ(xn)+(1−αn)Sxn)+(I−λnμF)Tyn,N. |
Then, we observe that
zn−zn−1=αnλnξ[ψ(xn)−ψ(xn−1)]+λn(1−αn)ξ(Sxn−Sxn−1)+[(I−λnμF)Tyn,N−(I−λnμF)Tyn−1,N]+(αnλn−αn−1λn−1)ξ[ψ(xn−1)−Sxn−1]+(λn−λn−1)(ξSxn−1−μFTyn−1,N). | (3.13) |
Let M0>0 be a constant such that
supn≥1{ξ‖ψ(xn)−Sxn‖+‖ξSxn−μFTyn,N‖}≤M0. |
It follows from (3.2) and (3.13) that
‖xn+1−xn‖=‖PCzn−PCzn−1‖≤‖zn−zn−1‖≤αnλnξ‖ψ(xn)−ψ(xn−1)‖+λn(1−αn)ξ‖Sxn−Sxn−1‖+‖(I−λnμF)Tyn,N−(I−λnμF)Tyn−1,N‖+|αnλn−αn−1λn−1|ξ‖ψ(xn−1)−Sxn−1‖+|λn−λn−1|‖ξSxn−1−μFTyn−1,N‖≤αnλnξρ‖xn−xn−1‖+λn(1−αn)ξ‖xn−xn−1‖+(1−λnτ)‖yn,N−yn−1,N‖+|αnλn−αn−1λn−1|M0+|λn−λn−1|M0=λn(1−αn(1−ρ))ξ‖xn−xn−1‖+(1−λnτ)‖yn,N−yn−1,N‖+[|αnλn−αn−1λn−1|+|λn−λn−1|]M0≤λnξ(1−a(1−ρ))‖xn−xn−1‖+(1−λnτ)‖yn,N−yn−1,N‖+[|αnλn−αn−1λn−1|+|λn−λn−1|]M0. | (3.14) |
By the definition of yn,i, we obtain that for all i=N,…,2,
‖yn,i−yn−1,i‖≤βn,i‖un−un−1‖+‖Siun−1−yn−1,i−1‖|βn,i−βn−1,i|+(1−βn,i)‖yn,i−1−yn−1,i−1‖. | (3.15) |
In this case i=1, we have
‖yn,1−yn−1,1‖≤βn,1‖un−un−1‖+‖S1un−1−un−1‖|βn,1−βn−1,1|+(1−βn,1)‖un−un−1‖=‖un−un−1‖+‖S1un−1−un−1‖|βn,1−βn−1,1|. | (3.16) |
Substituting (3.16) in all (3.15)-type inequalities, we find that for i=2,…,N,
‖yn,i−yn−1,i‖≤ ‖un−un−1‖+N∑k=2‖Skun−1−yn−1,k−1‖|βn,k−βn−1,k|+‖S1un−1−un−1‖|βn,1−βn−1,1|. |
Thus, we conclude that
‖xn+1−xn‖≤λnξ(1−a(1−ρ))‖xn−xn−1‖+(1−λnτ)‖yn,N−yn−1,N‖+[|αnλn−αn−1λn−1|+|λn−λn−1||]M0≤λnξ(1−a(1−ρ))‖xn−xn−1‖+[|αnλn−αn−1λn−1|+|λn−λn−1|]M0+(1−λnτ)‖un−un−1‖+N∑k=2‖Skun−1−yn−1,k−1‖|βn,k−βn−1,k|+‖S1un−1−un−1‖|βn,1−βn−1,1|. | (3.17) |
Since JB1λ1[I+γA∗(U−I)A] is nonexpansive, we obtain
‖un−un−1‖=‖JB1λ1[I+γA∗(U−I)A]xn−JB1λ1[I+γA∗(U−I)A]xn−1‖≤‖xn−xn−1‖. | (3.18) |
Substituting (3.18) into (3.17), we have
‖xn+1−xn‖≤λnξ(1−a(1−ρ))‖xn−xn−1‖+[|αnλn−αn−1λn−1|+|λn−λn−1|]M0+(1−λnτ)‖xn−xn−1‖+N∑k=2‖Skun−1−yn−1,k−1‖|βn,k−βn−1,k|+‖S1un−1−un−1‖|βn,1−βn−1,1|. | (3.19) |
If we call M1:=max{M0,supn≥2,i=2,…,N‖Siun−1−yn−1,i−1‖,supn≥2‖S1un−1−un−1‖}, we have
‖xn+1−xn‖≤(1−λnξa(1−ρ))‖xn−xn−1‖+M1[|αnλn−αn−1λn−1|+|λn−λn−1|+N∑k=2|βn,k−βn−1,k|], | (3.20) |
due to 0<ξ<τ. By condition (C2)−(C5) and Lemma 2.5, we obtain that
limn→∞‖xn+1−xn‖=0. | (3.21) |
Step 3. We show that limn→∞‖xn−un‖=0.
From (3.2) and (3.7), we have
‖xn+1−p‖2≤‖λnξ(αnψ(xn)+(1−αn)Sxn)+(I−λnμF)Tyn,N−p‖2=‖λnξ(αnψ(xn)+(1−αn)Sxn)−λnμFTp+(I−λnμF)Tyn,N−(I−λnμF)Tp‖2≤{‖λnξ(αnψ(xn)+(1−αn)Sxn)−λnμFTp‖+‖(I−λnμF)Tyn,N−(I−λnμF)Tp‖}2≤{λn‖αn(ξψ(xn)−μFp)+(1−αn)(ξSxn−μFp)‖+(1−λnτ)‖yn,N−p‖}2≤λn1τ[αn‖ξψ(xn)−μFp‖+(1−αn)‖ξSxn−μFp‖]2+(1−λnτ)‖yn,N−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)‖un−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)[‖xn−p‖2+γ(rγ−1)‖(U−I)Axn‖2]=λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)‖xn−p‖2−γ(1−rγ)(1−λnτ)‖(U−I)Axn‖2, | (3.22) |
which implies that
(1−λnτ)γ(1−rγ)‖(U−I)Axn‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)‖xn−p‖2−‖xn+1−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+‖xn−p‖2−‖xn+1−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+‖xn+1−xn‖(‖xn−p‖+‖xn+1p‖). | (3.23) |
Since γ(1−rγ)>0,‖xn+1−xn‖→0,λn→0 as n→∞, and by the boundedness of {xn}, we conclude that
limn→∞‖(U−I)Axn‖=0. | (3.24) |
In addition, by the firm nonexpansion of JB1λ1,(3.3),(3.7), and γ∈(0,1r), we estimate
‖un−p‖2=‖JB1λ1[xn+γA∗(U−I)Axn]−JB1λ1p‖2≤⟨JB1λ1[xn+γA∗(U−I)Axn]−JB1λ1p,xn+γA∗(U−I)Axn−p⟩=⟨un−p,xn+γA∗(U−I)Axn−p⟩=12(‖un−p‖2+‖xn+γA∗(U−I)Axn−p‖2−‖(un−p)−[xn+γA∗(U−I)Axn−p]‖2)≤12[‖un−p‖2+‖xn−p‖2+γ(rγ−1)‖(U−I)Axn‖2−‖un−xn−γA∗(U−I)Axn‖2]≤12[‖un−p‖2+‖xn−p‖2−‖un−xn−γA∗(U−I)Axn‖2]=12[‖un−p‖2+‖xn−p‖2−‖un−xn‖2−γ2‖A∗(U−I)Axn‖2+2γ⟨un−xn,A∗(U−I)Axn⟩]≤12[‖un−p‖2+‖xn−p‖2−‖un−xn‖2+2γ⟨un−xn,A∗(U−I)Axn⟩]=12[‖un−p‖2+‖xn−p‖2−‖un−xn‖2+2γ⟨A(un−xn),(U−I)Axn⟩]≤12[‖un−p‖2+‖xn−p‖2−‖un−xn‖2+2γ‖A(un−xn)‖‖(U−I)Axn‖], |
and hence,
‖un−p‖2≤‖xn−p‖2−‖un−xn‖2+2γ‖A(un−xn)‖‖(U−I)Axn‖. | (3.25) |
In view of (3.22) and (3.25),
‖xn+1−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)‖un−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)[‖xn−p‖2−‖un−xn‖2+2γ‖A(un−xn)‖‖(U−I)Axn‖]=λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)‖xn−p‖2−(1−λnτ)‖un−xn‖2+2γ(1−λnτ)‖A(un−xn)‖‖(U−I)Axn‖, | (3.26) |
which implies that
(1−λnτ)‖un−xn‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)‖xn−p‖2+2γ(1−λnτ)‖A(un−xn)‖‖(U−I)Axn‖−‖xn+1−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+2γ(1−λnτ)‖A(un−xn)‖‖(U−I)Axn‖+‖xn−p‖2−‖xn+1−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+2γ(1−λnτ)‖A(un−xn)‖‖(U−I)Axn‖+‖xn+1−xn‖(‖xn−p‖+‖xn+1−p‖). | (3.27) |
Since ‖xn+1−xn‖→0,‖(U−I)Axn‖→0, and λn→0 as n→∞, and owing to the boundedness of {xn}, we conclude that
limn→∞‖xn−un‖=0. | (3.28) |
Step 4. We show that limn→∞‖Siun−un‖=0 for i∈{1,…,N}.
Take a point p∈Ω arbitrarily. When i=N, utilizing Lemma 2.8 and (3.2), we have
‖xn+1−p‖2≤‖λnξ(αnψ(xn)+(1−αn)Sxn)+(I−λnμF)Tyn,N−p‖2=‖λnξ(αnψ(xn)+(1−αn)Sxn)−λnμFTp+(I−λnμF)Tyn,N−(I−λnμF)Tp‖2≤{‖λnξ(αnψ(xn)+(1−αn)Sxn)−λnμFTp‖+‖(I−λnμF)Tyn,N−(I−λnμF)Tp‖}2≤{λn‖αn(ξψ(xn)−μFp)+(1−αn)(ξSxn−μFp)‖+(1−λnτ)‖yn,N−p‖}2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)‖yn,N−p‖2=λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)βn,N‖SNuN−p‖2+(1−λnτ)(1−βn,N)‖yn,N−1−p‖2−(1−λnτ)(1−βn,N)βn,N‖SNun−yn,N−1‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)‖un−p‖2−(1−λnτ)(1−βn,N)βn,N‖SNun−yn,N−1‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+‖xn−p‖2−(1−λnτ)(1−βn,N)βn,N‖SNun−yn,N−1‖2. | (3.29) |
Thus, we have
(1−λnτ)(1−βn,N)βn,N‖SNun−yn,N−1‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+‖xn−p‖2−‖xn+1−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+‖xn+1−xn‖(‖xn−p‖+‖xn+1−p‖). | (3.30) |
Since βn,N→βN∈(0,1),‖xn+1−xn‖→0 and λn→0 as n→∞, by the boundedness of {xn}, we conclude that
limn→∞‖SNun−yn,N−1‖=0. | (3.31) |
Take i∈{1,…,N−1} arbitrarily. Then, we obtain
‖xn+1−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)‖yn,N−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)[βn,N‖SNun−p‖2+(1−βn,N)‖yn,N−1−p‖2]≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)βn,N‖xn−p‖2+(1−λnτ)(1−βn,N)‖yn,N−1−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)βn,N‖xn−p‖2+(1−λnτ)(1−βn,N)[βn,N−1‖SN−1un−p‖2+(1−βn,N−1)‖yn,N−2−p‖2]≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)(βn,N+(1−βn,N)βn,N−1)‖xn−p‖2+(1−λnτ)N∏k=N−1(1−βn,k)‖yn,N−2−p‖2. | (3.32) |
Hence, after (N−i+1)-iterations,
‖xn+1−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)(βn,N+N∑j=i+2(N∏p=j(1−βn,p)βn,j−1)×‖xn−p‖2+(1−λnτ)N∏k=i+1(1−βn,k)‖yn,i−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)(βn,N+N∑j=i+2(N∏p=j(1−βn,p))βn,j−1)×‖xn−p‖2+(1−λnτ)N∏k=i+1(1−βn,k)×[βn,i‖Siun−p‖2+(1−βn,i)‖yn,i−1−p‖2−βn,i(1−βn,i)‖Siun−yn,i−1‖2]≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+(1−λnτ)‖xn−p‖2−βn,i(1−λnτ)N∏k=i(1−βn,k)‖Siun−yn,i−1‖2. | (3.33) |
Again, we obtain
βn,i(1−λnτ)N∏k=i(1−βn,k)‖Siun−yn,i−1‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+‖xn−p‖2−‖xn+1−p‖2≤λn1τ[‖ξψ(xn)−μFp‖+‖ξSxn−μFp‖]2+‖xn+1−xn‖(‖xn−p‖+‖xn+1−p‖). | (3.34) |
Since for all k∈{1,…,N},βn,k→βk∈(0,1),‖xn+1−xn‖→0 and λn→0 as n→∞, by the boundedness of {xn}, we conclude that
limn→∞‖Siun−yn,i−1‖=0. | (3.35) |
Obviously, for i=1, we have limn→∞‖S1un−un‖=0. To conclude, we have that
‖S2un−un‖≤‖S2un−yn,1‖+‖yn,1−un‖=‖S2un−yn,1‖+βn,1‖S1un−un‖, | (3.36) |
which implies that limn→∞‖S2un−un‖=0. Consequently, by induction, we obtain
limn→∞‖Siun−un‖=0for alli=2,…,N. | (3.37) |
It is enough to observe that
‖Siun−un‖≤‖Siun−yn,i−1‖+‖yn,i−1−Si−1un‖+‖Si−1un−un‖≤‖Siun−yn,i−1‖+(1−βn,i−1)‖Si−1un−yn,i−2‖+‖Si−1un−un‖. | (3.38) |
Step 5. We show that limn→∞‖yn,N−xn‖=limn→∞‖xn−Txn‖=0 and ωw(xn)⊂Ω.
Indeed, since ‖xn−un‖→0 as n→∞, we have ωw(xn)=ωw(un) and ωs(xn)=ωs(un). Now, we observe that
‖xn−yn,1‖≤‖xn−un‖+‖yn,1−un‖=‖xn−un‖+βn,1‖S1un−un‖. | (3.39) |
By Step 4, ‖S1un−un‖→0 as n→∞. Hence, we obtain
limn→∞‖xn−yn,1‖=0. | (3.40) |
This implies that ωw(xn)=ωw(yn,1) and ωs(xn)=ωs(yn,1).
Take a point q∈ωw(xn) arbitrarily. Since q∈ωw(un), by Step 4 and the demiclosedness principle, we have q∈Fix(Si) for all i∈{1,…,N}, that is, q∈∩iFix(Si). Moreover, note that
‖yn,N−xn‖≤N∑k=2‖yn,k−yn,k−1‖+‖yn,1−xn‖=N∑k=2βn,k‖Skun−yn,k−1‖+‖yn,1−xn‖; | (3.41) |
hence,
‖xn−Txn‖≤‖xn−xn+1‖+‖xn+1−Tyn,N‖+‖Tyn,N−Txn‖≤‖xn−xn+1‖+‖λnξ(αnψ(xn)+(1−αn)Sxn)+(I−λnμF)Tyn,N−Tyn,N‖+‖yn,N−xn‖=‖xn−xn+1‖+λn‖αn(ξψ(xn)−μFTyn,N)+(1−αn)(ξSxn−μFTyn,N)‖+‖yn,N−xn‖≤‖xn−xn+1‖+λn[‖ξψ(xn)−μFTyn,N‖+‖ξSxn−μFTyn,N‖]+‖yn,N−xn‖≤‖xn−xn+1‖+λn[‖ξψ(xn)−μFTyn,N‖+‖ξSxn−μFTyn,N‖]+N∑k=2βn,k‖Skun−yn,k−1‖+‖yn,1−xn‖. | (3.42) |
Since ‖xn−xn+1‖→0,λn→0,‖yn,1−xn‖→0,βn,k→βk and ‖Skun−yn,k−1‖→0 for all k∈{1,…,N}, we obtain
limn→∞‖yn,N−xn‖=limn→∞‖xn−Txn‖=0. | (3.43) |
Thus, by the demiclosedness principle, we have q∈Fix(T).
In addition, we rewrite unk=JB1λ1[xnk+γA∗(U−I)Axnk] as
xnk−unk+γA∗(U−I)Axnkλ1∈B1unk. | (3.44) |
Taking k→∞ in (3.44) and using (3.24), (3.28) and the fact that the graph of a maximal monotone operator is weakly strongly closed, we have 0∈B1q, i.e., q∈SOLVIP(B1). Furthermore, since xn and un have the same asymptotical behavior, Axnk weakly converges to Aq. It follows from (3.24), the nonexpansion of U, and Lemma 2.8 that (I−U)Aq=0. Thus, by Proposition 2.4, we have 0∈f(Aq)+B2(Aq), i.e., Aq∈SOLVIP(B2). As a result, q∈Γ. This shows that q∈Ω. Therefore, we obtain the claim.
Step 6. We show that {xn} converges strongly to a unique solution x∗ to Problem 1.2.
Indeed, according to ‖xn+1−xn‖→0, we can take a subsequence {xnj} of {xn} satisfying
lim supn→∞⟨(ξψ−μF)x∗,xn+1−x∗⟩=lim supn→∞⟨(ξψ−μF)x∗,xn−x∗⟩=limj→∞⟨(ξψ−μF)x∗,xnj−x∗⟩. | (3.45) |
Without loss of generality, we may further assume that xnj⇀˜x; then, ˜x∈Ω, as we have just proved. Since x∗ is a solution to Problem 1.2, we obtain
lim supn→∞⟨(ξψ−μF)x∗,xn+1−x∗⟩=⟨(ξψ−μF)x∗,˜x−x∗⟩≤0. | (3.46) |
Repeating the same argument as that of (3.46), we have
lim supn→∞⟨(ξS−μF)x∗,xn+1−x∗⟩≤0. | (3.47) |
From (3.2) and (3.9), it follows (noticing that xn+1=PCzn and 0<ξ≤τ) that
‖xn+1−x∗‖2=⟨zn−x∗,xn+1−x∗⟩+⟨PCzn−zn,PCzn−x∗⟩≤⟨zn−x∗,xn+1−x∗⟩=⟨(I−λnμF)Tyn,N−(I−λnμF)x∗,xn+1−x∗⟩+αnλnξ⟨ψ(xn)−ψ(x∗),xn+1−x∗⟩+λn(1−αn)ξ⟨Sxn−Sx∗,xn+−x∗⟩+αnλn⟨(ξψ−μF)x∗,xn+1−x∗⟩+λn(1−αn)⟨(ξS−μF)x∗,xn+1−x∗⟩≤[1−λnτ+αnλnξρ+λn(1−αn)ξ]‖xn−x∗‖‖xn+1−x∗‖+αnλn⟨(ξψ−μF)x∗,xn+1−x∗⟩+λn(1−αn)⟨(ξS−μF)x∗,xn+1−x∗⟩≤[1−αnλnξ(1−ρ)]‖xn−x∗‖‖xn+1−x∗‖+αnλn⟨(ξψ−μF)x∗,xn+1−x∗⟩+λn(1−αn)⟨(ξS−μF)x∗,xn+1−x∗⟩≤[1−αnλnξ(1−ρ)]12(‖xn−x∗‖2+‖xn+1−x∗‖2)+αnλn⟨(ξψ−μF)x∗,xn+1−x∗⟩+λn(1−αn)⟨(ξS−μF)x∗,xn+1−x∗⟩. | (3.48) |
It turns out that
‖xn+1−x∗‖2≤1−αnλnξ(1−ρ)1+αnλnξ(1−ρ)‖xn−x∗‖2+21+αnλnξ(1−ρ)[αnλn⟨(ξψ−μF)x∗,xn+1−x∗⟩+λn(1−αn)⟨(ξS−μF)x∗,xn+1−x∗⟩]≤[1−αnλnξ(1−ρ)]‖xn−x∗‖2+21+αnλnξ(1−ρ)[αnλn⟨(ξψ−μF)x∗,xn+1−x∗⟩+λn(1−αn)⟨(ξS−μF)x∗,xn+1−x∗⟩]=[1−αnλnξ(1−ρ)]‖xn−x∗‖2+αnλnξ(1−ρ){2ξ(1−ρ)[1+αnλnξ(1−ρ)]×⟨(ξψ−μF)x∗,xn+1−x∗⟩+2(1−αn)αnξ(1−ρ)[1+αnλnξ(1−ρ)]⟨(ξS−μF)x∗,xn+1−x∗⟩}. | (3.49) |
Put sn=‖xn−x∗‖2,ξn=αnλnξ(1−ρ) and
δn=2ξ(1−ρ)[1+αnλnξ(1−ρ)]⟨(ξψ−μF)x∗,xn+1−x∗⟩+2(1−αn)αnξ(1−ρ)[1+αnλnξ(1−ρ)]⟨(ξS−μF)x∗,xn+1−x∗⟩. |
Then, (3.49) can be rewritten as
sn+1≤(1−γn)sn+ξnδn. |
From conditions (C1) and (C2), we conclude from 0<1−ρ≤1 that
{ξn}⊂[0,1]and∞∑n=1ξn=∞. |
Note that
2ξ(1−ρ)[1+αnλnξ(1−ρ)]≤2ξ(1−ρ) |
and
2(1−αn)αnξ(1−ρ)[1+αnλnξ(1−ρ)]≤2aξ(1−ρ). |
Consequently, utilizing Lemma 2.5, we find that
lim supn→∞δn≤lim supn→∞2ξ(1−ρ)[1+αnλnξ(1−ρ)]⟨(ξψ−μF)x∗,xn+1−x∗⟩+lim supn→∞2(1−αn)αnξ(1−ρ)[1+αnλnξ(1−ρ)]⟨(ξψ−μF)x∗,xn+1−x∗⟩≤0. |
Thus, this, together with Lemma 2.5, leads to limn→∞‖xn−x∗‖=0. The proof is complete.
In Theorem 3.1, if λ1=λ2=λ and f=0, the we obtain the following corollary immediately.
Corollary 3.2. Let C be a nonempty closed convex subset of a real Hilbert space H1 and Q be a nonempty closed convex subset of a real Hilbert space H2. Let A:H1→H2 be a bounded linear operator, A∗ be the adjoint of A, and r be the spectral radius of the operator A∗A. Let B1:C→2H1,B2:H2→2H2 be two multivalued maximal monotone operators, and F:C→H1 be k-Lipschitzian and η-strongly monotone. Let ψ:C→H1 be a ρ-contraction with a coefficient ρ∈[0,1) and Si,S,T:C→C be nonexpansive mappings for all i∈{1,…,N}. Let {λn},{αn},{βn,i},i=1,…,N be sequences in (0,1) such that βn,i→βi∈(0,1) as n→∞ for all i∈{1,…,N}, 0<μ<2ηk2 and 0<ξ≤τ, where τ=1−√1−μ(2η−μk2). Then, the sequence {xn} is generated from an arbitrary initial point x1∈C by the following:
{un=JB1λ[xn+γA∗(JB2λ−I)Axn],yn,1=βn,1S1un+(1−βn,1)un,yn,i=βn,iSiun+(1−βn,i)yn,i−1,i=2,…,N,xn+1=PC[λnξ(αnψ(xn)+(1−αn)Sxn)+(I−λnμF)Tyn,N],n≥1. | (3.50) |
Suppose that the following conditions are satisfied:
(C1) 0<lim infn→∞αn≤lim supn→∞αn<1;
(C2) limn→∞λn=0 and ∞∑n=1λn=∞;
(C3) ∞∑n=2|αnλn−αn−1λn−1|<∞ or limn→∞|αnλn−αn−1λn−1|λn=0;
(C4) ∞∑n=2|λn−λn−1|<∞ or limn→∞|λn−λn−1|λn=0;
(C5) ∞∑n=2|βn,i−βn−1,i|<∞ or limn→∞|βn,i−βn−1,i|λn=0 for all i∈{1,…,N};
(C6) 0<γ<1r.
Then, {xn} converges strongly to a unique solution x∗∈Fix(T)∩(⋂iFix(Si))∩SVIP.
Here as a numerical illustration, we consider a split common fixed points of a family of nonexpansive mappings, which is a particular case of problem 1.2. To that end, we have the following, which is an equivalent formulation of Theorem 3.1.
Let C be a nonempty closed convex subset of a real Hilbert space H1 and Q be a nonempty closed convex subset of a real Hilbert space H2. Let A:H1→H2 be a bounded linear operator, A∗ be the adjoint of A, and r be the spectral radius of the operator A∗A. Let f:H2→H2 be a ς-inverse strongly monotone operator, and F:C→H1 be k-Lipschitzian and η-strongly monotone. Let ψ:C→H1 be a ρ-contraction with a coefficient ρ∈[0,1) and Si,S,T:C→C be nonexpansive mappings for all i∈{1,…,N}. Let {λn},{αn},{βn,i},i=1,…,N be sequences in (0,1) such that βn,i→βi∈(0,1) as n→∞ for all i∈{1,…,N}, 0<μ<2ηk2 and 0<ξ≤τ, where τ=1−√1−μ(2η−μk2). Then, the sequence {xn} is generated from an arbitrary initial point x1∈C by the following:
{un=xn+γA∗(I−λ2f)Axn,yn,1=βn,1S1un+(1−βn,1)un,yn,i=βn,iSiun+(1−βn,i)yn,i−1,i=2,…,N,xn+1=PC[λnξ(αnψ(xn)+(1−αn)Sxn)+(I−λnμF)Tyn,N],n≥1. | (4.1) |
Assume that the problem
⟨(μF−ξψ)x∗,x−x∗⟩≥0,∀x∈Ω, | (4.2) |
has a solution. Suppose that the following conditions are satisfied:
(C1) 0<lim infn→∞αn≤lim supn→∞αn<1;
(C2) limn→∞λn=0 and ∞∑n=1λn=∞;
(C3) ∞∑n=2|αnλn−αn−1λn−1|<∞ or limn→∞|αnλn−αn−1λn−1|λn=0;
(C4) ∞∑n=2|λn−λn−1|<∞ or limn→∞|λn−λn−1|λn=0;
(C5) ∞∑n=2|βn,i−βn−1,i|<∞ or limn→∞|βn,i−βn−1,i|λn=0 for all i∈{1,…,N};
(C6) λ1>0,0<λ2<2ς,0<γ<1r.
Then, {xn} converges strongly to a unique solution x∗∈Ω of Problem (4.2). Suppose H=C=R, for each x∈R the mappings Si and Ti are defined as follows
Six=ii+1x |
and
Ti(x)={x,x∈(−∞,0),2x,x∈[0,∞). | (4.3) |
Observe that Si for i≥1 are nonexpansive and T is 13-demicontractive mapping [29]. Take βn,i=6n2i2,αn=3n2 and λn=1n2+2. Also define ψ(x)=2x3 and Ax=2x with ‖A‖=2. Therefore it can be seen that the sequences satisfy the conditions in the (C1) - (C6).
It can be observed from Figure 1, that the sequence {xn} generated converges to 0, which is the only element of the solution set, i.e Ω={0}.
In this paper, we first propose triple hierarchical variational inequality problem (4.1) in Theorem 3.1 and then we prove some strong convergence of the sequence {xn} generated by (4.1) to a common solution of variational inequality problem, split monotone variational inclusion problem and fixed point problems. We divide the proof into 6 steps and our theorem is extends and improves the corresponding results of Jitsupa et al. [1] and Kazmi and Rizvi [22].
The authors thank the referees for their comments and suggestions regarding this manuscript. The last author would like to thank King Mongkut's University of Technology North Bangkok, Rayong Campus (KMUTNB-Rayong). This research was funded by King Mongkut's University of Technology North Bangkok. Contract no. KMUTNB-63-KNOW-016.
The authors declare that they have no competing interests.
[1] |
J. Deepho, P. Thounthong, P. Kumam, et al. A new general iterative scheme for split variational inclusion and fixed point problems of k-strict pseudo-contraction mappings with convergence analysis, J. Comput. Appl. Math., 318 (2017), 293-306. doi: 10.1016/j.cam.2016.09.009
![]() |
[2] |
Y. Yao, Y. C. Liou, R. Chen, Convergence theorems for fixed point problems and variational inequality problems in Hilbert spaces, Math. Nachr., 282 (2009), 1827-1835. doi: 10.1002/mana.200610817
![]() |
[3] |
H. K. Xu, Viscosity approximation methods for nonexpansive mappings, J. Math. Anal. Appl., 298 (2004), 279-291. doi: 10.1016/j.jmaa.2004.04.059
![]() |
[4] |
Y. Yao, M. A. Noor, K. I. Noor, et al. Modified extragradient methods for a system of variational inequalities in Banach spaces, Acta Appl. Math., 110 (2010), 1211-1224. doi: 10.1007/s10440-009-9502-9
![]() |
[5] |
Y. Yao, S. Maruster, Strong convergence of an iterative algorithm for variational inequalities in Banach spaces, Math. Comput. Model., 54 (2011), 325-329. doi: 10.1016/j.mcm.2011.02.016
![]() |
[6] | T. Seangwattana, S. Plubtieng, T. Yuying, An extragradient method without monotonicty, Thai Journal of Mathematics, 18 (2020), 94-103. |
[7] | P. E. Mainge, A. Moudafi, Strong convergence of an iterative method for hierarchical fixed-points problems, Pac. J. Optim., 3 (2007), 529-538. |
[8] | A. Moudafi, P. E. Mainge, Towards viscosity approximations of hierarchical fixed-point problems, Fixed Point Theory Appl., 2006 (2006), 95453. |
[9] |
Y. Yao, Y. C. Liou, G. Marino, Two-step iterative algorithms for hierarchical fixed point problems and variational inequality problems, J. Appl. Math. Comput., 31 (2009), 433-445. doi: 10.1007/s12190-008-0222-5
![]() |
[10] |
G. Marino, L. Muglia, Y. Yao, Viscosity methods for common solutions of equilibrium and variational inequality problems via multi-step iterative algorithms and common fixed points, Nonlinear Anal., 75 (2012), 1787-1798. doi: 10.1016/j.na.2011.09.019
![]() |
[11] |
L. C. Ceng, Q. H. Ansari, J. C. Yao, Iterative methods for triple hierarchical variational inequalities in Hilbert spaces, J. Optim. Theory Appl., 151 (2011), 489-512. doi: 10.1007/s10957-011-9882-7
![]() |
[12] | Z. Q. Luo, J. S. Pang, D. Ralph, Mathematical Programs with Equilibrium Constraints, Cambridge University Press, New York, 1996. |
[13] | J. Outrata, M. Kocvara, J. Zowe, Nonsmooth Approach to Optimization Problems with Equilibrium Constraints, Kluwer Academic Press, Dordrecht, 1998. |
[14] |
H. Iiduka, Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem, Nonlinear Anal., 71 (2009), 1292-1297. doi: 10.1016/j.na.2009.01.133
![]() |
[15] |
H. Iiduka, Iterative algorithm for solving triple-hierarchical constrained optimization problem, J. Optim. Theory Appl., 148 (2011), 580-592. doi: 10.1007/s10957-010-9769-z
![]() |
[16] | T. Suzuki, Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces, Fixed Point Theory Appl., 2005 (2005), 685918. |
[17] |
K. Shimoji, W. Takahashi, Strong convergence to common fixed points of infinite nonexpansive mappings and applications, Taiwanese J. Math., 5 (2001), 387-404. doi: 10.11650/twjm/1500407345
![]() |
[18] |
Y. Censor, A. Gibali, S. Reich, Algorithms for the split variational inequality problem, Numer. Algorithms, 59 (2012), 301-323. doi: 10.1007/s11075-011-9490-5
![]() |
[19] |
P. L. Combettes, The convex feasibility problem in image recovery, Adv. Imaging Electron Phys., 95 (1996), 155-453. doi: 10.1016/S1076-5670(08)70157-5
![]() |
[20] |
A. Moudafi, Split monotone variational inclusions, J. Optim. Theory Appl., 150 (2011), 275-283. doi: 10.1007/s10957-011-9814-6
![]() |
[21] |
C. Byrne, Iterative oblique projection onto convex sets and the split feasibility problem, Inverse Probl., 18 (2002), 441-453. doi: 10.1088/0266-5611/18/2/310
![]() |
[22] |
K. R. Kazmi, S. H. Rizvi, An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping, Optim. Lett., 8 (2014), 1113-1124. doi: 10.1007/s11590-013-0629-2
![]() |
[23] | H. K. Xu, T. H. Kim, Convergence of hybrid steepest-descent methods for variational inequalities, J. Optim. Theory Appl., 119 (2013), 185-201. |
[24] |
Z. Opial, Weak convergence of the sequence of successive approximation for nonexpansive mappings, Bull. Am. Math. Soc., 73 (1967), 591-597. doi: 10.1090/S0002-9904-1967-11761-0
![]() |
[25] | L. C. Ceng, A. Petrusel, J. C. Yao, Strong convergence theorem of averaging iterations of nonexpansive nonself-mapping in Banach space, Fixed Point Theory., 8 (2007), 219-236. |
[26] |
Y. Censor, T. Elfving, A multiprojection algorithm using Bregman projections in a product space, Numer. Algorithms, 8 (1994), 221-239. doi: 10.1007/BF02142692
![]() |
[27] |
Y. Censor, T. Bortfeld, B. Martin, et al. A unified approach for inversion problems in intensitymodulated radiation therapy, Phys. Med. Biol., 51 (2006), 2353-2365. doi: 10.1088/0031-9155/51/10/001
![]() |
[28] | K. Geobel, W. A. Kirk, Topics in Metric Fixed Point Theory, Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, 1990. |
[29] |
C. E. Chidume, S. Maruster, Iterativemethods for the computation of fixed points of demicontractivemappings, J. Comput. Appl. Math., 234 (2010), 861-882. doi: 10.1016/j.cam.2010.01.050
![]() |
1. | Mohammad Akram, Mohammad Dilshad, Arvind Kumar Rajpoot, Feeroz Babu, Rais Ahmad, Jen-Chih Yao, Modified Iterative Schemes for a Fixed Point Problem and a Split Variational Inclusion Problem, 2022, 10, 2227-7390, 2098, 10.3390/math10122098 | |
2. | Imran Ali, Yuanheng Wang, Rais Ahmad, Three-Step Iterative Algorithm for the Extended Cayley–Yosida Inclusion Problem in 2-Uniformly Smooth Banach Spaces: Convergence and Stability Analysis, 2024, 12, 2227-7390, 1977, 10.3390/math12131977 | |
3. | Doaa Filali, Mohammad Dilshad, Lujain Saud Muaydhid Alyasi, Mohammad Akram, Inertial Iterative Algorithms for Split Variational Inclusion and Fixed Point Problems, 2023, 12, 2075-1680, 848, 10.3390/axioms12090848 |