Next Article in Journal
An Aggregation-Based Algebraic Multigrid Method with Deflation Techniques and Modified Generic Factored Approximate Sparse Inverses
Next Article in Special Issue
Convergence Analysis for Yosida Variational Inclusion Problem with Its Corresponding Yosida Resolvent Equation Problem through Inertial Extrapolation Scheme
Previous Article in Journal
Investigation of the Stress-Strain State of a Rectangular Plate after a Temperature Shock
Previous Article in Special Issue
Fixed Points for (ξ,ω)-Weakly Cyclic Type Generalized Contraction Condition in Metric Spaces with an Application
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Algorithms for Approximating Solutions of Split Variational Inclusion and Fixed-Point Problems

1
The Key Laboratory of Intelligent Information and Big Data Processing of Ningxia, North Minzu University, Yinchuan 750021, China
2
School of Mathematical Sciences, Tiangong University, Tianjin 300387, China
3
Center for Advanced Information Technology, Kyung Hee University, Seoul 02447, Republic of Korea
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(3), 641; https://doi.org/10.3390/math11030641
Submission received: 16 December 2022 / Revised: 20 January 2023 / Accepted: 24 January 2023 / Published: 27 January 2023
(This article belongs to the Special Issue Applied Functional Analysis and Applications)

Abstract

:
In this paper, the split fixed point and variational inclusion problem is considered. With the help of fixed point technique, Tseng-type splitting method and self-adaptive rule, an iterative algorithm is proposed for solving this split problem in which the involved operators S and T are demicontractive operators and g is plain monotone. Strong convergence theorem is proved under some mild conditions.

1. Introduction

Let H 1 and H 2 be two real Hilbert spaces with inner · , · and norm · . Let f : H 1 2 H 1 be a multi-valued operator. Let g , T : H 1 H 1 and S : H 2 H 2 be three single-valued non-linear operators. Let A : H 1 H 2 be a non-zero bounded linear operator and A * be the adjoint operator of A.
In this paper, we investigate the following split problem which aims to find a point q H 1 , such that
q Fix ( T ) ( f + g ) 1 ( 0 ) and A q Fix ( S ) ,
where Fix ( S ) : = { x H 2 : x = S ( x ) } and Fix ( T ) : = { x H 1 : y = T ( y ) } stand for the fixed point sets of S and T, respectively, and ( f + g ) 1 ( 0 ) denotes the solution set of the variational inclusion of finding a point q H 1 , such that
0 ( f + g ) ( q ) .
In what follows, we use Γ to denote the solution set of (1), i.e.,
Γ : = { z H 1 : z Fix ( T ) ( f + g ) 1 ( 0 ) and A z Fix ( S ) } .
A special case of (1) is the split fixed point problem of finding a point q H 1 , such that
q Fix ( T ) and A q Fix ( S ) ,
which generalizes the convex feasibility problem and the two-sets split feasibility problem arising in the intensity-modulated radiation therapy [1].
There are various ways to solve the split problems, see [2,3,4,5,6,7,8,9,10,11,12,13]. To solve (3), a remarkable channel brought up by Censor and Segal [14] is of the manner:
z 0 H 1 , z n + 1 = T ( z n ν A * ( I S ) A z n ) , n 0 ,
where S , T are directed operators.
A relaxation version of the (4) proposed by Moudafi [15] is defined by
z 0 H 1 , z n + 1 = ( 1 γ n ) z n + γ n T [ z n ν A * ( I S ) A z n ] , n 0 ,
where S , T are demicontractive operators.
Note that solving (3) is equivalent to solve the fixed point equation x = T ( x ) ν A * ( I S ) A x ( ν > 0 ) . By using this equivalent relation, Zheng et al. [16] suggested the following algorithm for solving (3)
z 0 H 1 , z n + 1 = ( 1 σ n ) z n + σ n [ T ( z n ) ν A * ( I S ) A z n ] , n 0 ,
where S , T are demicontractive operators.
At the same time, variational inclusion affords a powerful tool for exploring all kinds of problems appearing in natural science and engineering applications ([17,18]). In particular, the variational inclusion theory is a natural development of the variational principle. A variety of approaches have been proposed for solving variational inclusion (2), see [19,20,21,22,23,24,25]. A valuable approach to solve (2) is the well-known forward–backward algorithm ([26]) defined by
z 0 H 1 , z n + 1 = ( I + γ n f ) 1 ( I γ n g ) ( z n ) , n 0 ,
where the operator g is generally (inverse) strongly monotone.
To relax the strong monotonicity condition imposed on g, Tseng [27] proposed a modified forward–backward algorithm defined by
y n = ( I + γ n f ) 1 ( I γ n g ) ( z n ) , z n + 1 = y n μ n ( g ( y n ) g ( z n ) ) ,
where g is a monotone operator.
With the help of self-adaptive rule, Cholamjiak et. al. [28] suggested the following Tseng-type algorithm to solve (2):
y n = ( I + γ n f ) 1 ( I γ n g ) ( z n ) , z n + 1 = ( 1 θ n ) z n + θ n y n + θ n μ n ( g ( z n ) g ( y n ) ) , μ n + 1 = min μ n , λ n y n z n g ( y n ) g ( z n ) .
Motivated and inspired by the works in this field, the main purpose of this paper is to construct an iterative algorithm for finding a solution of the split problem (1) in which S and T are two demicontractive operators and g is a plain monotone operator. The used method consists of forward–backward method, fixed point method and self-adaptive method. Strong convergence analysis of the sequence generated by the algorithm is proved provided the involved parameter satisfy some basic assumptions.

2. Preliminaries

Let H be a real Hilbert space. Let { z n } be a sequence in H and u H be a point.
  • z n u indicates that z n converges strongly to u as n + ;
  • z n u indicates that z n converges weakly to u as n + ;
  • ω w ( z n ) denotes the the set of the weak cluster points of { z n } in H, i.e.,
    ω w ( z n ) : = { u H : there exists a subsequence { z n i } of { z n } such that z n i u ( i ) } .
Let g : H H be an operator and g is called:
(i)
Strongly monotone if for some constant γ > 0 , the following inequality holds
g ( x ) g ( y ) , x y γ x y 2 , x , y H .
(ii)
Inverse strongly monotone if for some constant γ > 0 we have
g ( x ) g ( y ) , x y γ g ( x ) g ( y ) 2 , x , y H .
(iii)
Monotone if the following result holds
g ( x ) g ( y ) , x y 0 , x , y H .
Let f : H 2 H be an operator. The graph Graph ( f ) of f is defined by
Graph ( f ) : = { ( x , y ) H × H : y f ( x ) } .
Recall that f is said to be:
(i)
Monotone if the set Graph ( f ) is monotone, namely,
s 1 s 2 , t 1 t 2 0 , ( s i , t i ) Graph ( f ) , i = 1 , 2 .
(ii)
Maximal monotone if and only if f is a monotone operator and the following relation holds
( s , t ) H × H , s u , t v 0 , ( u , v ) Graph ( f ) ( s , t ) Graph ( f ) .
Let T : H H be an operator and T is called
(i)
Demiclosed if
z n z ( n ) T ( z n ) y ( n ) y = T ( z ) .
(ii)
Lipschitz if for some constant μ > 0 , we have
T ( x ) T ( y ) μ x y , x , y H .
(iii)
Directed if x H , y Fix ( T ) we have
T ( x ) y 2 x y 2 x T ( x ) 2 .
(iv)
Demicontractive if for some constant δ [ 0 , 1 ) , there holds
T ( x ) y 2 x y 2 + δ x T ( x ) 2 , x H , y Fix ( T ) ,
or
x T ( x ) , x y 1 δ 2 x T ( x ) 2 , x H , y Fix ( T ) .
In this case, T is said to be a δ -demicontractive operator.
Remark 1.
It is clearly from (iii) and (iv) that the demicontractive operator includes the directed operator. Demicontractive operators have many applications, for instance, demicontractive operators in terms of admissible perturbation are used during the construction phase of the matrix of ants artificial pheromone ([29]).
Let Γ be a non-empty closed convex subset of H. Let proj Γ be the metric projection from H onto Γ , i.e.,
proj Γ ( x ) : = arg min x Γ x x , x H .
It is well known that the following result holds: for x H ,
x proj Γ ( x ) , x proj Γ ( x ) 0 , x Γ .
The following lemma is well-known.
Lemma 1.
Let H be a real Hilbert space. Then, for all x , y H , we have
x + y 2 = x 2 + 2 x , y + y 2 ,
x + y 2 x 2 + 2 y , x + y ,
and
β x + ( 1 β ) y 2 = β x 2 + ( 1 β ) y 2 β ( 1 β ) x y 2 , β R .
Lemma 2
([30]). Let H be a real Hilbert space. Let f : H 2 H be a maximal monotone operator. Let the operator g : H H be monotone and Lipschitz continuous. Then f + g is a maximal monotone operator.
Lemma 3
([16]). Let H 1 and H 2 be two real Hilbert spaces. Let T : H 1 H 1 and S : H 2 H 2 be two demicontractive operators. Let A : H 1 H 2 be a non-zero bounded linear operator. Then, x Fix ( T ) ,   A x Fix ( S ) x Fix ( T ν A * ( I S ) A ) ( ν > 0 ) .
Lemma 4
([31]). Let { r n } , { s n } and { μ n } be three sequences in R . Assume that
(i)
r n + 1 ( 1 μ n ) r n + μ n s n for all n 0 ;
(ii)
r n 0 and μ n [ 0 , 1 ] for all n 0 ;
(iii)
n = 0 μ n = + and lim sup n s n 0 .
Then lim n r n = 0 .

3. Main Results

Assume H 1 and H 2 are two real Hilbert spaces. Assume the involved operators fulfil the following conditions:
  • f : H 1 2 H 1 is a maximal monotone operator;
  • g : H 1 H 1 is an L-Lipschitz monotone operator;
  • T : H 1 H 1 is a σ -demicontractive operator;
  • S : H 2 H 2 is a ς -demicontractive operator;
  • A : H 1 H 2 is a non-zero bounded linear operator and A * is the adjoint operator of A.
Suppose that the involved parameters fulfil the following conditions:
  • α , β , δ , γ , and ν are five constants, such that α ( 0 , 1 ) , β ( 0 , 1 ) , δ ( 0 , 1 ) , γ ( 0 , 1 σ 2 ) and ν ( 0 , 1 ς 2 γ A 2 ) ;
  • { λ n } and { μ n } are two sequences in [ 0 , 1 ] satisfying 0 < lim inf n λ n lim sup n λ n 1 , lim n μ n = 0 , and n μ n = .
In the sequel, suppose Γ . Next, we first introduce an iterative algorithm for solving the split problem (1).
To obtain our main theorem, we first show several propositions.
Proposition 1.
The sequences { z n } , { u n } and { t n } are bounded.
Proof. 
Let p be a fixed point in Γ . Then, p = T ( p ) , A p = S ( A p ) and p ( f + g ) 1 ( 0 ) . Based on Lemma 3, we have T ( p ) ν A * ( I S ) A p = p for all ν > 0 .
By (36), we have z n v n = z n T ( z n ) + ν A * ( I S ) A z n . Then, we obtain
z n v n 2 = z n T ( z n ) + ν A * ( I S ) A z n 2 ( z n T ( z n ) + ν A ( I S ) A z n ) 2 2 z n T ( z n ) 2 + 2 ν 2 A 2 ( I S ) A z n 2 ,
and
z n v n , z n p = z n T ( z n ) , z n p + ν A * ( I S ) A z n , z n p = z n T ( z n ) , z n p + ν ( I S ) A z n , A z n A p .
Since S , T are ς -demicontractive and σ -demicontractive, respectively, from (6), we deduce
( I S ) A z n , A z n A p = ( I S ) A z n ( I S ) A p , A z n A p 1 ς 2 ( I S ) A z n 2 ,
and
z n T ( z n ) , z n p = ( I T ) z n ( I T ) p , z n p 1 σ 2 z n T ( z n ) 2 .
So, from (12)–(14), we get
z n v n , z n p 1 σ 2 z n T ( z n ) 2 + ν ( 1 ς ) 2 ( I S ) A z n 2 .
By virtue of (8) and (37), we have
u n p 2 = z n p γ ( z n v n ) 2 = z n p 2 2 γ z n p , z n v n + γ 2 z n v n 2 .
Substituting (11) and (15) into (16) to deduce
u n p 2 z n p 2 γ ( 1 σ ) z n T ( z n ) 2 γ ν ( 1 ς ) ( I S ) A z n 2 + 2 γ 2 z n T ( z n ) 2 + 2 γ 2 ν 2 A 2 ( I S ) A z n 2 = z n p 2 γ ( 1 σ 2 γ ) z n T ( z n ) 2 γ ν ( 1 ς 2 γ ν A 2 ) ( I S ) A z n 2 z n p 2 .
Since γ ( 0 , 1 σ 2 ) and ν ( 0 , 1 ς 2 γ A 2 ) , it follows from (17) that u n p z n p . Note that
w n p + α ρ n ( g ( u n ) g ( w n ) ) 2 = w n p 2 + 2 α ρ n g ( u n ) g ( w n ) , w n p + α 2 ρ n 2 g ( u n ) g ( w n ) 2 = u n p 2 + w n u n 2 + 2 w n u n , u n w n + 2 w n u n , w n p + 2 α ρ n g ( u n ) g ( w n ) , w n p + α 2 ρ n 2 g ( u n ) g ( w n ) 2 = u n p 2 + 2 w n u n + α ρ n ( g ( u n ) g ( w n ) ) , w n p w n u n 2 + α 2 ρ n 2 g ( u n ) g ( w n ) 2 .
Thanks to (38), we gain
u n w n α ρ n ( g ( u n ) g ( w n ) ) α ρ n ( f + g ) ( w n ) .
Since 0 α ρ n ( f + g ) ( p ) , it follows from (19) and the monotonicity of α ρ n ( f + g ) that
w n u n + α ρ n ( g ( u n ) g ( w n ) ) , w n p 0 .
Combining (40), (18) and (20), we have
w n p + α ρ n ( g ( u n ) g ( w n ) ) 2 u n p 2 w n u n 2 + α 2 ρ n 2 g ( u n ) g ( w n ) 2 u n p 2 w n u n 2 + β 2 u n w n 2 = u n p 2 ( 1 β 2 ) u n w n 2 .
In light of (10) and (39), we derive
t n p 2 = ( 1 λ n ) ( u n p ) + λ n [ w n p + α ρ n ( g ( u n ) g ( w n ) ) ] 2 = ( 1 λ n ) u n p 2 + λ n w n p + α ρ n ( g ( u n ) g ( w n ) ) 2 λ n ( 1 λ n ) w n u n + α ρ n ( g ( u n ) g ( w n ) ) 2 ,
which together with (21) implies that
t n p 2 ( 1 λ n ) u n p 2 + λ n ( u n p 2 ( 1 β 2 ) u n w n 2 ) λ n ( 1 λ n ) w n u n + α ρ n ( g ( u n ) g ( w n ) ) 2 = u n p 2 λ n ( 1 β 2 ) u n w n 2 λ n ( 1 λ n ) w n u n + α ρ n ( g ( u n ) g ( w n ) ) 2 u n p 2 .
From (41), we obtain
z n + 1 p = μ n ( u p ) + ( 1 μ n ) ( t n p ) μ n u p + ( 1 μ n ) t n p μ n u p + ( 1 μ n ) z n p max { u p , z 0 p } .
Then, { z n } is bounded and so are { u n } (by (17)) and { t n } (by (22)). □
Proposition 2.
1 lim sup n s n < + , where
s n = ( 1 μ n ) γ ν ( 1 ς 2 γ ν A 2 ) ( I S ) A z n 2 μ n ( 1 μ n ) λ n ( 1 β 2 ) u n w n 2 μ n ( 1 μ n ) γ ( 1 σ 2 γ ) z n T ( z n ) 2 μ n + 2 u p , z n + 1 p ( 1 μ n ) λ n ( 1 λ n ) w n u n + α ρ n ( g ( u n ) g ( w n ) ) 2 μ n ,
for all n 0 .
Proof. 
From (9) and (41), we acquire
z n + 1 p 2 = μ n ( u p ) + ( 1 μ n ) ( t n p ) 2 ( 1 μ n ) t n p 2 + 2 μ n u p , z n + 1 p .
Taking into account (17) and (22), we attain
t n p 2 z n p 2 γ ( 1 σ 2 γ ) z n T ( z n ) 2 λ n ( 1 β 2 ) u n w n 2 λ n ( 1 λ n ) w n u n + α ρ n ( g ( u n ) g ( w n ) ) 2 γ ν ( 1 ς 2 γ ν A 2 ) ( I S ) A z n 2 .
By (23) and (24), we have
z n + 1 p 2 ( 1 μ n ) z n p 2 ( 1 μ n ) γ ( 1 σ 2 γ ) z n T ( z n ) 2 ( 1 μ n ) λ n ( 1 λ n ) w n u n + α ρ n ( g ( u n ) g ( w n ) ) 2 ( 1 μ n ) γ ν ( 1 ς 2 γ ν A 2 ) ( I S ) A z n 2 ( 1 μ n ) λ n ( 1 β 2 ) u n w n 2 + 2 μ n u p , z n + 1 p = ( 1 μ n ) z n p 2 + μ n { ( 1 μ n ) γ ( 1 σ 2 γ ) z n T ( z n ) 2 μ n ( 1 μ n ) λ n ( 1 λ n ) w n u n + α ρ n ( g ( u n ) g ( w n ) ) 2 μ n ( 1 μ n ) λ n ( 1 β 2 ) u n w n 2 μ n + 2 u p , z n + 1 p ( 1 μ n ) γ ν ( 1 ς 2 γ ν A 2 ) ( I S ) A z n 2 μ n } .
Set r n = z n p 2 and
s n = ( 1 μ n ) γ ν ( 1 ς 2 γ ν A 2 ) ( I S ) A z n 2 μ n ( 1 μ n ) λ n ( 1 β 2 ) u n w n 2 μ n ( 1 μ n ) γ ( 1 σ 2 γ ) z n T ( z n ) 2 μ n + 2 u p , z n + 1 p ( 1 μ n ) λ n ( 1 λ n ) w n u n + α ρ n ( g ( u n ) g ( w n ) ) 2 μ n ,
for all n 0 .
On account of (25), we obtain
r n + 1 ( 1 μ n ) r n + μ n s n , n 0 .
From (26), we have
s n 2 u p , z n + 1 p 2 u p z n + 1 p
which leads to lim sup n s n < + .
Now, we show lim sup n s n 1 . If lim sup n s n < 1 , then there is an integer m N fulfilling s n < 1 , n m . As a result of (27), we get r n + 1 r n μ n when n m . It follows that r n + 1 r m i = m n μ i and so lim sup n r n + 1 r m lim sup n i = m n μ i = which is a contradiction because r n + 1 = z n + 1 p 2 0 . Therefore, 1 lim sup n s n < + . □
Proposition 3.
Suppose that I S and I T are demiclosed at origin. Then, ω w ( z n ) Γ .
Proof. 
Thanks to Propositions 1 and 2, we conclude that { z n } and lim sup n s n are bounded. Choose any p ω w ( z n ) . Thus, there exist { z n k } { z n } and { s n k } { s n } satisfying z n k p ( k ) and
lim sup n s n = lim k s n k = lim k { ( 1 μ n k ) λ n k ( 1 λ n k ) w n k u n k + α ρ n k ( g ( u n k ) g ( w n k ) ) 2 μ n k ( 1 μ n k ) γ ν ( 1 ς 2 γ ν A 2 ) ( I S ) A z n k 2 μ n k + 2 u p , z n k + 1 p ( 1 μ n k ) γ ( 1 σ 2 γ ) z n k T ( z n k ) 2 μ n k ( 1 μ n k ) λ n k ( 1 β 2 ) u n k w n k 2 μ n k } .
Since { z n k + 1 } is bounded, without loss of generality, we assume that lim k u p , z n k + 1 p exists. This together with (28) implies that
lim k { ( 1 μ n k ) γ ( 1 σ 2 γ ) z n k T ( z n k ) 2 μ n k ( 1 μ n i ) λ n k ( 1 β 2 ) u n k w n k 2 μ n k ( 1 μ n k ) λ n k ( 1 λ n k ) w n k u n k + ρ n k ( g ( u n k ) g ( w n k ) ) 2 μ n k ( 1 μ n k ) γ ν ( 1 ς 2 γ ν A 2 ) ( I S ) A z n k 2 μ n k } exists .
Hence,
lim k z n k T ( z n k ) = 0 ,
lim k ( I S ) A z n k = 0 ,
lim k u n k w n k = 0 ,
and
lim k w n k u n k + ρ n k ( g ( u n k ) g ( w n k ) ) = 0 .
By (36), z n k v n k z n k T ( z n ) + ν A ( I S ) A z n k . It follows from (29) and (30) that lim k z n k v n k = 0 . This together with (37) implies that
lim k u n k z n k = 0 and u n k p ( k ) .
Since A z n k A p ( k ) and I S is demiclosed at the origin, by (30), we obtain A p Fix ( S ) . Since z n k p ( k ) and I T is demiclosed at the origin, from (29), we deduce that p Fix ( T ) .
Finally, we show p ( f + g ) 1 ( 0 ) . Let ( u , v ) Graph ( f + g ) . Thus, v g ( u ) f ( u ) . Owing to u n k w n k α ρ n k g ( u n k ) f ( w n k ) , by the monotonicity of f, we deduce
v g ( u ) u n k w n k α ρ n k + g ( u n k ) , u w n k 0 .
It follows that
v , u w n k g ( u ) g ( u n k ) + u n k w n k α ρ n k , u w n k = g ( u ) g ( w n k ) , u w n k + g ( w n k ) g ( u n k ) , u w n k + u n k w n k α ρ n k , u w n k .
At the same time, by the monotonicity of g, we have g ( u ) g ( w n k ) , u w n k 0 . This together with (34) implies that
v , u w n k g ( w n k ) g ( u n k ) , u w n k + u n k w n k α ρ n k , u w n k .
By (31) and the Lipschitz continuity of g, we deduce g ( w n k ) g ( u n k ) 0 ( k ) . It follows from (35) that v , u p 0 . Taking into account Lemma 2 and (5), we conclude that p ( f + g ) 1 ( 0 ) . Therefore, p Γ and ω w ( z n ) Γ . □
Finally, according to Propositions 1–3, we show our main theorem.
Theorem 1.
If I T and I S are demiclosed at the origin, then the sequence { z n } generated by Algorithm 1 converges strongly to proj Γ ( u ) .
Algorithm 1: Tseng-type method I.
Let u H 1 be a fixed point and z 0 H 1 , ρ 0 > 0 be two initial points.
Step 1. Assume that z n is given. Compute
v n = T ( z n ) ν A * ( I S ) A z n ,
and
u n = z n γ ( z n v n ) .
Step 2. Compute
w n = ( I + α ρ n f ) 1 ( u n α ρ n g ( u n ) ) ,
and
t n = ( 1 λ n ) u n + λ n [ w n + α ρ n ( g ( u n ) g ( w n ) ) ] ,
where ρ n = max { 1 , δ , δ 2 , } such that
α ρ n g ( u n ) g ( w n ) β u n w n .
Step 3. Compute
z n + 1 = μ n u + ( 1 μ n ) t n .
Set n : = n + 1 and return to Step 1.
Proof. 
First, by (39) and (41), We have
z n k + 1 z n k = μ n k ( u z n k ) + ( 1 μ n k ) ( t n k z n k ) μ n k u z n k + ( 1 μ n k ) ( 1 λ n k ) u n k z n k + ( 1 μ n k ) λ n k w n k u n k + α ρ n k ( g ( u n k ) g ( w n k ) ) .
Combining (32), (33), and (42), we obtain z n k + 1 z n k 0 ( k ) and z n k + 1 p Γ ( k ) .
Select p = proj Γ ( u ) . Take into account of (28), we get
lim sup n s n lim k 2 u proj Γ ( u ) , z n k + 1 proj Γ ( u ) = 2 u proj Γ ( u ) , p proj Γ ( u ) .
This together with (7) implies that
lim sup n s n 0 .
By virtue of (25), we acquire
z n + 1 proj Γ ( u ) 2 ( 1 μ n ) z n proj Γ ( u ) 2 + 2 μ n u proj Γ ( u ) , z n + 1 proj Γ ( u ) .
In view of (43) and Lemma 4, we conclude that z n proj Γ ( u ) as n . □
Setting T = I in Algorithm 2 and Theorem 1, we obtain the following algorithm and corollary.
Algorithm 2: Tseng-type method II.
Let u H 1 be a fixed point and z 0 H 1 , ρ 0 > 0 be two initial points.
Step 1. Assume that z n is given. Compute
v n = z n ν A * ( I S ) A z n ,
and
u n = z n γ ( z n v n ) .
Step 2. Compute
w n = ( I + α ρ n f ) 1 ( u n α ρ n g ( u n ) ) ,
and
t n = ( 1 λ n ) u n + λ n [ w n + α ρ n ( g ( u n ) g ( w n ) ) ] ,
where ρ n = max { 1 , δ , δ 2 , } such that
α ρ n g ( u n ) g ( w n ) β u n w n .
Step 3. Compute
z n + 1 = μ n u + ( 1 μ n ) t n .
Set n : = n + 1 and return to Step 1.
Corollary 1.
If I S is demiclosed at the origin, then the sequence { z n } generated by Algorithm 2 converges strongly to proj Γ 1 ( u ) , where Γ 1 : = { x ( f + g ) 1 ( 0 ) , A x Fix ( S ) } .

4. Conclusions

In this paper, we investigate iterative algorithms for solving the split fixed points and variational inclusion in Hilbert spaces. We propose an iterative method which consists of fixed point method, Tseng-type splitting method and self-adaptive method for finding a solution of the considered split problem in which the involved fixed point operators S and T are all demicontractive and another operator g is plain monotone. We show that the sequence generated the constructed algorithm converges strongly to a solution of the investigated split problem provided some additional conditions are satisfied.

Author Contributions

Writing—original draft preparation, L.-J.Z. and Y.Y.; writing—review, L.-J.Z. and Y.Y. All the authors have contributed equally to this paper. All authors have read and agreed to the published version of the manuscript.

Funding

Li-Jun Zhu was supported in part by the National Natural Science Foundation of China (grant number 11861003), the Natural Science Foundation of Ningxia province (grant number NZ17015), the Major Research Projects of NingXia (grant numbers 2021BEG03049) and Major Scientific and Technological Innovation Projects of YinChuan (grant numbers 2022RKX03 and NXYLXK2017B09).

Data Availability Statement

Not Applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. 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]
  2. Abbas, M.; Ibrahim, Y.; Khan, A.R.; de la Sen, M. Strong convergence of a system of generalized mixed equilibrium problem, split variational inclusion problem and fixed point problem in Banach spaces. Symmetry 2019, 11, 722. [Google Scholar] [CrossRef] [Green Version]
  3. Aberqi, A.; Benslimane, O.; Elmassoudi, M.; Ragusa, M.A. Nonnegative solution of a class of double phase problems with logarithmic nonlinearity. Bound. Value Probl. 2022, 2022, 57. [Google Scholar] [CrossRef]
  4. Arfat, Y.; Kumam, P.; Khan, M.A.A.; Sa Ngiamsunthorn, P. Ngiamsunthorn, An accelerated projection-based parallel hybrid algorithm for fixed point and split null point problems in Hilbert spaces. Math. Method Appl. Sci. 2021. [Google Scholar] [CrossRef]
  5. 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. [Google Scholar] [CrossRef]
  6. Hanjing, A.; Suantai, S. Hybrid inertial accelerated algorithms for split fixed point problems of demicontractive mappings and equilibrium problems. Numer. Algor. 2020, 85, 1051–1073. [Google Scholar] [CrossRef]
  7. Husain, S.; Asad, M.; Khairoowala, M. Strong convergence algorithm for the split problem of variational inclusions, split generalized equilibrium problem and fixed point problem. Armen. J. Math. 2021, 13, 1–32. [Google Scholar] [CrossRef]
  8. Husain, S.; Asad, M.; Khairoowala, M. Viscosity approximation methods for split common fixed point problems without prior knowledge of the operator norm. Filomat 2020, 34, 761–777. [Google Scholar]
  9. Okeke, C.C.; Ugwunnadi, G.C.; Jolaoso, L.O. An extragradient inertial algorithm for solving split fixed-point problems of demicontractive mappings, with equilibrium and variational inequality problems. Demonstr. Math. 2022, 55, 506–527. [Google Scholar] [CrossRef]
  10. Wang, F. A new iterative method for the split common fixed point problem in Hilbert spaces. Optimization 2017, 66, 407–415. [Google Scholar] [CrossRef]
  11. Wang, Y.; Fang, X.; Guan, J.L.; Kim, T.H. On split null point and common fixed point problems for multivalued demicontractive mappings. Optimization 2021, 70, 1121–1140. [Google Scholar] [CrossRef]
  12. Wang, Y.; Yuan, M.; Jiang, B. Multi-step inertial hybrid and shrinking Tsengs algorithm with Meir-Keeler contractions for variational inclusion problems. Mathematics 2021, 9, 1548. [Google Scholar] [CrossRef]
  13. Zhou, Z.; Tan, B.; Li, S. Adaptive hybrid steepest descent algorithms involving an inertial extrapolation term for split monotone variational inclusion problems. Math. Appl. Sci. 2021, 45, 8835–8853. [Google Scholar] [CrossRef]
  14. Censor, Y.; Segal, A. The split common fixed point problem for directed operators. J. Convex Anal. 2009, 16, 587–600. [Google Scholar]
  15. Moudafi, A. The split common fixed-point problem for demicontractive mappings. Inverse Probl. 2010, 26, 55007. [Google Scholar] [CrossRef]
  16. Zheng, X.; Yao, Y.; Liou, Y.C.; Leng, L. Fixed point algorithms for the split problem of demicontractive operators. J. Nonlinear Sci. Appl. 2017, 10, 1263–1269. [Google Scholar] [CrossRef] [Green Version]
  17. Alvarez, F.; Attouch, H. An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal. 2001, 9, 3–11. [Google Scholar] [CrossRef]
  18. Passty, G.B. Ergodic convergence to a zero of the sum of monotone operators in Hilbert space. J. Math. Anal. Appl. 1979, 72, 383–390. [Google Scholar] [CrossRef] [Green Version]
  19. Akram, M.; Dilshad, M.; Rajpoot, A.K.; Babu, F.; Ahmad, R.; Yao, J.C. Modified iterative schemes for a fixed point problem and a split variational inclusion problem. Math. Methods Appl. Sci. 2022, 10, 2098. [Google Scholar] [CrossRef]
  20. Altiparmak, E.; Karahan, I. A new preconditioning algorithm for finding a zero of the sum of two monotone operators and its application to image restoration problems. Int. J. Comput. Math. 2022, 99, 2482–2498. [Google Scholar] [CrossRef]
  21. Dey, S. A hybrid inertial and contraction proximal point algorithm for monotone variational inclusions. Numer. Algor. 2022. [Google Scholar] [CrossRef]
  22. Enyi, C.D.; Shehu, Y.; Iyiola, O.S.; Yao, J.C. Convergence analysis of modified inertial forward-backward splitting scheme with applications. Math. Method Appl. Sci. 2021, 45, 3933–3948. [Google Scholar] [CrossRef]
  23. Malitsky, Y.; Tam, M.K. A forward-backward splitting method for monotone inclusions without cocoercivity. SIAM J. Optim. 2020, 30, 1451–1472. [Google Scholar] [CrossRef]
  24. Peeyada, P.; Suparatulatorn, R.; Cholamjiak, W. An inertial Mann forward-backward splitting algorithm of variational inclusion problems and its applications. Chaos Soliton. Fract. 2022, 158, 112048. [Google Scholar] [CrossRef]
  25. Rahaman, M.; Ishtyak, M.; Ahmad, I.; Ahmad, R. Split monotone variational inclusion problem involving Cayley operators. Georgian Math. J. 2022, 29, 897–911. [Google Scholar] [CrossRef]
  26. Lions, P.L.; Mercier, B. Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 1979, 16, 964–979. [Google Scholar] [CrossRef]
  27. Tseng, P. A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 2000, 38, 431–446. [Google Scholar] [CrossRef]
  28. Cholamjiak, P.; Van Hieu, D.; Cho, Y.J. Relaxed forward-backward splitting methods for solving variational inclusions and applications. J. Sci. Comput. 2021, 88, 85. [Google Scholar] [CrossRef]
  29. Ticala, C.; Zelina, I.; Pintea, C.M. Admissible perturbation of demicontractive operators within ant algorithms for medical images edge detection. Mathematics 2020, 8, 1040. [Google Scholar] [CrossRef]
  30. Brezis, H.; Chapitre, I.I. Operateurs maximaux monotones. North-Holland Math. Stud. 1973, 5, 19–51. [Google Scholar]
  31. Xu, H.K. Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002, 66, 240–256. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhu, L.-J.; Yao, Y. Algorithms for Approximating Solutions of Split Variational Inclusion and Fixed-Point Problems. Mathematics 2023, 11, 641. https://doi.org/10.3390/math11030641

AMA Style

Zhu L-J, Yao Y. Algorithms for Approximating Solutions of Split Variational Inclusion and Fixed-Point Problems. Mathematics. 2023; 11(3):641. https://doi.org/10.3390/math11030641

Chicago/Turabian Style

Zhu, Li-Jun, and Yonghong Yao. 2023. "Algorithms for Approximating Solutions of Split Variational Inclusion and Fixed-Point Problems" Mathematics 11, no. 3: 641. https://doi.org/10.3390/math11030641

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