Next Article in Journal
Moving Spatial Turbulence Model for High-Fidelity Rotorcraft Maneuvering Simulation
Next Article in Special Issue
An Application to Fixed-Point Results in Tricomplex-Valued Metric Spaces Using Control Functions
Previous Article in Journal
Target Function without Local Minimum for Systems of Logical Equations with a Unique Solution
Previous Article in Special Issue
A New Construction and Convergence Analysis of Non-Monotonic Iterative Methods for Solving ρ-Demicontractive Fixed Point Problems and Variational Inequalities Involving Pseudomonotone Mapping
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Modified Iterative Schemes for a Fixed Point Problem and a Split Variational Inclusion Problem

1
Department of Mathematics, Faculty of Science, Islamic University of Madinah, Medina 42351, Saudi Arabia
2
Computational & Analytical Mathematics and Their Applications Research Group, Department of Mathematics, Faculty of Science, University of Tabuk, Tabuk 71491, Saudi Arabia
3
Department of Mathematics, Aligarh Muslim University, Aligarh 202002, India
4
Department of Applied Mathematics, Aligarh Muslim University, Aligarh 202002, India
5
Research Center for Interneural Computing, China Medical University Hospital, China Medical University, Taichung 40402, Taiwan
*
Authors to whom correspondence should be addressed.
Mathematics 2022, 10(12), 2098; https://doi.org/10.3390/math10122098
Submission received: 25 May 2022 / Revised: 12 June 2022 / Accepted: 14 June 2022 / Published: 16 June 2022
(This article belongs to the Special Issue New Advances in Functional Analysis)

Abstract

:
In this paper, we alter Wang’s new iterative method as well as apply it to find the common solution of fixed point problem (FPP) and split variational inclusion problem ( S p VIP) in Hilbert space. We discuss the weak convergence for ( S p VIP) and strong convergence for the common solution of ( S p VIP) and (FPP) using appropriate assumptions. Some consequences of the proposed methods are studied. We compare our iterative schemes with other existing related schemes.

1. Introduction

Variational inclusions, which are the generalized forms of variational inequalities, are useful to deal with the problems arising in mechanics, optimization, economics, nonlinear programming, and many other problems occuring in pure and applied sciences. The split feasibility problem (SFP) was initially studied by Censor and Elfving [1] for the reconstruction of medical images. This split feasibility problem has also been considered by many researchers (see, for example, [2,3,4,5] and references therein). Furthermore, a novel problem was proposed by Censor et al. [6] by combing both (SFP) and variational inequality problem (VIP) and they call it split variational inequality problem (SVIP).
That is , the problem of finding u C such that u VIP ( f ; C )   and   A u VIP ( g ; Q ) ,
where H 1 and H 2 are Hilbert spaces, C H 1 , Q H 2 are closed, convex subsets, f : H 1 H 1 and g : H 2 H 2 are two operators, and A : H 1 H 2 is a bounded linear operator; VIP ( f ; C ) = { y C : f ( y ) , u y 0 , u C } and VIP ( g ; Q ) = { z Q : g ( z ) , u z 0 , u Q } .
Split variational inclusion problems are applicable in intensity-modulated radiation therapy treatment planning, modeling many inverse problem arising for phase retrieval and many other problems of day-to-day life. For more applications of the related subject, we refer to [7].
Moudafi [8] extended (SVIP) and call it split monotone variational inclusion problem ( S p MVIP ).
That is , the problem of finding u H 1 such that u VI ( f , G 1 ; H 1 )   and   A u VI ( g , G 2 ; H 2 ) ,
where G 1 : H 1 2 H 1 and G 2 : H 2 2 H 2 are set-valued operators, VI ( f , G 1 ; H 1 ) = { y H 1 : 0 f ( y ) + G 1 ( y ) } and VI ( g , G 2 ; H 2 ) = { z H 2 : 0 g ( z ) + G 2 ( z ) } .
Moudafi [8] formulated the following iterative scheme to solve ( S p MVIP ).
For initial point u 0 H 1 , compute
u n + 1 = U [ u n + γ A ( V I ) A u n ] ,
where γ ( 0 , 1 / L ) , L is the spectral radius of the operator A A , A is the adjoint of A, U = J λ G 1 ( I λ f ) = ( I + λ G 1 ) 1 ( I λ f ) , V = J λ G 2 ( I λ g ) = ( I + λ G 2 ) 1 ( I λ g ) and λ > 0 .
Let N C ( u ) = z H 1 : z , y u 0 , y C and N Q ( u ) = w H 2 : w , y u 0 , y Q be the normal cones. If G 1 = N C and G 2 = N Q , then ( S p MVIP ) reduces to split variational inequality problem (SVIP). If f = g = 0 , then ( S p MVIP ) coincides with the split variational inclusion problem (S p VIP) studied by Byrne et al. [9].
That is , find u H 1 such that u VI ( G 1 ; H 1 )   and   A u VI ( G 2 ; H 2 ) ,
where VI ( G 1 ; H 1 ) = { y H 1 : 0 G 1 ( y ) } and VI ( G 2 ; H 2 ) = { z H 2 : 0 G 2 ( z ) } , G 1 , G 2 are the same as in (2). We denote the solution set of ( S p VIP ) by Δ . Moreover, Byrne et al. [9] furnished the following scheme to investigate ( S p VIP ).
For initial point u 0 H 1 , compute
u n + 1 = J λ G 1 [ u n γ A ( I J λ G 2 ) A u n ] ,
where λ > 0 , γ ( 0 , 2 L ) and L = || A A || .
Let T : H 1 H 1 be a nonexpansive mapping, then (FPP) is to find x H 1 so that T ( x ) = x and Fix ( S ) means the set of fixed points of S.
Kazmi and Rizvi [10] investigated the common solution of ( S p VIP ) and (FPP). They obtain the common solution of ( S p VIP ) by using the following scheme:
w n = J λ G 1 [ u n + μ A ( J λ G 2 I ) A u n ] , u n + 1 = α n ψ ( u n ) + ( 1 α n ) T ( w n ) ,
where ψ is a contraction mapping, α ( 0 , 1 ) , μ ( 0 , 1 L ) , L is the spectral radius of A A , α n ( 0 , 1 ) is a real sequence, and λ > 0 . Inspired by the work of [8,9,10], many authors have studied ( S p VIP ) and ( FPP ) in diverse directions using different techniques (see, for example, [11,12,13,14,15,16,17,18,19,20]).
In view of calculation of || A || , which is not easy to calculate in practice, Yang [21] studied the (SFP) such that prior calculation of || A || is not required.
In 2017, Wang [22,23] studied the split common fixed point problem (SCFP).
That is , find u Fix ( S ) such that A u Fix ( T ) .
However, Wang [23] discussed Yang’s step size τ n related to the scheme (3) with U = S and V = T and stated that it is inconvenient to establish the convergence of (3) with the following step size:
τ n = ρ n || A ( I T ) A u n || ,
where { ρ n } is a positive real sequence such that
n = 1 ρ n =   and   n = 1 ρ n 2 < .
To overcome this difficulty, Wang [23] analyzed the weak convergence to the (SCFP) by setting up following scheme with step size τ n = ρ n .
Wang [22] studied the weak convergence of Algorithm 1 to investigate the solution of (SCFP) with the step size τ n = || u n S u n || 2 + || A ( I T ) A u n || 2 || u n S u n + A ( I T ) A u n || 2 , such that precalculation of || A || is not required.
Algorithm 1 Weak convergence.
    Choose arbitrary initial point x 0 and assume that x n has been calculated. If || u n S u n + A ( I T ) A u n || = 0 , then stop; otherwise, continue and compute the next iteration by the formula:
u n + 1 = u n τ n ( I S ) u n + A ( I T ) A u n , for all n 0 .
Motivated and inspired by the work of [8,9,10,22,23], we propose two iterative schemes by modifying the Wang’s scheme (9) with a new step size τ = 1 1 + || A || 2 .
We inspect the weak convergence of suggested scheme for ( S p VIP ), which is a viscosity type iterative scheme for the common solution of ( S p VIP ) and ( FPP ). We also prove the strong convergence of our scheme. Some consequences of the proposed schemes are given. We demonstrate our methods by a numerical example and showing the efficiency of step size τ in comparison of τ n and ρ n . Our results can be seen as different version of Wang’s methods studied in [22,23].

2. Preliminaries

Throughout the paper, we assume that H is a real Hilbert space with the norm || · || and inner product · , · . Let C be a nonempty, closed, and convex subset of H. We denote the set of all weak cluster points of the sequence { x n } by ω W ( x n ) .
The following concepts and results are essential for the proof of the main result.
Definition 1.
A mapping T : H H is said to be contraction if
|| T ( u ) T ( v ) || κ || u v || , κ ( 0 , 1 ) , for all u , v H .
T is nonexpansive if κ = 1 .
Definition 2.
The mapping T : H H is said to be firmly nonexpansive if
|| T ( u ) T ( v ) || 2 u v , T ( u ) T ( v ) , for all u , v H .
Definition 3.
The mapping T : H H is said to be μ-inverse strongly monotone if there exists a constant μ > 0 such that
T ( u ) T ( v ) , u v μ || T ( u ) T ( v ) || 2 , f o r   a l l   u , v H .
Definition 4.
A nonexpansive mapping T : C H is said to be α-averaged, if there exists a nonexpansive operator R : C H such that T = ( 1 α ) I + α R , α ( 0 , 1 ) . Clearly, if T is averaged, then it is nonexpansive.
Definition 5.
An operator P C is said to be a metric projection of H onto C if
|| u P C ( u ) || || u v || , f o r   a n y   u H a n d v C .
Note that P C is firmly nonexpansive and characterized by u P C ( v ) , v P C ( u ) 0 for all u H and v C .
For any t 1 , t 2 H and α ( 0 , 1 ) , the following equation holds:
|| α t 1 ( 1 α ) t 2 || 2 = α || t 1 || 2 + ( 1 α ) || t 2 || 2 α ( 1 α ) || t 1 t 2 || 2 .
Let G : H 2 H be a set-valued operator. Then,
(i)
The set { ( u , y ) : y G ( u ) } denotes the graph of G,
(ii)
J λ G = ( I + λ G ) 1 , λ > 0 denotes the resolvent of G,
(iii)
G 1 ( u ) = { x H : u G ( x ) } denotes the inverse of G.
Definition 6.
A set-valued mapping G : H 2 H is said to be monotone, if
x y , u v 0 , for all x G ( u ) , y G ( v ) .
It is well known that resolvent operator of a maximal monotone operator is single-valued and firmly nonexpansive.
Definition 7.
A mapping T : H H is said to be demiclosed at zero if, for any sequence { x n } in H, x n x 0 such that T ( x n ) 0 imply T ( x 0 ) = 0 .
Definition 8
([24]). (Demiclosedness Principle): Let T : H H be an operator with Fix ( T ) ϕ . If { u n } is a sequence in C, u n u C such that { ( I T ) u n } 0 imply ( I T ) ( u ) = 0 .
Remark 1
([25]). If T : H H is nonexpansive, then I T is demiclosed at zero. Moreover, if T is firmly nonexpansive, then I T is firmly nonexpansive.
Lemma 1
([25], Corollary 23.10). If G : H 2 H is a maximal monotone operator, then J λ G and I J λ G are firmly nonexpansive.
Definition 9
([22]). A sequence { u n } in a Hilbert space H is said to be Féjer monotone with respect to C, if
|| u n + 1 p || || u n p || , f o r a l l n 0   a n d   p C ,   w h e r e   C   i s   a   c l o s e d   c o n v e x   s u b s e t   o f   H .
Lemma 2
([26]). Let the sequence { u n } be Féjer monotone with respect to C; then,
(i) 
u n u C , i f a n d o n l y i f ω W ( u n ) C ,
(ii) 
{ P C ( u n ) } converges strongly,
(iii) 
if u n u C , then u = lim n P C ( u n ) .
Lemma 3
([27]). If { ζ n } is a nonnegative real sequence satisfying ζ n + 1 ( 1 μ n ) ζ n + δ n , for all n 0 , where { μ n } is a sequence in ( 0 , 1 ) and { δ n } is a real sequence such that:
(i) 
n = 1 μ n = ,
(ii) 
lim sup n δ n μ n 0 or lim sup n | δ n | < .
Then, lim n ζ n = 0 .
Lemma 4.
If α , β , and γ are positive real numbers, then α 2 + β 2 γ ( α + β ) 2 1 + γ holds.
Proof. 
For any positive real numbers α , β , and γ , we estimate
0 1 γ + 1 γ α β γ 2 = γ γ + 1 α 2 + 1 γ ( γ + 1 ) β 2 1 γ + 1 2 α β = ( 1 1 γ + 1 ) α 2 + ( 1 γ 1 γ + 1 ) β 2 2 1 + γ α β = α 2 + β 2 γ ( α + β ) 2 1 + γ ,
which implies that α 2 + β 2 γ ( α + β ) 2 1 + γ . □
Lemma 5.
A mapping M : H H is τ-inverse strongly monotone, if and only if ( I τ M ) is firmly nonexpansive, for τ > 0 .
Proof. 
Let ( I τ M ) be firmly nonexpansive, that is,
( I τ M ) x ( I τ M ) y , x y || ( I τ M ) x ( I τ M ) y || 2 x y , x y τ M ( x ) M ( y ) , x y || x y || 2 2 τ M ( x ) M ( y ) , x y + τ 2 || M ( x ) M ( y ) || 2 || x y || 2 τ M ( x ) M ( y ) , x y || x y || 2 2 τ M ( x ) M ( y ) , x y + τ 2 || M ( x ) M ( y ) || 2 , which   implies   that M ( x ) M ( y ) , x y τ || M ( x ) M ( y ) || 2 .
Thus, M : H H is τ -inverse strongly monotone.
Conversely, it is easy to show that if M : H H is τ -inverse strongly monotone, then ( I τ M ) is firmly nonexpansive. □
Theorem 1
([28]). (Krasnosel’skii–Mann theorem) Let M : H H be an averaged operator such that Fix ( M ) ϕ . Then, for initial point u 0 , we have M n u 0 u Fix ( M ) .

3. Main Results

Unless otherwise specified, we assume that H 1 and H 2 are real Hilbert spaces, A : H 1 H 2 is a bounded linear operator, A is the adjoint of A, G 1 : H 1 2 H 1 , G 2 : H 2 2 H 2 are the set-valued maximal monotone operators, and T : H 1 H 1 is a nonexpansive mapping.
We consider the following problem:
Find θ H 1 such that θ Fix ( T ) Δ .
We mention some necessary results below:
Lemma 6
([10]). x H 1 and y = A x H 2 solve ( S p VIP ), if and only if
x = J λ 1 G 1 ( x ) and y = J λ 2 G 2 ( y ) , f o r s o m e λ 1 , λ 2 > 0 .
Lemma 7
([13]). x H 1 solves ( S p VIP ), if and only if
|| x J λ 1 G 1 ( x ) + A ( I J λ 2 G 2 ) A x || = 0 , f o r a l l λ 1 , λ 2 > 0 .
Lemma 8
([13]). Let { x n } be a bounded sequence. If for any λ 1 , λ 2 > 0
lim n || x n J λ 1 G 1 ( x n ) + A ( I J λ 2 G 2 ) A x n || = 0 ,
then
lim n || ( I J λ 1 G 1 ) x n || = lim n || ( I J λ 2 G 2 ) A x n || = 0 .
Lemma 9.
Let G 1 : H 1 2 H 1 and G 2 : H 2 2 H 2 be set-valued maximal monotone operators. Then, for λ 1 , λ 2 > 0 , the operator I τ [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] is firmly nonexpansive, where τ = 1 1 + || A || 2 , A is a bounded linear operator and A is adjoint of A.
Proof. 
Let M = [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] . Since G 1 and G 2 are maximal monotone, by Lemma 1, it follows that the operators ( I J λ 1 G 1 ) and ( I J λ 2 G 2 ) are firmly nonexpansive. As A is a bounded linear operator and A is adjoint of A, we have
M ( x ) M ( y ) , x y = [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] x [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] y , x y = ( I J λ 1 G 1 ) x ( I J λ 1 G 1 ) y , x y + A ( I J λ 2 G 2 ) A x A ( I J λ 2 G 2 ) A y , x y = ( I J λ 1 G 1 ) x ( I J λ 1 G 1 ) y , x y + ( I J λ 2 G 2 ) A x ( I J λ 2 G 2 ) A y , A ( x ) A ( y ) .
Using firmly nonexpansiveness of the operators ( I J λ 1 G 1 ) and ( I J λ 2 G 2 ) , we have
M ( x ) M ( y ) , x y || ( I J λ 1 G 1 ) x ( I J λ 1 G 1 ) y || 2 + || ( I J λ 2 G 2 ) A x ( I J λ 2 G 2 ) A y || 2 .
As || A || = || A || , we have || A ( I J λ 2 G 2 ) A x A ( I J λ 2 G 2 ) A y || 2 || A || 2 || ( I J λ 2 G 2 ) A x ( I J λ 2 G 2 ) A y || 2 .
Thus, the above inequality implies that
M ( x ) M ( y ) , x y || ( I J λ 1 G 1 ) x ( I J λ 1 G 1 ) y || 2 + || A ( I J λ 2 G 2 ) A x A ( I J λ 2 G 2 ) A y || 2 || A || 2 .
By the Lemma 4, we obtain
M ( x ) M ( y ) , x y || [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] x [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] y || 2 1 + || A || 2 = τ || M ( x ) M ( y ) || 2 ,
which shows that M is τ -inverse strongly monotone, and hence, by Lemma 5, I τ M is firmly nonexpansive for τ = 1 1 + || A || 2 . □
Lemma 10.
If M = [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] for all λ 1 , λ 2 > 0 , then Fix ( I τ M ) = Δ , for every τ > 0 .
Proof. 
Let Δ ϕ ; then, Δ Fix ( I τ M ) . Let p Fix ( I τ M ) , so M ( p ) = 0 and θ Δ , then J λ 1 G 1 ( θ ) = θ , J λ 2 G 2 ( A θ ) = A θ and M ( θ ) = 0 . By using firmly nonexpansive property of operators ( I J λ 1 G 1 ) and ( I J λ 2 G 2 ) , we obtain
0 = M ( p ) M ( θ ) , p θ = [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] p [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] θ , p θ = ( I J λ 1 G 1 ) p ( I J λ 1 G 1 ) θ , p θ + A ( I J λ 2 G 2 ) A p A ( I J λ 2 G 2 ) A θ , p θ = ( I J λ 1 G 1 ) p ( I J λ 1 G 1 ) θ , p θ + ( I J λ 2 G 2 ) A p ( I J λ 2 G 2 ) A θ , A ( p ) A ( θ ) || ( I J λ 1 G 1 ) p ( I J λ 1 G 1 ) θ || 2 + || ( I J λ 2 G 2 ) A p ( I J λ 2 G 2 ) A θ || 2 , || ( I J λ 1 G 1 ) p || 2 + || ( I J λ 2 G 2 ) A p || 2 ,
that is, J λ 1 G 1 ( p ) = p and J λ 2 G 2 ( A p ) = A p . Thus, p Δ . □
Theorem 2.
Let G 1 : H 1 2 H 1 and G 2 : H 2 2 H 2 be the set-valued maximal monotone operators and A : H 1 H 2 be a bounded linear operator. Then, the sequence { x n } such that
x n + 1 = x n τ ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n , for all n 0 ,
where λ 1 , λ 2 > 0 and τ = 1 1 + || A || 2 converges weakly to the solution of ( S p VIP ) .
Proof. 
Let θ Δ ; then, by (13), we have
|| x n + 1 θ || 2 = || x n τ [ ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) ] A x n θ || 2 = || x n θ || 2 + τ 2 || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 2 τ x n θ , ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n .
By Lemma 9, the operator M = ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A is τ -inverse strongly monotone for τ = 1 1 + || A || 2 . Using the fact that [ ( I J λ 1 G 1 ) θ + A ( I J λ 2 G 2 ) A θ ] = 0 , we have
2 τ x n θ , ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n = 2 τ x θ , [ ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n ] [ ( I J λ 1 G 1 ) θ + A ( I J λ 2 G 2 ) A θ ] 2 τ ( τ ) || [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] x n ] [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] θ || 2 = 2 τ 2 || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 .
Using (15), (14) becomes
|| x n + 1 θ || 2 || x n θ || 2 + τ 2 || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 2 τ 2 || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 || x n θ || 2 τ 2 || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 .
From (16), it is clear that
|| x n + 1 θ || 2 || x n θ || 2 .
Thus, { x n } is Féjer monotone and bounded, and consequently, { A ( x n ) } is also bounded. In view of Lemma 2, it is required to show that ω W ( x n ) Δ . From (16), we have
|| x n + 1 θ || 2 || x 0 θ || 2 τ 2 n = 0 n || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 .
Boundedness of { x n } implies that
n = 0 || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 < .
It follows that
lim n || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 = 0 .
By Lemma 8, we have || ( I J λ 1 G 1 ) x n || 0 and || ( I J λ 2 G 2 ) A x n || 0 , as n . Since the nonexpansive operators J λ 1 G 1 and J λ 2 G 2 are demiclosed at zero, by Lemma 2, we deduce that x n w Δ . □
Making use of the Krasnosel’skii–Mann Theorem [28], we have the following weak convergence result.
Theorem 3.
Suppose that the operators G 1 , G 2 , and A are the same as in Theorem 2 and M is same as in Lemma 9. Then, the sequence { ( I τ M ) n x 0 } converges weakly to the solution of ( S p VIP ) .
Proof. 
It follows from Lemma 9 that [ I τ M ] = I τ [ ( I J λ 1 G 1 ) + A ( I J λ 2 G 2 ) A ] is firmly nonexpansive and hence averaged. Applying Theorem 1, for arbitrary x 0 H 1 , the sequence { ( I τ M ) n x 0 } converges weakly to the fixed point of [ I τ M ] . It follows from Lemma 10 that the fixed point of [ I τ M ] is the solution of ( S p VIP ) . □
We prove a viscosity type convergence result to approximate the common solution of ( S p VIP ) and ( FPP ) using Theorem 2.
Theorem 4.
Suppose that the operators G 1 , G 2 , and A are the same as in Theorem 2 and T : H 1 H 1 is a self-nonexpansive mapping. Then, the sequence { x n } defined by
y n : = x n τ ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n , x n + 1 : = α n ψ ( x n ) + ( 1 α n ) T ( y n ) , n 0 ,
converges strongly to a common solution s of ( S p VIP ) and ( FPP ) , where ψ is an α-contraction mapping, λ 1 , λ 2 > 0 , τ = 1 1 + || A || 2 , { α n } is a sequence in ( 0 , 1 ) such that lim n α n = 0 , n = 1 α n = , n = 1 | α n α n 1 | < , and s : = P Fix ( T ) Δ ψ ( s ) .
Proof. 
The proof is divided into following easy steps for the convenience of readers.
Step 1. We show that the sequence { x n } is bounded. Let θ Fix ( T ) Δ ; then, J λ G 1 θ = θ , J λ G 2 ( A θ ) = A θ and T ( θ ) = θ . Applying (16) and (17), we obtain
|| y n θ || 2 || x n θ || 2 τ 2 || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 ,
and
|| y n θ || 2 || x n θ || 2 .
From (19), we get
|| x n + 1 θ || = || α n ψ ( x n ) + ( 1 α n ) T ( y n ) θ || α n || ψ ( x n ) θ || + ( 1 α n ) || T ( y n ) θ || α n || ψ ( x n ) ψ ( θ ) || + α n || ψ ( θ ) θ || + ( 1 α n ) || T ( y n ) T ( θ ) || α n α || x n θ || + α n || ψ ( θ ) θ || + ( 1 α n ) || y n θ || α n α || x n θ || + α n || ψ ( θ ) θ || + ( 1 α n ) || x n θ || = [ 1 α n ( 1 α ) ] || x n θ || + α n || ψ ( θ ) θ || max || x n θ || , || ψ ( θ ) θ || 1 α .
Continuing in the same way as above, we have
|| x n + 1 θ || || x 0 θ || , || ψ ( θ ) θ || 1 α .
Hence, { x n } is bounded, and consequently, { y n } , { ψ ( x n ) } and { T ( y n ) } are also bounded.
Step 2. || x n + 1 x n || 0 , as n . By Lemma 9, I τ M is firmly nonexpansive and consequently nonexpansive, that is,
|| y n y n 1 || = || ( I τ M ) x n ( I τ M ) x n 1 || || x n x n 1 || .
From (19), we conclude that
|| x n + 1 x n || = || α n ψ ( x n ) + ( 1 α n ) T ( y n ) α n 1 ψ ( x n 1 ) + ( 1 α n 1 ) T ( y n 1 ) || = || α n ψ ( x n ) α n ψ ( x n 1 ) + α n ψ ( x n 1 ) + ( 1 α n ) T ( y n 1 ) ( 1 α n ) T ( y n 1 ) + ( 1 α n ) T ( y n ) α n 1 ψ ( x n 1 ) + ( 1 α n 1 ) T ( y n 1 ) || α n || ψ ( x n ) ψ ( x n 1 ) || + || ψ ( x n 1 ) || | α n α n 1 | + ( 1 α n ) || T ( y n ) T ( y n 1 ) || + || T ( y n 1 ) || | α n 1 α n | α n α || x n x n 1 || + || ψ ( x n 1 ) || | α n α n 1 | + ( 1 α n ) || y n y n 1 || + || T ( y n 1 ) || | α n 1 α n | α n α || x n x n 1 || + || ψ ( x n 1 ) || | α n α n 1 | + ( 1 α n ) || x n x n 1 || + || T ( y n 1 ) || | α n 1 α n | ,
that is,
|| x n + 1 x n || [ 1 α n ( 1 α ) ] || x n x n 1 || + | α n α n 1 | K ,
where K : = sup { || ψ ( x n 1 ) || + || T ( y n 1 ) || : n 0 } . By Lemma 3, it follows that
|| x n + 1 x n || 0 , as n .
Step 3. || T ( y n ) y n || 0 , as n . Again using (19), we have
|| x n + 1 θ || 2 = || α n ψ ( x n ) + ( 1 α n ) T ( y n ) θ || 2 α n || ψ ( x n ) θ || 2 + ( 1 α n ) || T ( y n ) θ || 2 α n || ψ ( x n ) θ || 2 + ( 1 α n ) || y n θ || 2 α n || ψ ( x n ) θ || 2 + ( 1 α n ) || x n θ || 2 τ 2 || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 α n || ψ ( x n ) θ || 2 + || x n θ || 2 τ 2 || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 ,
and so,
τ 2 || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 2 α n || ψ ( x n ) θ || 2 + || x n θ || 2 || x n + 1 θ || 2 α n || ψ ( x n ) θ || 2 + || x n + 1 x n || || x n θ || + || x n + 1 θ || .
Taking limit n , we obtain
|| ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 0 .
From (19), we have
y n = x n τ ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n ,
or, equivalently
x n y n τ = ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n .
Using (29), we obtain
1 τ || x n y n || = || ( I J λ 1 G 1 ) x n + A ( I J λ 2 G 2 ) A x n || 0 .
that is,
|| x n y n || 0 , as n .
Again, by (19), we can write
x n + 1 x n = α n ψ ( x n ) + ( 1 α n ) T ( y n ) x n = α n ( ψ ( x n ) x n ) + ( 1 α n ) ( T ( y n ) x n ) ,
or
( 1 α n ) || T ( y n ) x n || || x n + 1 x n || + α n || ψ ( x n ) x n || .
Thus, || T ( y n ) x n || 0 , as n . That is,
|| T ( y n ) y n || || T ( y n ) x n || + || x n y n || ,
taking limit as n , it follows that || T ( y n ) y n || 0 .
Step 4. x n s , where s = P Fix ( T ) Δ ψ ( s ) .
It follows from the boundedness of { x n } that there exists a subsequence { x n k } of { x n } such that { x n k } converges to r. By step 3 and demiclosedness of nonexpansive mapping T, we get r Fix ( T ) . From (29), we have
|| ( I J λ 1 G 1 ) x n k + A ( I J λ 2 G 2 ) A x n k || 0 , as n .
By Lemma 8, we have
|| ( I J λ 1 G 1 ) x n k || 0 a n d || ( I J λ 2 G 2 ) A x n k || 0 .
Since { x n } and { y n } have the same asymptotic behavior, A ( x n ) A ( r ) and by demiclosedness of nonexpansive operators J λ 1 G 1 and J λ 2 G 2 , we get 0 G 1 ( r ) and 0 G 2 ( A r ) . We have r Fix ( T ) Δ . Applying the definition of s, we have ψ ( s ) s , r s 0 . Thus,
lim sup n ψ ( s ) s , x n + 1 s = lim k ψ ( s ) s , x n k + 1 s = ψ ( s ) s , r s 0 .
Therefore,
|| x n + 1 s || 2 = || α n ψ ( x n ) + ( 1 α n ) T ( y n ) s || 2 = α n ψ ( x n ) + ( 1 α n ) T ( y n ) s , x n + 1 s = α n ψ ( x n ) s , x n + 1 s + ( 1 α n ) T ( y n ) s , x n + 1 s α n ψ ( x n ) s , x n + 1 s + ( 1 α n ) y n s , x n + 1 s α n ψ ( x n ) ψ ( s ) , x n + 1 s + α n ψ ( s ) s , x n + 1 s + ( 1 α n ) y n s , x n + 1 s α n 2 || ψ ( x n ) ψ ( s ) || 2 + || x n + 1 s || 2 + α n ψ ( s ) s , x n + 1 s + ( 1 α n ) 2 || y n s || 2 + || x n + 1 s || 2 α n 2 α 2 || x n s || 2 + || x n + 1 s || 2 + α n ψ ( s ) s , x n s + ( 1 α n ) 2 || x n s || 2 + || x n + 1 s || 2 ,
that is,
|| x n + 1 s || 2 α n α 2 || x n s || 2 + α n ψ ( s ) s , x n s + ( 1 α n ) || x n s || 2 = [ 1 α n ( 1 α 2 ) ] || x n s || 2 + α n ψ ( s ) s , x n + 1 s .
By using (32) and Lemma 3, we have x n s , as n . □

4. Consequences

4.1. Split Equilibrium Problem

The equilibrium problem (EP) is to find u ¯ C such that
F ( u ¯ , v ) 0 , f o r a l l v C ,
where F : C × C R is a bifunction. In 2012, He [29] studied the concept of split equilibrium problem (SEP), that is, to find
u C   such   that   u E P ( F 1 ; C )   and   A u E P ( F 2 ; Q ) ,
where the bifunctions F 1 and F 2 are defined over closed convex subsets C ( ϕ ) H 1 and Q ( ϕ ) H 2 , respectively. He studied weak convergence of (SEP). Furthermore, Dinh et al. [30] and Dinh and Kim [31] studied (SEP) and (FPP) involving monotone and nonmonotone bifunctions and discussed the weak as well as strong convergence. For more details of EPs, see [31,32,33].
The resolvent of a bifunction F is defined as
R λ F ( u ) = z C : F ( z , y ) 1 λ u z , y z 0 , for all y C , for all u H .
Blum and Oettli [32] have shown that the resolvent R λ F is properly defined, that is, R λ F ( u ) , for all u H and Fix ( R λ F ) = EP ( F ) . Takahashi et al. [34] defined the following set-valued mapping
G F ( u ) : = z H : F ( u , y ) z , y u , for all y C , u C , , u C ,
and stated that EP ( F ) = G F 1 ( 0 ) . Additionally, Takahashi et al. [34] have shown that for any x H and λ > 0 , the resolvents of F and G F are identical, that is, R λ F = J λ G F . It is shown in [32,34], the problem ( S p VIP ) reduces to (SEP).
Remark 2.
If G 1 = G F 1 and G 2 = G F 2 , then the following assertions are true.
(i) 
The sequence generated by scheme (13) converges weakly to the solution of (SEP).
(ii) 
The sequence { ( I τ M ) n x 0 } defined in Theorem 3, converges weakly to the solution of (SEP).
(iii) 
The sequence generated by scheme (19) converges strongly to the common solution of (SEP) and (FPP).

4.2. Split Common Fixed Point Problem

If J λ 1 G 1 = S and J λ 2 G 2 = T , then the following assertions for (SCFP) are true.
(i)
The scheme (13) defined in the Theorem 2 converges weakly to the solution of (SCFP).
(ii)
The sequence { ( I τ M ) n x 0 } obtained in Theorem 3, converges weakly to the solution of (SCFP).

5. Numerical Example

The convergence graph of || x n || and || x n + 1 x n || obtained from the scheme (19) with step size τ is shown in Figure 1 and Figure 2, and a comparison of || x n || and || x n + 1 x n || is shown in Table 1. Later, a comparison of the convergence of scheme (19) with step size τ , ρ n , and τ n is shown in Figure 3 and Figure 4. Figure 3 and Figure 4 ensure that the convergence of || x n || and || x n + 1 x n || obtained from the scheme (19) with step size τ is better than with the step sizes ρ n and τ n . Moreover, Table 2 shows that the proposed method takes few number of steps and time with the step size τ in comparison of ρ n and τ n . The stopping criterion is || x n + 1 x n || < 10 6 . All of the codes are written in MATLAB r2013a. The step sizes and control parameters are chosen as follows:
WGM1:
Scheme (19) with the Wang’s step size ρ n = 1 / n , S = J λ 1 G 1 and T = J λ 1 G 2 .
WGM2:
Scheme (19) with the Yang’s step size τ n = ρ n || A ( I T ) A x n || , S = J λ 1 G 1 and T = J λ 1 G 2 .
WGM3:
Scheme (19) with the Byrne’s [9] step size γ = 2 || A || 2 = 0.2000 .
VCTA:
Viscosity type Scheme (19) with the step size τ = 1 1 + || A || 2 = 0.0156 and the parameter α n = 1 / n for all n 1 .
Let H 1 = H 2 = R 3 with the inner product defined by
s , t = s 1 t 1 + s 2 t 2 + s 3 t 3 ,
and
|| s || 2 = | s 1 | 2 + | s 2 | 2 + | s 3 | 2 , for all s = ( s 1 , s 2 , s 3 ) R 3 and t = ( t 1 , t 2 , t 3 ) R 3 .
Also,
|| s t || 2 = | s 1 t 1 | 2 + | s 2 t 2 | 2 + | s 3 t 3 | 2 , for all s = ( s 1 , s 2 , s 3 ) and t = ( t 1 , t 2 , t 3 ) R 3 .
We define the operators G 1 and G 2 by
G 1 = 1 / 3 0 0 0 1 / 2 0 0 0 1 and G 2 = 1 / 4 0 0 0 1 / 5 0 0 0 1 / 6 .
Clearly, G 1 and G 2 are maximal monotone operators and their resolvents are given by
J λ 1 G 1 = 3 3 λ 1 0 0 0 2 2 λ 1 0 0 0 1 1 λ 1 and J λ 2 G 2 = 4 4 λ 2 0 0 0 5 5 λ 2 0 0 0 6 6 λ 2 .
Now, consider a bounded linear operator A and its adjoint operator A such that
A = 4 3 3 2 4 1 3 1 2 and A = 7 3 9 1 1 2 10 5 10 .
We define the mappings T and ψ by
T = 1 0 0 0 1 0 0 0 1 and ψ = 1 / 2 0 0 0 1 / 2 0 0 0 1 / 2 .
Clearly, T is nonexpansive and ψ is a contraction mapping with α = 1 / 2 . Choose the scalars λ 1 = 1 / 2 , λ 2 = 1 / 3 , and α n = 1 / n , for all n 1 , τ = 1 1 + || A || 2 = 0.0156 with || A || = 7.9465 , γ = 2 || A || 2 = 0.2000 , and ρ n = 1 / n . We consider arbitrary initial points x 1 = ( 1 , 1 , 1 ) , ( 2 , 2 , 3 ) , and ( 3 , 4 , 3 ) in scheme (19) of Theorem 4. Then, the sequence generated by suggested scheme converges to a solution ( 0 , 0 , 0 ) of ( S p VIP ) and ( FPP ) .

6. Conclusions

In this paper, we modified Wang’s new iterative method using a different stepsize to solve ( S p VIP ) and ( FPP ) in Hilbert space. We analyzed the weak convergence of the modified scheme to investigate the approximate solution of ( S p VIP ) and extended it to a viscosity type iterative scheme to obtain the common solution of ( S p VIP ) and ( FPP ) in Hilbert space with some mild assumptions. In support of our results, a numerical example with comparison tables and convergence graphs is constructed. We remark that one can further study weak and strong convergence of common solutions of ( S p VIP ) and ( FPP ) in higher dimensional spaces.

Author Contributions

Conceptualization, M.A., M.D., A.K.R., F.B., R.A. and J.-C.Y. All authors have contributed equally to this manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

The APC was funded by Deanship of Scientific Research at the Islamic University of Madinah, Medina, Saudi Arabia.

Data Availability Statement

Not applicable.

Acknowledgments

The authors are thankful to the referees for their valuable suggestions and comments, which improved this manuscript a lot. The authors of this paper wish to extend their sincere gratitude to the Deanship of Scientific Research at the Islamic University of Madinah for the support provided to the Post-Publishing Program 1.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Censor, Y.; Elfving, T. A multi projection algorithm using Bregman projections in a product space. Numer. Algor. 1994, 8, 221–239. [Google Scholar] [CrossRef]
  2. Byrne, C. A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 2004, 18, 103–120. [Google Scholar] [CrossRef] [Green Version]
  3. Censor, Y.; Bortfeld, T.; Martin, B.; Trofimov, A. A unified approach for inversion problem in intensity modulated radiation therapy. Phys. Med. Biol. 2006, 51, 2353–2365. [Google Scholar] [CrossRef] [PubMed] [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.; Motova, X.A.; Segal, A. Perturbed projections and subgradient projections for the multiple-sets split feasibility problem. J. Math. Anal. Appl. 2007, 327, 1244–1256. [Google Scholar] [CrossRef] [Green Version]
  6. Censor, Y.; Gibali, A.; Reich, S. Agorithms for the split variational inequality problem. Numer. Algor. 2012, 59, 301–323. [Google Scholar] [CrossRef]
  7. Gwinner, J.; Jadamba, B.; Khan, A.A.; Raciti, F. Uncertainty Quantification in Variational Inequalities: Theory, Numerics and Applications; Chapman and Hall/CRC: New York, NY, USA, 2021. [Google Scholar] [CrossRef]
  8. Moudafi, A. Split monotone variational inclusions. J. Optim. Theory Appl. 2011, 150, 275–283. [Google Scholar] [CrossRef]
  9. Byrne, C.; Censor, Y.; Gibali, A.; Reich, S. Weak and strong convergence of algorithms for split common null point problem. J. Nonlinear Convex Anal. 2012, 13, 759–775. [Google Scholar]
  10. Kazmi, K.R.; Rizvi, S.H. An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping. Optim. Lett. 2014, 8, 1113–1124. [Google Scholar] [CrossRef]
  11. Dilshad, M.; Aljohani, A.F.; Akram, M.; Khidir, A.A. Yosida approximation iterative methods for split monotone variational inclusion problems. J. Funct. Spaces 2022, 2022, 3665713. [Google Scholar] [CrossRef]
  12. Dilshad, M.; Aljohani, A.F.; Akram, M. Iterative scheme for split variational inclusion and a fixed-point problem of a finite collection of nonexpansive mappings. J. Funct. Spaces 2020, 2020, 3567648. [Google Scholar] [CrossRef]
  13. Dilshad, M.; Akram, M.; Ahmad, I. Algorithms for split common null point problem without pre-existing estimation of operator norm. J. Math. Inequal. 2020, 14, 1151–1163. [Google Scholar] [CrossRef]
  14. Dilshad, M.; Siddiqi, A.H.; Ahmad, R.; Khan, F.A. An terative algorithm for a common solution of a split variational inclusion problem and fixed point problem for non-expansive semigroup mappings. In Industrial Mathematics and Complex Systems Industrial and Applied Mathematics; Manchanda, P., Lozi, R., Siddiqi, A., Eds.; Springer: Singapore, 2017. [Google Scholar]
  15. Hammad, H.A.; Rehman, H.; De la Sen, M. Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications. Math. Probl. Eng. 2020, 2020, 7487383. [Google Scholar] [CrossRef]
  16. Kazmi, K.R.; Ali, R.; Furkan, M. Hybrid iterative method for split monotone variational inclusion problem and hierarchical fixed point problem for a finite family of nonexpansive mappings. Numer. Algor. 2018, 79, 499–527. [Google Scholar] [CrossRef]
  17. Kraikaew, R.; Satit, S. Another look at Wang’s new method for solving split common fixed point problems without prior knowledge of operator norms. J. Fixed Point Theory Appl. 2018, 20, 81. [Google Scholar] [CrossRef]
  18. Tuyen, T.M.; Hammad, H.A. Effect of shrinking projection and CQ-methods on two inertial forward–backward algorithms for solving variational inclusion problems. Rend. Circ. Mat. Palermo II Ser. 2021, 70, 1669–1683. [Google Scholar] [CrossRef]
  19. Abubakar, J.; Kumam, P.; Deepho, J. Multistep hybrid viscosity method for split monotone variational inclusion and fixed point problems in Hilbert spaces. AIMS Math. 2020, 5, 5969–5992. [Google Scholar] [CrossRef]
  20. Alansari, M.; Dilshad, M.; Akram, M. Remark on the Yosida approximation iterative technique for split monotone Yosida variational inclusions. Comp. Appl. Math. 2020, 39, 203. [Google Scholar] [CrossRef]
  21. Yang, Q. On variable-step relaxed projection algorithm for variational inequalities. J. Math. Anal. Appl. 2005, 302, 166–179. [Google Scholar] [CrossRef] [Green Version]
  22. Wang, F. A new iterative method for the split common fixed poin problem in Hilbert spaces. Optimization 2017, 66, 407–415. [Google Scholar] [CrossRef]
  23. Wang, F. A new method for split common fixed poin problem without prior knowledge of operator norms. J. Fixed Point Theory Appl. 2017, 19, 2427–2436. [Google Scholar] [CrossRef]
  24. Opial, Z. Weak covergence of the sequence of successive approximations of nonexpansive mappings. Bull. Am. Math. Soc. 1976, 73, 591–597. [Google Scholar] [CrossRef] [Green Version]
  25. Bauschke, H.H.; Combettes, P.L. Convex Analysis and Monotone Operator Theory in Hilbert Spaces; Springer: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
  26. Bauschke, H.H.; Borwein, J.M. On projection algorithm for solving convex feasilibility problems. SIAM Rev. 1996, 38, 367–426. [Google Scholar] [CrossRef] [Green Version]
  27. Xu, H.K. Iterative algorithms for nonlinear operators. J. London Math. Soc. 2002, 66, 240–256. [Google Scholar] [CrossRef]
  28. Mann, W. Mean value methods in iteration. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  29. He, Z. The split equilibrium problem and its convergence algorithms. J. Inequal. Appl. 2012, 2012, 162. [Google Scholar] [CrossRef] [Green Version]
  30. Dinh, B.V.; Son, D.X.; Jiao, L.; Kim, D.S. Linesearch algorithms for split equilibrium problems and nonexpansive mappings. Fixed Point Theory Appl. 2016, 2016, 27. [Google Scholar] [CrossRef] [Green Version]
  31. Dinh, B.V.; Kim, D.S. Projection algolithms for solving nonmonotone equilibrium problems in Hilbert space. J. Comput. Appl. Math. 2016, 302, 106–117. [Google Scholar] [CrossRef]
  32. Blum, E.; Oettli, W. From optimization and variational inequalities to equilibrium problems. Math. Stud. 1994, 63, 123–145. [Google Scholar]
  33. Kassay, G. The Equilibrium Problem and Related Topics; Cluj-Napoca Risoprint: Cluj-Napoca, Romania, 2000. [Google Scholar]
  34. Takahashi, S.; Takahashi, W.; Toyoda, M. Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces. J. Optim. Theory Appl. 2010, 147, 27–41. [Google Scholar] [CrossRef]
Figure 1. Convergence graph of || x n || .
Figure 1. Convergence graph of || x n || .
Mathematics 10 02098 g001
Figure 2. Convergence graph of || x n + 1 x n || .
Figure 2. Convergence graph of || x n + 1 x n || .
Mathematics 10 02098 g002
Figure 3. Comparison of || x n || for different step sizes.
Figure 3. Comparison of || x n || for different step sizes.
Mathematics 10 02098 g003
Figure 4. Comparison of || x n + 1 x n || with different step sizes.
Figure 4. Comparison of || x n + 1 x n || with different step sizes.
Mathematics 10 02098 g004
Table 1. Comparison table of Figure 1 and Figure 2.
Table 1. Comparison table of Figure 1 and Figure 2.
s 1 || x n || || x n + 1 x n ||
s 1 = ( 1 , 1 , 1 ) VCTA1.12163182 × 10−61.20231424 × 10−6
No. Iter.5527
CPU Time (s)0.000050.00001
s 1 = ( 2 , 2 , 3 ) VCTA1.07080608 × 10−61.16727778 × 10−6
No. Iter.6935
CPU Time (s)0.000190.00001
s 1 = ( 3 , 4 , 3 ) VCTA1.01097722 × 10−61.04270864 × 10−6
No. Iter.7539
CPU Time (s)0.000350.00001
Table 2. Comparison table of Figure 3 and Figure 4.
Table 2. Comparison table of Figure 3 and Figure 4.
  s 1 WGM1WGM2VCTA
s 1 = ( 2 , 2 , 2 ) || x n || 1.02734625 × 10−62.61940737 × 10−41.06138607 × 10−6  
No. Iter.110100066  
CPU Time (s)0.0001930.00001  
s 1 = ( 2 , 2 , 2 ) || x n + 1 x n || 1.04342385 × 10−61.01232329 × 10−61.00378988 × 10−6  
No. Iter.5796935  
CPU Time (s)0.000062.350.00001  
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

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. Mathematics 2022, 10, 2098. https://doi.org/10.3390/math10122098

AMA Style

Akram M, Dilshad M, Rajpoot AK, Babu F, Ahmad R, Yao J-C. Modified Iterative Schemes for a Fixed Point Problem and a Split Variational Inclusion Problem. Mathematics. 2022; 10(12):2098. https://doi.org/10.3390/math10122098

Chicago/Turabian Style

Akram, Mohammad, Mohammad Dilshad, Arvind Kumar Rajpoot, Feeroz Babu, Rais Ahmad, and Jen-Chih Yao. 2022. "Modified Iterative Schemes for a Fixed Point Problem and a Split Variational Inclusion Problem" Mathematics 10, no. 12: 2098. https://doi.org/10.3390/math10122098

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