Next Article in Journal
Modelling Biological Systems: A New Algorithm for the Inference of Boolean Networks
Next Article in Special Issue
Halpern-Subgradient Extragradient Method for Solving Equilibrium and Common Fixed Point Problems in Reflexive Banach Spaces
Previous Article in Journal
Smooth Break Detection and De-Trending in Unit Root Testing
Previous Article in Special Issue
On An Open Question in Controlled Rectangular b-Metric Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Cyclic Iterative Algorithm for Multiple-Sets Split Common Fixed Point Problem of Demicontractive Mappings without Prior Knowledge of Operator Norm

1
Department of Mathematics, Pt NRS Government College, Rohtak 124001, India
2
Department of General Education, China Medical University, Taichung 40402, Taiwan
3
Department of Interior Design, Asia University, Taichung 41354, Taiwan
4
Gh. Mihoc-C. Iacob Institute of Mathematical Statistics and Applied Mathematics, Romanian Academy, 050711 Bucharest, Romania
5
Department of Mathematics and Informatics, University “Politehnica” of Bucharest, 060042 Bucharest, Romania
6
Government College, Bhainswal Kalan 131001, India
7
Department of Mathematics, Maharshi Dayanand University, Rohtak 124001, India
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2021, 9(4), 372; https://doi.org/10.3390/math9040372
Submission received: 7 January 2021 / Revised: 29 January 2021 / Accepted: 10 February 2021 / Published: 13 February 2021
(This article belongs to the Special Issue Fixed Point, Optimization, and Applications)

Abstract

:
The aim of this paper is to formulate and analyze a cyclic iterative algorithm in real Hilbert spaces which converges strongly to a common solution of fixed point problem and multiple-sets split common fixed point problem involving demicontractive operators without prior knowledge of operator norm. Significance and range of applicability of our algorithm has been shown by solving the problem of multiple-sets split common null point, multiple-sets split feasibility, multiple-sets split variational inequality, multiple-sets split equilibrium and multiple-sets split monotone variational inclusion.

1. Introduction

In 1994, Censor et al. [1] firstly suggested the split feasibility problem (SFP) for modelling inverse problems. SFP requires one to identify a point in a non-empty closed and convex set in a space such that its image belongs to another non-empty closed and convex set in the image space under a bounded linear operator. Now, SFPs have been used in several areas such as image restoration [2,3], computer tomography [4], intensity modulated radiation therapy (IMRT) [4,5], signal processing [6] etc. Recently, various split type problems have been introduced by many authors (see [4,7,8,9,10,11,12,13]). For important results in this direction or in similar subjects, see [14,15,16,17,18,19,20,21,22,23,24].
Multiple-sets split feasibility problems (MSSFPs) were introduced by Censor et al. [4] in 2005, inspired by inverse problem of intensity modulated radiation therapy (IMRT). As a generalization of convex feasibility problem, split feasibility problem and multiple-sets split feasibility problem, split common fixed point problems (SCFPPs) were introduced by Censor and Segal [7], in 2009. The SCFPP requires one to identify a fixed point of an operator in a space such that its image is a fixed point of another operator in image space under a bounded linear operator. SCFPP has received much attention in recent years because it has many applications in different fields like image reconstruction, signal processing, intensity modulated radiation therapy (IMRT), modelling inverse problems, electron microscopy etc. (see [7,25]).
In this paper, we will find the common solution of the fixed point problem and multiple-sets split common fixed point problem for demicontractive operators which is stated as finding z * H 1 such that
z * i = 1 N Fix ( S i ) Fix ( U ) and A z * j = 1 M Fix ( T j ) ,
where N , M 1 are integers, S i : H 1 H 1 and T j : H 2 H 2 are two families of demicontractive operators with constants 0 η i < 1 and 0 μ j < 1 respectively for 1 i N and 1 j M . Additionally, A : H 1 H 2 is a bounded linear operator and U : H 1 H 1 is a demicontractive operator with constant 0 κ < 1 .
To find out the solution of SCFPP, Censor et al. [7] introduced the following iteration algorithm. For any x 1 H 1 , { x n } is defined by
x n + 1 = U ( x n ρ A * ( I T ) A x n ) ,
where T and U are directed operators, ρ ( 0 , 2 / | | A | | 2 ) , then sequence { x n } converges weakly to a solution of SCFPP. Subsequently, this result was extended by Moudafi [26] for demicontractive operators and obtained a weak convergence result.
However, one can observe that the iterative algorithm suggested by Censor [7] and Moudafi [26] needs to find the norm of bounded linear operator. In some cases however, it is impossible or becomes very difficult to compute A . So, alternate ways for adopting variable step-size have been considered to overcome this difficulty. In 2012, Lopez et al. [27] firstly introduced the self adaptive method for solving SFP to select the step size which do not require prior knowledge of operator norm.
In 2015, Shehu and Cholamjiak [28] extended the result of Censor and Segal [7] for demi-contractive operators and obtain the strong convergence result but the step size still depends on operator norm. To overcome this problem, Jirakitpuwapat et al. [25], in 2019, introduced the new iterative method to solve SCFPP without prior knowledge of operator norm and obtained a strong convergence result.
In this paper, inspired and motivated by above work, we present a new cyclic iterative scheme without prior knowledge of operator norm and prove its strong convergence for approximating a common solution of fixed point problem and multiple-sets split common fixed point problem for demicontractive operators in real Hilbert spaces. Moreover, we extend and improve many results related to various split type problems.

2. Preliminaries

In this paper, H is assumed to be a Hilbert space with inner product · , · and the norm · . Fix ( S ) represents the set of all fixed points of mapping S. We will use the notations x n x and x n x to represent strong and weak convergence of { x n } to x respectively. Additionally, we use ω w ( x n ) = { x : there exists x n k x } to represent weak ω -limit set of { x n } .
Definition 1.
Let S : H H be an operator. Then S is called
1. 
Nonexpansive if
S v S w v w for all v , w H .
2. 
Contraction if there exists a constant γ [ 0 , 1 ) such that
S v S w γ v w for all v , w H .
3. 
α- inverse strongly monotone (ism) if there exists α > 0 such that
S v S w , v w α S v S w 2 for all v , w H .
4. 
τ-demicontractive if F i x ( S ) ϕ and there exists τ [ 0 , 1 ) such that
S v w 2 v w 2 + τ v S v 2 for all v H and w F i x ( S ) ,
which is equivalent to
v S v , v w 1 τ 2 v S v 2
or   v S v , w S v 1 + τ 2 v S v 2 .
Definition 2.
Let { x n } be a sequence in H and S : H H be an operator, then I S is said to be demiclosed at zero if x n z * and ( I S ) x n 0 implies S z * = z * i.e., z * F i x ( S ) .
Lemma 1
([29]).Let S : Q H be a nonexpansive mapping defined on a closed and convex subset Q of H, then I S is demiclosed at any y H .
Lemma 2.
Let v , w H then
v + w 2 v 2 + 2 w , v + w .
Definition 3
([30]).Let Q be a nonempty closed and convex subset of H then the metric projection P Q : H Q is given as
v P Q v = inf { v w ; w Q } for all v H .
Note that every metric projection is nonexpansive.
Lemma 3
([30]).Let Q be a nonempty closed convex subset of H then P Q , a metric projection from H onto Q is characterized by P Q v Q and
v P Q v , w P Q v 0 for all w Q .
Lemma 4
([31]).Let { s n } [ 0 , ) , { γ n } [ 0 , 1 ] and { b n } be three sequences of real numbers which satisfy the following inequality
s n + 1 ( 1 γ n ) s n + γ n b n for all n 0 .
Suppose n = 0 + γ n = + and lim sup n + b n 0 , then lim n + s n = 0 .
Lemma 5
([32]).Assume that { b n } is a sequence of real numbers and there is a subsequence { n j } of { n } satisfying b n j < b n j + 1 for all j N . Then there exists a nondecreasing sequence { m q } N such that m q + and satisfies
b m q b m q + 1 and b q b m q + 1 ,
for all (suitably large) numbers q N where m q = max { k q : b k < b k + 1 } .
Lemma 6
([33]).Let U : H H be an η-demicontractive operator where η < 1 . Consider U λ : = ( 1 λ ) I + λ U for any λ ( 0 , 1 η ) , then for any z H and z * F i x ( U )
U λ ( z ) z * 2 z z * 2 λ ( 1 η λ ) z U z 2 .
Lemma 7
([33]).Let A : H 1 H 2 be a bounded linear operator and T : H 2 H 2 be a μ-demicontractive operator where μ < 1 . If A 1 ( F i x T ) ϕ , then
1. 
( I T ) A z = 0 iff A * ( I T ) A z = 0 for all z H 1 ,
2. 
z ρ A * ( I T ) A z z * 2 z z * 2 ( 1 μ ) 2 ( I T ) A z 4 4 A * ( I T ) A z 2 ,
where z H 1 , A z T ( A z ) and ρ = ( 1 μ ) ( I T ) A z 2 2 A * ( I T ) A z 2 .
Lemma 8
([34]).Let { x n } be a bounded sequence in a Hilbert space H and J = { 1 , 2 , , N } where N is a positive integer. If lim n + x n + 1 x n = 0 and z * ω w ( x n ) , then for any i J , there exists a subsequence { x m k } of { x n } such that m k ( m o d N ) + 1 = i and x m k z * .

3. Main Result

In this section, we present our main result and prove the strong convergence of our iterative algorithm for approximating a common solution of fixed point problem and multiple-sets split common fixed point problem involving demicontractive operators without prior knowledge of operator norm.
Theorem 1.
Assume that H 1 and H 2 are two real Hilbert spaces and A : H 1 H 2 is a bounded linear operator. Consider S i : H 1 H 1 and T j : H 2 H 2 are two families of demicontractive operators with constants 0 η i < 1 and 0 μ j < 1 respectively such that I S i and I T j are demiclosed at zero for 1 i N , 1 j M with η = m a x η i and μ = m a x μ j . Assume that U : H 1 H 1 is a demicontractive operator with constant 0 κ < 1 such that I U is demiclosed at zero and U λ n : = ( 1 λ n ) I + λ n U for λ n ( ϵ , 1 κ ϵ ) , where ϵ > 0 is arbitrary. For any x 1 H 1 , { x n } is defined by
y n = α n g ( x n ) + ( 1 α n ) U λ n ( x n ρ n A * ( I T n ) A x n ) , x n + 1 = ( 1 β n ) y n + β n S n y n , for all n 1
where ρ n = ( 1 μ n ) ( I T n ) A x n 2 2 A * ( I T n ) A x n 2 , A x n T n ( A x n ) 0 , otherwise
and g is a γ contraction operator defined on H 1 , γ [ 0 , 1 ) . Define S n = S n ( m o d N ) + 1 and T n = T n ( m o d M ) + 1 for all n 1 . Suppose Γ is a set of all solutions to the problem (1) and Γ ϕ . Additionally, let { α n } , { β n } be sequences of positive real numbers satisfying the following conditions:
1. 
lim n + α n = 0 and n = 0 + α n = + where α n ( 0 , 1 ) ,
2. 
β n ( δ , 1 η δ ) , δ > 0 .
Then sequence { x n } converges strongly to z * Γ where z * is a unique fixed point of contraction P Γ g .
Proof. 
Take an arbitrary element z * Γ and put a n = x n ρ n A * ( I T n ) A x n for all n N . First we claim that { x n } is bounded.
If ρ n = 0 , then we have a n = x n and using Lemma 6, we get
U λ n a n z * 2 = U λ n x n z * 2 x n z * 2 λ n ( 1 κ λ n ) x n U x n 2 x n z * 2 .
If ρ n 0 , then from Lemmas 6 and 7, we have
U λ n a n z * 2 a n z * 2 λ n ( 1 κ λ n ) a n U a n 2 = x n ρ n A * ( I T n ) A x n z * 2 λ n ( 1 κ λ n ) a n U a n 2 x n z * 2 ( 1 μ n ) 2 ( I T n ) A x n 4 4 A * ( I T n ) A x n 2 λ n ( 1 κ λ n ) a n U a n 2 x n z * 2 .
Thus, we obtain
U λ n a n z * x n z * .
Now define ( S n ) β n = ( 1 β n ) I + β n S n for all n N . Again using Lemma 6, we have
x n + 1 z * 2 = ( S n ) β n ( y n ) z * 2 y n z * 2 β n ( 1 η n β n ) S n ( y n ) y n 2 y n z * 2 β n ( 1 η β n ) S n ( y n ) y n 2 y n z * 2 .
Using Equation (11), we get
x n + 1 z * y n z * = α n g ( x n ) + ( 1 α n ) U λ n a n z * = α n ( g ( x n ) z * ) + ( 1 α n ) ( U λ n a n z * ) α n g ( x n ) z * + ( 1 α n ) x n z * α n g ( x n ) g ( z * ) + α n g ( z * ) z * + ( 1 α n ) x n z * α n γ x n z * + α n g ( z * ) z * + ( 1 α n ) x n z * = ( 1 ( 1 γ ) α n ) x n z * + α n g ( z * ) z * max { x n z * , 1 1 γ g ( z * ) z * } max { x 0 z * , 1 1 γ g ( z * ) z * } ,
which shows that { x n } is bounded. Further, we can prove that { g ( x n ) } , { y n } , and { a n } are also bounded.
Since the set of fixed points of demicontractive mapping is closed and convex, the solution set Γ is nonempty, closed and convex subset of H 1 . Therefore, the nearest point projection P Γ is well defined. Additionally, we have that P Γ g : H 1 H 1 is a contraction mapping, hence there exists z * Γ such that z * = P Γ g ( z * ) .
If ρ n = 0 , then from Lemma 2 and using Equations (9) and (12), we have
x n + 1 z * 2 y n z * 2 β n ( 1 η β n ) S n ( y n ) y n 2 = α n g ( x n ) + ( 1 α n ) U λ n x n z * 2 β n ( 1 η β n ) S n ( y n ) y n 2 ( 1 α n ) U λ n x n z * 2 + 2 α n g ( x n ) z * , y n z * β n ( 1 η β n ) S n ( y n ) y n 2 ( 1 α n ) [ x n z * 2 λ n ( 1 κ λ n ) x n U x n 2 ] + 2 α n g ( x n ) z * , y n z * β n ( 1 η β n ) S n ( y n ) y n 2 x n z * 2 λ n ( 1 κ λ n ) x n U x n 2 + 2 α n g ( x n ) z * , y n z * β n ( 1 η β n ) S n ( y n ) y n 2 .
If ρ n 0 , then again using Lemma 2 and Equations (10) and (12), we obtain
x n + 1 z * 2 y n z * 2 β n ( 1 η β n ) S n ( y n ) y n 2 = α n g ( x n ) + ( 1 α n ) U λ n a n z * 2 β n ( 1 η β n ) S n ( y n ) y n 2 ( 1 α n ) U λ n a n z * 2 + 2 α n g ( x n ) z * , y n z * β n ( 1 η β n ) S n ( y n ) y n 2 ( 1 α n ) [ x n z * 2 ( 1 μ n ) 2 ( I T n ) A x n 4 4 A * ( I T n ) A x n 2 λ n ( 1 κ λ n ) a n U a n 2 ] + 2 α n g ( x n ) z * , y n z * β n ( 1 η β n ) S n ( y n ) y n 2 x n z * 2 ( 1 μ ) 2 ( I T n ) A x n 4 4 A * ( I T n ) A x n 2 λ n ( 1 κ λ n ) a n U a n 2 + 2 α n g ( x n ) z * , y n z * β n ( 1 η β n ) S n ( y n ) y n 2 .
Let s n = x n z * 2 . Now, we prove x n z * . For this, we study two cases:
Case 1. Suppose that there is a n 0 N such that { s n } is decreasing for all n n 0 . Since { s n } is monotonic and bounded and hence convergent.
If ρ n = 0 , then from Equation (14) we have
0 λ n ( 1 κ λ n ) x n U x n 2 + β n ( 1 η β n ) S n ( y n ) y n 2 x n z * 2 x n + 1 z * 2 + 2 α n g ( x n ) z * , y n z * .
Thus, we obtain
0 λ n ( 1 κ λ n ) x n U x n 2 s n s n + 1 + α n K
and 0 β n ( 1 η β n ) S n ( y n ) y n 2 s n s n + 1 + α n K ,
where K = sup n N { 2 g ( x n ) z * , y n z * } .
Since { s n } is convergent and lim n + α n = 0 , hence we get
lim n + λ n ( 1 κ λ n ) x n U x n 2 = 0 and lim n + β n ( 1 η β n ) S n ( y n ) y n 2 = 0 ,
which implies
lim n + x n U x n = 0
and lim n + S n ( y n ) y n = 0 .
Additionally, from ρ n = 0 , we get
lim n + ( I T n ) A x n = 0 .
Now,
y n x n = α n g ( x n ) + ( 1 α n ) U λ n x n x n α n g ( x n ) x n + ( 1 α n ) U λ n x n x n = α n g ( x n ) x n + ( 1 α n ) λ n x n U x n .
Using Equation (16) and lim n + α n = 0 , we get
lim n + y n x n = 0 .
Consider
x n + 1 x n = ( 1 β n ) y n + β n S n ( y n ) x n y n x n + β n S n ( y n ) y n .
From Equation (17) and (19), we get lim n + x n + 1 x n = 0 and hence { x n } is asymptotically regular.
As { x n } is bounded, take a subsequence { x n k } of { x n } such that x n k p H 1 and hence p ω w ( x n ) . Additionally, lim n + x n U x n = 0 so by demiclosedness of ( I U ) at zero, we get p Fix ( U ) . We fix an index i { 1 , 2 , , N } . Since the pool of indexes is finite and hence using lim n + x n + 1 x n = 0 and Lemma 8, we can find a subsequence { x m k } of { x n } such that m k ( m o d N ) + 1 = i and x m k p . From Equation (19) we obtain y m k p . Since
lim k + S i ( y m k ) y m k = lim k + S m k ( y m k ) y m k = 0
and I S i is demiclosed at zero for each i { 1 , 2 , , N } , it follows that p i = 1 N F i x ( S i ) . Again using Lemma 8, we can find a subsequence { x m t } of { x n } such that m t ( m o d M ) + 1 = j for each j { 1 , 2 , , M } and x m t p . Additionally, A is a bounded linear operator and hence continuous, so x m t p implies A x m t A p . Since,
lim t + ( I T j ) A x m t = lim t + ( I T m t ) A x m t = 0
and I T j is demiclosed at zero, it follows that A p F i x ( T j ) for each j { 1 , 2 , , M } . Hence, we obtain p i = 1 N F i x ( S i ) F i x ( U ) and A p j = 1 M F i x ( T j ) which implies p Γ .
If ρ n 0 , then from Equation (15) and using s n = x n z * 2 , we have
0 ( 1 μ ) 2 ( I T n ) A x n 4 4 A * ( I T n ) A x n 2 + λ n ( 1 κ λ n ) a n U a n 2 + β n ( 1 η β n ) S n ( y n ) y n 2 s n s n + 1 + 2 α n g ( x n ) z * , y n z * .
Hence,
0 ( 1 μ ) 2 ( I T n ) A x n 4 4 A * ( I T n ) A x n 2 s n s n + 1 + 2 α n g ( x n ) z * , y n z * ,
0 λ n ( 1 κ λ n ) a n U a n 2 s n s n + 1 + 2 α n g ( x n ) z * , y n z *
and
0 β n ( 1 η β n ) S n ( y n ) y n 2 s n s n + 1 + 2 α n g ( x n ) z * , y n z * .
Consider K = sup n N { 2 g ( x n ) z * , y n z * } .
Since { s n } is convergent and lim n + α n = 0 , it follows that
lim n + ( I T n ) A x n 2 A * ( I T n ) A x n = lim n + S n ( y n ) y n = lim n + a n U a n = 0 .
Since,
A * ( I T n ) A x n A * ( I T n ) A x n = A ( I T n ) A x n .
Hence,
( I T n ) A x n = A ( I T n ) A x n 2 A ( I T n ) A x n A ( I T n ) A x n 2 A * ( I T n ) A x n .
Now from Equation (20) we get
lim n + ( I T n ) A x n = 0 .
Moreover,
lim n + x n a n = lim n + ρ n A * ( I T n ) A x n = lim n + ( 1 μ n ) ( I T n ) A x n 2 2 A * ( I T n ) A x n = 0 .
Now,
y n x n = α n g ( x n ) + ( 1 α n ) U λ n a n x n α n g ( x n ) x n + ( 1 α n ) x n U λ n a n α n g ( x n ) x n + ( 1 α n ) x n a n + ( 1 α n ) a n U λ n a n α n g ( x n ) x n + x n a n + λ n a n U a n .
Using lim n + α n = 0 and Equations (20) and (22), we get
lim n + y n x n = 0 .
Now,
x n + 1 x n = ( 1 β n ) y n + β n S n ( y n ) x n y n x n + β n S n ( y n ) y n .
Using Equations (20) and (23), we get lim n + x n + 1 x n = 0 . Hence { x n } is asymptotically regular.
As { x n } is bounded, take a subsequence { x n k } of { x n } such that x n k p H 1 . Now, lim n + x n a n = 0 and boundedness of { a n } implies there is a subsequence { a n k } of { a n } such that a n k p . Since lim n + a n U a n = 0 , so by demiclosedness of I U at zero, we have p F i x ( U ) . Proceeding similarly as for case ρ n = 0 and using Equations (20)–(24) and Lemma 8, we conclude that p i = 1 N Fix ( S i ) Fix ( U ) and A p j = 1 M Fix ( T j ) . Hence p Γ .
Now, using Lemma 3, we get
lim sup n + g ( z * ) z * , y n z * = lim k + g ( z * ) z * , y n k z * = g ( z * ) z * , p z * = g ( z * ) P Γ g ( z * ) , p P Γ g ( z * ) 0 .
Now, we prove that x n z * .
x n + 1 z * 2 = ( S n ) β n ( y n ) z * 2 y n z * 2 β n ( 1 η n β n ) S n ( y n ) y n 2 y n z * 2 β n ( 1 η β n ) S n ( y n ) y n 2 y n z * 2 .
Moreover, using Lemma 2 and Equation (11), we obtain
y n z * 2 = α n g ( x n ) + ( 1 α n ) U λ n a n z * 2 ( 1 α n ) 2 U λ n a n z * 2 + 2 α n g ( x n ) z * , y n z * ( 1 α n ) 2 x n z * 2 + 2 α n [ g ( x n ) g ( z * ) , y n z * + g ( z * ) z * , y n z * ] ( 1 α n ) 2 x n z * 2 + 2 α n γ x n z * . y n z * + 2 α n g ( z * ) z * , y n z * ( 1 α n ) 2 x n z * 2 + α n γ [ x n z * 2 + y n z * 2 ] + 2 α n g ( z * ) z * , y n z * ,
which implies
( 1 α n γ ) y n z * 2 [ ( 1 α n ) 2 + α n γ ] x n z * 2 + 2 α n g ( z * ) z * , y n z *
and hence,
y n z * 2 ( 1 α n ) 2 + α n γ 1 α n γ x n z * 2 + 2 α n 1 α n γ g ( z * ) z * , y n z * = 1 2 α n ( 1 γ ) 1 α n γ x n z * 2 + α n 2 1 α n γ x n z * 2 + 2 α n 1 α n γ g ( z * ) z * , y n z * = 1 2 α n ( 1 γ ) 1 α n γ x n z * 2 + 2 α n ( 1 γ ) 1 α n γ ( 1 1 γ g ( z * ) z * , y n z * + α n 2 ( 1 γ ) x n z * 2 ) .
So, we get
s n + 1 ( 1 a n ) s n + a n b n ,
where s n = x n z * 2 , a n = 2 α n ( 1 γ ) 1 α n γ and
b n = 1 1 γ g ( z * ) z * , y n z * + α n 2 ( 1 γ ) x n z * 2 .
From Equation (25), we have lim sup n + b n 0 . Additionally, n = 0 + a n = + . Hence, it follows from Lemma 4 that
lim n + s n = lim n + x n z * 2 = 0 .
Therefore x n z * .
Case 2. Suppose there is no such n 0 N such that { s n } is decreasing for all n n 0 . Thus there is a subsequence { s n l } of { s n } such that
s n l < s n l + 1 for all l N .
Then from Lemma 5 there exists a nondecreasing sequence of natural numbers { n q } N such that n q + as q + and
x n q z * x n q + 1 z * and x q z * x n q + 1 z * .
If ρ n q = 0 , then from Equation (14), we obtain
0 λ n q ( 1 κ λ n q ) x n q U x n q 2 + β n q ( 1 η β n q ) S n q ( y n q ) y n q 2 s n q s n q + 1 + α n q K α n q K ,
where K = sup n q N { 2 g ( x n q ) z * , y n q z * } .
From lim q + α n q = 0 , we obtain
lim q + x n q U x n q = lim q + S n q ( y n q ) y n q = 0 .
Additionally, ρ n q = 0 implies lim q + ( I T n q ) A x n q = 0 .
If ρ n q 0 , then from Equation (15), we have
0 ( 1 μ ) 2 ( I T n q ) A x n q 4 4 A * ( I T n q ) A x n q 2 + λ n q ( 1 κ λ n q ) a n q U a n q 2 + β n q ( 1 η β n q ) S n q ( y n q ) y n q 2 s n q s n q + 1 + α n q K α n q K ,
where K = sup n q N { 2 g ( x n q ) z * , y n q z * } .
From lim q + α n q = 0 , we obtain
lim q + a n q U a n q = 0 , lim q + S n q ( y n q ) y n q = 0 and lim q + ( I T n q ) A x n q = 0 .
Now, proceeding similarly as in Case 1, we obtain
lim q + x n q + 1 x n q = 0 and lim sup q + g ( z * ) z * , y n q z * 0 .
Further, from Equation (26), we get
s n q + 1 ( 1 a n q ) s n q + a n q b n q ,
a n q s n q s n q s n q + 1 + a n q b n q a n q b n q .
Using a n q > 0 , we get s n q b n q . Hence,
x n q z * 2 1 1 γ g ( z * ) z * , y n q z * + α n q 2 ( 1 γ ) x n q z * 2 .
Since { x n q } is bounded and α n q 0 as q + . Hence, by using Equation (29), we get x n q z * 0 as q + . Further, from Equation (30), we obtain x n q + 1 z * 0 as q + . Additionally, Equation (28) gives x q z * x n q + 1 z * for all q N , which implies x q z * as q + . This completes the proof. □
We end this section with the following remarks.
Remark 1.
Theorem 1 extends and improves the result of Wang and Qin ([35], Theorem 1) from weak convergence to strong convergence and by choosing step size independent of operator norm. Further Theorem 1 improves the result in ([35], Theorem 2) without assuming the extra condition that one of the mappings { S i ; i = 1 , 2 , , N } is semi-compact as assumed in ([35], Theorem 2).
Remark 2.
Theorem 1 extends and improves the result of Tang et al. [36], where it was assumed that { S i ; i = 1 , 2 , , N } and { T j ; j = 1 , 2 , , M } are continuous. We leave this assumption in our result. Moreover, our result extends the result in [36] from weak convergence to strong convergence.
Remark 3.
Theorem 1 generalizes and improves Cui and Wang’s result [33] from weak convergence to strong convergence for multiple sets.
Remark 4.
If we take S 1 = S 2 = = S N = I , T 1 = T 2 = = T M = T , g is a constant mapping and λ n = λ for all n, in Theorem 1, then we obtain Boikanyo’s result ([37], Theorem 4.1) for approximating the solution of split common fixed point problem. Thus Boikanyo’s result is a particular case of our result.
Remark 5.
Our result improves the result of Tang et al. ([38], Theorem 3.2) from weak convergence to strong convergence and without assuming the extra condition that { S i ; i = 1 , 2 , , N } are continuous.
Remark 6.
By taking S 1 = S 2 = = S N = g , T 1 = T 2 = = T M = T in Theorem 1, where g is a contraction mapping, we obtain Jirakitpuwapat et al.’s result [25] for solving split common fixed point problem. Thus, Theorem 1 improves and extends Jirakitpuwapat et al.’s result [25].
Remark 7.
If we take S 1 = S 2 = = S N = I , T 1 = T 2 = = T M = I and λ n = λ for all n, then Theorem 1 reduces to fixed point problem of Mainge ([39], Theorem 3.1). Furthermore, our result generalize the Mainge’s result [39] from quasi nonexpansive mapping to more generalized demicontractive mapping.

4. Applications

In this section, we will study different split type problems in Hilbert spaces by utilizing main result provided in this paper.

4.1. Multiple-Sets Split Common Null Point Problem

Consider B : H 1 2 H 1 and F : H 2 2 H 2 two set valued operators defined on Hilbert spaces H 1 and H 2 respectively and A : H 1 H 2 is a bounded linear operator, then split common null point problem (SCNPP) is to identify z * H 1 such that 0 B ( z * ) and y * = A z * solves 0 F ( y * ) .
We now solve the SCNPP for multiple sets i.e., if B i : H 1 2 H 1 and F j : H 2 2 H 2 be two families of set valued operators where 1 i N and 1 j M , then multiple-sets split common null point problem is to identify z * H 1 such that
0 i = 1 N B i ( z * ) and y * = A z * solves 0 j = 1 M F j ( y * ) .
Before proving the theorem, we give some basic definitions.
Definition 4
([40]).A multivalued mapping F : H 2 H is a monotone mapping if f F ( u ) and g F ( v ) implies u v , f g 0 for all u , v H .
Definition 5
([40]).A monotone mapping F is called maximal if graph of any other monotone mapping cannot contain graph of F, where graph of F is given by G ( F ) = { ( u , v ) H × H ; v F ( u ) } for a multivalued mapping F.
Definition 6
([40]).The resolvent operator J r F : H H associated with multivalued mapping F and r is the mapping defined as J r F ( v ) = ( I + r F ) 1 ( v ) for all v H , where r > 0 .
We know that for any r > 0 , the mapping J r F is firmly nonexpansive and single valued and z * Fix ( J r F ) iff 0 F ( z * ) where F is maximal monotone mapping, see [41]. Therefore, problem (31) is equivalent to the problem of finding z * H 1 such that
z * i = 1 N Fix ( J r B i ) and A z * j = 1 M Fix ( J r F j ) .
Now, we solve the split common null point problem as split common fixed point problem.
Theorem 2.
Assume that U : H 1 H 1 is a demicontractive operator with constant 0 κ < 1 such that I U is demiclosed at zero. For any x 1 H 1 , { x n } is defined by
y n = α n g ( x n ) + ( 1 α n ) U λ n ( x n ρ n A * ( I J r F n ) A x n ) , x n + 1 = ( 1 β n ) y n + β n J r B n ( y n ) , for all n 1
where ρ n = ( I J r F n ) A x n 2 2 A * ( I J r F n ) A x n 2 , A x n J r F n ( A x n ) 0 , otherwise
and g is a γ contraction operator defined on H 1 , γ [ 0 , 1 ) . Consider U λ n : = ( 1 λ n ) I + λ n U for λ n ( ϵ , 1 κ ϵ ) , ϵ > 0 . Define J r B n = J r B n ( m o d N ) + 1 and J r F n = J r F n ( m o d M ) + 1 for all n 1 . Suppose Ω is a set of all solutions to the problem (31) and Ω F i x ( U ) ϕ . Additionally, let { α n } , { β n } be two sequences of positive real numbers satisfying the following conditions:
1. 
lim n + α n = 0 and n = 0 + α n = + where α n ( 0 , 1 ) ,
2. 
β n ( δ , 1 δ ) , δ > 0 .
Then sequence { x n } converges strongly to z * Ω Fix ( U ) .
Proof. 
Let us take T n = J r F n and S n = J r B n for all n N . Then S n and T n are firmly nonexpansive and hence 0-demicontractive. From Lemma 1, we get I S n and I T n are demiclosed at zero. Hence proof follows from the main Theorem 1. □
We remark that, in [11], Byrne et al. solve the SCNPP where the step size depends on operator norm which is not easy to calculate. Our result extends and generalizes the results in [11] for multiple sets without prior knowledge of operator norm. Additionally, in ([11], Theorem 4.3), maximal monotone mappings B 1 and F 1 are considered to be odd but, in Theorem 2, we have not imposed such a condition on maximal monotone mappings.

4.2. Multiple-Sets Split Feasibility Problem

Assume that C i ( 1 i N ) and Q j ( 1 j M ) are two families of nonempty closed and convex subsets of Hilbert spaces H 1 and H 2 respectively and A : H 1 H 2 is a bounded linear operator. Then the multiple-sets split feasibility problem is to identify a point z * H 1 such that
z * i = 1 N C i and A z * j = 1 M Q j .
We denote the solution set of multiple-sets split feasibility problem by Ω . It is well known that z * Fix ( P C ) iff z * C where C is closed, convex subset of Hilbert space H. Now, we prove the strong convergence theorem for the multiple-sets split feasibility problem.
Theorem 3.
Assume that U : H 1 H 1 is a demicontractive operator with constant 0 κ < 1 such that I U is demiclosed at zero. Suppose Ω Fix ( U ) ϕ and for any x 1 H 1 , { x n } is defined by
y n = α n g ( x n ) + ( 1 α n ) U λ n ( x n ρ n A * ( I P Q n ) A x n ) , x n + 1 = ( 1 β n ) y n + β n P C n ( y n ) , for all n 1
where ρ n = ( I P Q n ) A x n 2 2 A * ( I P Q n ) A x n 2 , A x n P Q n ( A x n ) 0 , otherwise
and g is a γ contraction operator defined on H 1 , γ [ 0 , 1 ) . Consider U λ n : = ( 1 λ n ) I + λ n U for λ n ( ϵ , 1 κ ϵ ) , ϵ > 0 . Define P C n = P C n ( m o d N ) + 1 and P Q n = P Q n ( m o d M ) + 1 for all n 1 . Additionally, { α n } , { β n } be two sequences of positive real numbers satisfying the following conditions:
1. 
lim n + α n = 0 and n = 0 + α n = + where α n ( 0 , 1 ) ,
2. 
β n ( δ , 1 δ ) , δ > 0 .
Then sequence { x n } converges strongly to z * Ω F i x ( U ) .
Proof. 
Consider S n = P C n and T n = P Q n for all n N . Since metric projection is firmly nonexpansive and hence 0-demicontractive. Hence proof follows from the main Theorem 1. □
Note that if we take N = M = 1 in Theorem 3, then multiple-sets split feasibility problem reduces to a split feasibility problem (see [1,3,4,6,27]). Further, if we take A = I , where I is identity mapping and H 1 = H 2 = H in Theorem 3, then we get a convex feasibility problem which is formulated as finding a point in the intersection of a family of closed and convex subsets in Hilbert space H.

4.3. Multiple-Sets Split Variational Inequality Problem

Assume that C is nonempty closed and convex subset of Hilbert space H and f : H H is an operator, then variational inequality problem is to identify z * C such that
f ( z * ) , z z * 0 for all z C .
The solution set of variational inequality problem is denoted by VI( C , f ). Note that if f is an α -ism operator on H, then P C ( I λ f ) is nonexpansive for each λ ( 0 , 2 α ) and z * Fix ( P C ( I λ f ) ) iff z * VI ( C , f ) (see [41]).
Consider C i ( 1 i N ) and Q j ( 1 j M ) two families of nonempty closed and convex subsets of Hilbert spaces H 1 and H 2 respectively and A : H 1 H 2 is a bounded linear operator. Assume that h i : H 1 H 1 and f j : H 2 H 2 are two families of ν i and μ j -ism operators, respectively. Set μ = m i n { ν i , μ j } and take τ ( 0 , 2 μ ) . Suppose
Ω = { z * H 1 such that z * i = 1 N VI ( h i , C i ) and A z * j = 1 M VI ( g j , Q j ) } .
Then multiple-sets split variational inequality problem is to identify z * Ω .
Now, we will present a strong convergence theorem for solving multiple-sets split variational inequality problem.
Theorem 4.
Assume that U : H 1 H 1 is a demicontractive operator with constant 0 κ < 1 such that I U is demiclosed at zero. Suppose Ω F i x ( U ) ϕ and for any x 1 H 1 , { x n } is defined by
y n = α n g ( x n ) + ( 1 α n ) U λ n ( x n ρ n A * ( I P Q n ( I τ f n ) ) A x n ) , x n + 1 = ( 1 β n ) y n + β n P C n ( I τ h n ) ( y n ) , for all n 1
where ρ n = ( I P Q n ( I τ f n ) ) A x n 2 2 A * ( I P Q n ( I τ f n ) ) A x n 2 , A x n P Q n ( I τ f n ) A x n 0 , otherwise
and g is a γ contraction operator defined on H 1 , γ [ 0 , 1 ) . Consider U λ n : = ( 1 λ n ) I + λ n U for λ n ( ϵ , 1 κ ϵ ) , ϵ > 0 . Define P C n ( I τ h n ) = P C n ( m o d N ) + 1 ( I τ h n ( m o d N ) + 1 ) and P Q n ( I τ f n ) = P Q n ( m o d M ) + 1 ( I τ f n ( m o d M ) + 1 ) . Additionally, { α n } , { β n } be two sequences of positive real numbers satisfying the following conditions:
1. 
lim n + α n = 0 and n = 0 + α n = + where α n ( 0 , 1 ) ,
2. 
β n ( δ , 1 δ ) , δ > 0 .
Then sequence { x n } converges strongly to z * Ω Fix ( U ) .
Proof. 
Since h i and f j are two families of ν i and μ j - ism operators respectively and hence μ -ism operators. Then for each τ ( 0 , 2 μ ) , P C i ( I τ h i ) and P Q j ( I τ f j ) are nonexpansive and hence 0-demicontractive. Hence by using Theorem 1, { x n } converges strongly to z * H 1 such that
z * i = 1 N F i x ( P C i ( I τ h i ) ) F i x ( U ) and A z * j = 1 M F i x ( P Q j ( I τ f j ) )
which implies z * Ω F i x ( U ) . □
We underly that, in [8], Censor et al. solved the multiple-sets split variational inequality problem through weak convergence of parallel algorithm and in addition, they assume extra conditions
h i ( z ) , P C i ( I λ h i ) ( z ) z * 0 for all z H 1 and f j ( z ) , P Q j ( I λ f j ) ( z ) z * 0 for all z H 2
in ([8], Theorem 6.5). However, in Theorem 4, we do not assume such conditions and improve the result from weak convergence to strong convergence.

4.4. Multiple-Sets Split Equilibrium Problem

Let Q be a nonempty closed convex subset of real Hilbert space H and F be a bifunction from Q × Q to R . Then the equilibrium problem for F is to identify a point u Q such that F ( u , v ) 0 for all v Q . The solution set of the equilibrium problem is denoted by EP(F).
To find the solution of the equilibrium problem, we assume that the following conditions are satisfied by bifunction F:
  • F ( u , u ) 0 .
  • F is monotone i.e., F ( u , v ) + F ( v , u ) 0 for any u , v Q .
  • For each u , v , w Q , lim sup t 0 + F ( t w + ( 1 t ) u , v ) F ( u , v ) .
  • For each u Q , v F ( u , v ) is convex and lower semi-continuous.
Now, we give an important lemma to solve the equilibrium problem.
Lemma 9
([42]).Let Q be a nonempty closed convex subset of Hilbert space H and let F : Q × Q R be a bifunction satisfying the four conditions given above. Consider u H and r > 0 , then there exists w Q such that
F ( w , v ) + 1 r v w , w u 0 for all v Q .
Further if S r F ( u ) = { w Q : F ( w , v ) + 1 r v w , w u 0 for all v Q } then the following statements hold:
1. 
S r F is single valued.
2. 
S r F is firmly nonexpansive i.e., for any u , v H
S r F ( u ) S r F ( v ) 2 S r F ( u ) S r F ( v ) , u v .
3. 
Fix( S r F )=EP(F).
4. 
Solution set EP(F) is closed and convex.
From the above lemma, it is observed that the equilibrium problem can be solved as a fixed point problem.
Assume that C i and Q j are two families of nonempty closed, convex subsets of Hilbert spaces H 1 and H 2 respectively where 1 i N , 1 j M . Consider F i : C i × C i R and G j : Q j × Q j R bifunctions satisfying the above four conditions and A is a bounded linear operator from H 1 to H 2 , then the multiple-sets split equilibrium problem is to identify a point z * Ω where
Ω = { z * H 1 : z * i = 1 N E P ( F i ) and A z * j = 1 M E P ( G j ) } .
Now, we present a strong convergence theorem for solving the multiple-sets split equilibrium problem.
Theorem 5.
Assume that U : H 1 H 1 is a demicontractive operator with constant 0 κ < 1 such that I U is demiclosed at zero. Choose r 1 , r 2 > 0 and suppose Ω F i x ( U ) ϕ . For any x 1 H 1 , { x n } is defined by
y n = α n g ( x n ) + ( 1 α n ) U λ n ( x n ρ n A * ( I S r 1 G n ) A x n ) , x n + 1 = ( 1 β n ) y n + β n S r 2 F n ( y n ) , for all n 1
where ρ n = ( I S r 1 G n ) A x n 2 2 A * ( I S r 1 G n ) A x n 2 , A x n S r 1 G n ( A x n ) 0 , otherwise
and g is a γ contraction operator defined on H 1 , γ [ 0 , 1 ) . Consider U λ n : = ( 1 λ n ) I + λ n U for λ n ( ϵ , 1 κ ϵ ) , ϵ > 0 . Define S r 2 F n = S r 2 F n ( m o d N ) + 1 and S r 1 G n = S r 1 G n ( m o d M ) + 1 for all n 1 . Additionally, let { α n } , { β n } be two sequences of positive real numbers satisfying the following conditions:
1. 
lim n + α n = 0 and n = 0 + α n = + where α n ( 0 , 1 ) ,
2. 
β n ( δ , 1 δ ) , δ > 0 .
Then sequence { x n } converges strongly to z * Ω Fix ( U ) .
Proof. 
From Lemma 9, it is clear that the mappings S r 1 G n and S r 2 F n are firmly nonexpansive and hence 0-demicontractive. Hence result follows from Lemma 9 and Theorem 1. □

4.5. Multiple-Sets Split Monotone Variational Inclusion Problem

Assume that H 1 and H 2 are two real Hilbert spaces and A : H 1 H 2 is a bounded linear operator. Consider P i : H 1 2 H 1 ( 1 i N ) and Q j : H 2 2 H 2 ( 1 j M ) as two families of set valued maximal monotone operators. Let h i be ν i -ism operator in H 1 for each i = 1 , 2 , , N and f j be μ j -ism operator in H 2 for each j = 1 , 2 , , M . Set μ = min { ν i , μ j } and take τ ( 0 , 2 μ ) . Then the multiple-sets split monotone variational inclusion problem is to identify z * H 1 such that
0 i = 1 N ( h i ( z * ) + P i ( z * ) ) and y * = A z * solves 0 j = 1 M ( f j ( A z * ) + Q j ( A z * ) ) .
We denote the solution set of the multiple-sets split monotone variational inclusion problem by Ω . We know that 0 h ( z * ) + P ( z * ) iff z * F i x ( J λ P ( I λ h ) ) , where J λ P is a resolvent operator associated with multivalued mapping P and λ > 0 . Additionally, if λ ( 0 , 2 α ) , then J λ P ( I λ h ) is averaged mapping, where h is an α -ism operator and P is a maximal monotone operator, see [9,43].
We now present a strong convergence theorem for solving multiple-sets split monotone variational inclusion problem.
Theorem 6.
Assume that U : H 1 H 1 is a demicontractive operator with constant 0 κ < 1 such that I U is demiclosed at zero. Suppose Ω Fix ( U ) ϕ and for any x 1 H 1 , { x n } is defined by
y n = α n g ( x n ) + ( 1 α n ) U λ n ( x n ρ n A * ( I J τ Q n ( I τ f n ) ) A x n ) , x n + 1 = ( 1 β n ) y n + β n J τ P n ( I τ h n ) ( y n ) , for all n 1
where ρ n = ( I J τ Q n ( I τ f n ) ) A x n 2 2 A * ( I J τ Q n ( I τ f n ) ) A x n 2 , A x n J τ Q n ( I τ f n ) A x n 0 , otherwise
and g is a γ contraction operator defined on H 1 , γ [ 0 , 1 ) . Consider U λ n : = ( 1 λ n ) I + λ n U for λ n ( ϵ , 1 κ ϵ ) , ϵ > 0 . Define J τ P n ( I τ h n ) = J τ P n ( m o d N ) + 1 ( I τ h n ( m o d N ) + 1 ) and J τ Q n ( I τ f n ) = J τ Q n ( m o d M ) + 1 ( I τ f n ( m o d M ) + 1 ) for all n 1 . Additionally, let { α n } , { β n } be two sequences of positive real numbers satisfying the following conditions:
1. 
lim n + α n = 0 and n = 0 + α n = + where α n ( 0 , 1 ) ,
2. 
β n ( δ , 1 δ ) , δ > 0 .
Then sequence { x n } converges strongly to z * Ω Fix ( U ) .
Proof. 
Let us take T n = J τ Q n ( I τ f n ) and S n = J τ P n ( I τ h n ) for all n N . Then S n and T n are averaged mapping and hence nonexpansive. Additionally, I S n and I T n are demiclosed at zero. Hence, the result follows from the Main Theorem 1. □
Note that Theorem 6 generalizes and extends Moudafi’s result [9] from weak convergence to strong convergence without knowing the operator norm.

Author Contributions

N.G., M.P., A.N., and R.C. participated equally in the conceptualization, validation, formal analysis, investigation, writing of the original draft preparation, review and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Censor, Y.; Elfving, T. A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 1994, 8, 221–239. [Google Scholar] [CrossRef]
  2. He, H.; Ling, C.; Xu, H.K. An Implementable Splitting Algorithm for the 1-norm Regularized Split Feasibility Problem. J. Sci. Comput. 2016, 67, 281–298. [Google Scholar] [CrossRef]
  3. Lorenz, D.A.; Shöpfer, F.; Wenger, S. The linearized Bregman method via split feasibility problems: Analysis and generalizations. SIAM J. Imag. Sci. 2014, 7, 1237–1262. [Google Scholar] [CrossRef] [Green Version]
  4. Censor, Y.; Elfving, T.; Kopf, N.; Bortfeld, T. The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 2005, 21, 2071–2084. [Google Scholar] [CrossRef] [Green Version]
  5. Censor, Y.; Bortfeld, T.; Martin, B.; Trofimov, A. A unified approach for inversion problems in intensity-modulated radiation therapy. Phys. Med. Biol. 2006, 51, 2353–2365. [Google Scholar] [CrossRef] [Green Version]
  6. Byrne, C. An unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 2004, 20, 103–120. [Google Scholar] [CrossRef] [Green Version]
  7. Censor, Y.; Segal, A. The split common fixed point problem for directed operators. J. Convex Anal. 2009, 16, 587–600. [Google Scholar]
  8. Censor, Y.; Gibali, A.; Reich, S. Algorithms for the split variational inequality problem. Numer. Algorithms 2012, 59, 301–323. [Google Scholar] [CrossRef]
  9. Moudafi, A. Split monotone variational inclusions. J. Optim. Theory Appl. 2011, 150, 275–283. [Google Scholar] [CrossRef]
  10. He, Z. The split equilibrium problem and its convergence algorithms. J. Inequalities Appl. 2012, 2012, 162. [Google Scholar] [CrossRef] [Green Version]
  11. Byrne, C.; Censor, Y.; Gibali, A.; Reich, S. Weak and strong convergence of algorithms for the split common null point problem. J. Nonlinear Convex Anal. 2012, 13, 759–775. [Google Scholar]
  12. Sahu, D.R.; Pitea, A.; Verma, M. A new iteration technique for nonlinear ope-rators as concerns convex programming and feasibility problems. Numer. Algor. 2020, 83, 421–449. [Google Scholar] [CrossRef]
  13. Usurelu, G.I. Split feasibility handled by a single-projection three-step iteration with comparative analysis. J. Nonlinear Convex Anal. 2021, 22. in printing. [Google Scholar]
  14. Nandal, A.; Chugh, R.; Postolache, M. Iteration process for fixed point problems and zeros of maximal monotone operators. Symmetry 2019, 11, 655. [Google Scholar] [CrossRef] [Green Version]
  15. Ivković, S. Semi-Fredholm theory on Hilbert C*-modules. Banach J. Math. Anal. 2019, 13, 989–1016. [Google Scholar] [CrossRef]
  16. Postolache, M.; Nandal, A.; Chugh, R. Strong Convergence of a New Generalized Viscosity Implicit Rule and Some Applications in Hilbert Space. Mathematics 2019, 7, 773. [Google Scholar] [CrossRef] [Green Version]
  17. Nandal, A.; Chugh, R. On Zeros of Accretive Operators with Application to the Convex Feasibility Problem. UPB Sci. Bull. Ser. A 2019, 81, 95–106. [Google Scholar]
  18. Hussain, N.; Nandal, A.; Kumar, V.; Chugh, R. Multistep Generalized Viscosity Iterative Algorithm for solving Convex Feasibility Problems in Banach Spaces. J. Nonlinear Convex Anal. 2020, 21, 587–603. [Google Scholar]
  19. Đukić, D.; Paunović, L.; Radenović, S. Convergence of iterates with errors of uniformly quasi-Lipschitzian mappings in cone metric spaces. Kragujev. J. Math. 2011, 35, 399–410. [Google Scholar]
  20. Nandal, A.; Chugh, R.; Kumari, S. Convergence Analysis of Algorithms for Variational Inequalities involving Strictly Pseudocontractive operators. Poincare J. Anal. Appl. 2019, 2019, 123–136. [Google Scholar]
  21. Koskela, P.; Manojlović, V. Quasi-nearly subharmonic functions and quasiconformal mappings. Potential Anal. 2012, 37, 187–196. [Google Scholar] [CrossRef] [Green Version]
  22. Yao, Y.; Li, H.; Postolache, M. Iterative algorithms for split equilibrium problems of monotone operators and fixed point problems of pseudo-contractions. Optimization 2020. [Google Scholar] [CrossRef]
  23. Dadashi, V.; Postolache, M. Forward-backward splitting algorithm for fixed point problems and zeros of the sum of monotone operators. Arab. J. Math. 2020, 9, 89–99. [Google Scholar] [CrossRef] [Green Version]
  24. Yao, Y.; Postolache, M.; Liou, Y.C. Strong convergence of a self-adaptive method for the split feasibility problem. Fixed Point Theory Appl. 2013, 2013, 201. [Google Scholar] [CrossRef] [Green Version]
  25. Jirakitpuwapat, W.; Kumam, P.; Cho, Y.J.; Sitthithakerngkiet, K. A general algorithm for the split common fixed point problem with its applications to signal processing. Mathematics 2019, 7, 226. [Google Scholar] [CrossRef] [Green Version]
  26. Moudafi, A. The split common fixed-point problem for demicontractive mappings. Inverse Probl. 2010, 26, 055007. [Google Scholar] [CrossRef] [PubMed]
  27. López, G.; Martín-Márquez, V.; Wang, F.; Xu, H.K. Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl. 2012, 28, 085004. [Google Scholar] [CrossRef]
  28. Shehu, Y.; Cholamjiak, P. Another look at the split common fixed point problem for demicontractive operators. RACSAM 2016, 110, 201–218. [Google Scholar] [CrossRef]
  29. Opial, Z. Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 1967, 73, 591–597. [Google Scholar] [CrossRef] [Green Version]
  30. Takahashi, W. Nonlinear functional analysis. In Fixed Point Theory and Its Applications; Yokohama Publishers: Yokohama, Japan, 2000. [Google Scholar]
  31. Xu, H.K. Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002, 66, 240–256. [Google Scholar] [CrossRef]
  32. Maingé, P.E. Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal. 2008, 16, 899–912. [Google Scholar] [CrossRef]
  33. Cui, H.; Wang, F. Iterative methods for the split common fixed point problem in Hilbert spaces. Fixed Point Theory Appl. 2014, 2014, 78. [Google Scholar] [CrossRef] [Green Version]
  34. Wang, J.; Wang, Y. Strong convergence of a cyclic iterative algorithm for split common fixed-point problems of demicontractive mappings. J. Nonlinear Var. Anal. 2018, 2, 295–303. [Google Scholar]
  35. Qin, L.J.; Wang, G. Multiple-set split feasibility problems for a finite family of demicontractive mappings in Hilbert spaces. Math. Inequal. Appl. 2013, 16, 1151–1157. [Google Scholar] [CrossRef] [Green Version]
  36. Tang, Y.C.; Peng, J.G.; Liu, L.W. A cyclic algorithm for the split common fixed point problem of demicontractive mappings in Hilbert spaces. Math. Model. Anal. 2012, 17, 457–466. [Google Scholar] [CrossRef]
  37. Boikanyo, O.A. A strongly convergent algorithm for the split common fixed point problem. Appl. Math. Comput. 2015, 265, 844–853. [Google Scholar] [CrossRef]
  38. Tang, Y.C.; Peng, J.G.; Liu, L.W. A cyclic and simultaneous iterative algorithm for the multiple split common fixed point problem of demicontractive mappings. Bull. Korean Math. Soc. 2014, 51, 1527–1538. [Google Scholar] [CrossRef] [Green Version]
  39. Maingé, P.E. The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces. Comput. Math. Appl. 2010, 59, 74–79. [Google Scholar] [CrossRef] [Green Version]
  40. Kazmi, K.R.; Rizvi, S.H.; Ali, R. A Hybrid-extragradient iterative method for split monotone variational inclusion, mixed equilibrium problem and fixed point problem for a nonexpansive mapping. J. Nigerian Math. Soc. 2016, 35, 312–338. [Google Scholar]
  41. Kitkuan, D.; Kumam, P.; Padcharoen, A.; Kumam, W.; Thounthong, P. Algorithms for zeros of two accretive operators for solving convex minimization problems and its application to image restoration problems. J. Comput. Appl. Math. 2019, 354, 471–495. [Google Scholar] [CrossRef]
  42. Combettes, P.L.; Hirstoaga, S.A. Equilibrium programming in Hilbert spaces. J. Nonlinear Convex Anal. 2005, 6, 117–136. [Google Scholar]
  43. Shehu, Y.; Ogbuisi, F.U. An iterative method for solving split monotone variational inclusion and fixed point problems. RACSAM 2016, 110, 503–518. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Gupta, N.; Postolache, M.; Nandal, A.; Chugh, R. A Cyclic Iterative Algorithm for Multiple-Sets Split Common Fixed Point Problem of Demicontractive Mappings without Prior Knowledge of Operator Norm. Mathematics 2021, 9, 372. https://doi.org/10.3390/math9040372

AMA Style

Gupta N, Postolache M, Nandal A, Chugh R. A Cyclic Iterative Algorithm for Multiple-Sets Split Common Fixed Point Problem of Demicontractive Mappings without Prior Knowledge of Operator Norm. Mathematics. 2021; 9(4):372. https://doi.org/10.3390/math9040372

Chicago/Turabian Style

Gupta, Nishu, Mihai Postolache, Ashish Nandal, and Renu Chugh. 2021. "A Cyclic Iterative Algorithm for Multiple-Sets Split Common Fixed Point Problem of Demicontractive Mappings without Prior Knowledge of Operator Norm" Mathematics 9, no. 4: 372. https://doi.org/10.3390/math9040372

APA Style

Gupta, N., Postolache, M., Nandal, A., & Chugh, R. (2021). A Cyclic Iterative Algorithm for Multiple-Sets Split Common Fixed Point Problem of Demicontractive Mappings without Prior Knowledge of Operator Norm. Mathematics, 9(4), 372. https://doi.org/10.3390/math9040372

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop