Next Article in Journal
Semantics-Driven 3D Scene Retrieval via Joint Loss Deep Learning
Previous Article in Journal
Converse Inertial Step Approach and Its Applications in Solving Nonexpansive Mapping
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Convergence Properties and Numerical Illustration of a Resolvent-Based Inertial Extrapolation Method for Variational Inclusions in Banach Space

1
Department of Mathematics, Aligarh Muslim University, Aligarh 202002, India
2
Department of Mechanical Engineering, College of Engineering, Qassim University, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(22), 3725; https://doi.org/10.3390/math13223725
Submission received: 11 September 2025 / Revised: 7 November 2025 / Accepted: 17 November 2025 / Published: 20 November 2025

Abstract

This paper examines H ( · , · ) -accretive mappings in Banach spaces and proves that the resolvent operator related to these mappings is Lipschitz continuous. Using the resolvent operator technique, we formulate iterative algorithms to solve a class of variational inclusions in Banach spaces. We also concentrate on examining the convergence of the problem by employing the inertial extrapolation scheme and proving the convergence of the iterative scheme produced by the algorithm. The theoretical analysis is corroborated with a numerical result, which highlights the effectiveness and practical relevance of the proposed approaches.
MSC:
47H05; 49H10; 47J25

1. Introduction

The theory of variational inequalities has undergone extensive development and generalization, largely due to its wide-ranging applications in mechanics, physics, optimization, economics, and engineering. A significant extension of this theory is the concept of variational inclusion, originally introduced by Hassouni and Moudafi [1]. Over the years, various approaches have been suggested to address variational inclusion problems, with the resolvent operator technique emerging as one of the most prominent and effective tools.
The idea of generalized m-accretive mappings, together with the formulation of the resolvent operator for such mappings in Banach spaces, was first explored by Huang and Fang [2]. They further investigated several properties of the resolvent operator associated with generalized H ( · , · ) -accretive mappings in Banach spaces (see also [2,3,4,5,6,7,8,9] for related contributions).
Noor [10,11] later introduced resolvent equations, which generalize Wiener–Hopf-type equations. Several researchers have shown the equivalence between variational inclusion problems and resolvent equations, thereby reinforcing the importance of the resolvent operator method. Unlike projection methods, which may fail in some cases, the resolvent approach has proven to be highly effective in tackling inclusion problems. In fact, many generalized forms of resolvent operators involving multiple monotone operators have been developed in the literature.
Several iterative schemes based on generalized resolvent operators have been developed in the literature. To enhance computational performance, methods that achieve faster convergence are particularly desirable. One effective acceleration strategy involves the use of inertial extrapolation, in which an extrapolation term v ( x n x n 1 ) , governed by a scalar parameter v is incorporated to speed up the convergence process. The idea of inertial-type iterations was originally introduced by Polyak [12] through the well-known heavy-ball method. Such two-step inertial algorithms utilize information from the two most recent iterates to produce the next approximation, thereby improving both stability and convergence rate (see, e.g., [13,14,15,16,17,18,19,20,21]). More recently, Rajpoot et al. [22,23] studied the Yosida resolvent equation related to Yosida variational inclusions. They examined the existence of solutions and the convergence of iterative algorithms based on the Yosida resolvent operator, which further extended some earlier results on variational inclusion problems.
Building upon these advancements, the present study focuses on the investigation of the Lipschitz continuity of the resolvent operator corresponding to H ( · , · ) -accretive mappings under appropriate conditions. Within this theoretical framework, an iterative algorithm was developed to address a class of variational inclusion problems in Banach spaces. The existence of solutions is ensured under sufficient assumptions, and the convergence analysis of the proposed inertial-type scheme is rigorously established. In addition, a numerical experiment implemented in MATLAB R2024a is presented to illustrate the validity of the theoretical findings through convergence graphs and tabulated results. Furthermore, the efficiency and stability of the proposed algorithm are demonstrated through a comparative study with the Mann-type and Ishikawa-type algorithms.
This paper is organized as follows: Section 1 presents the Introduction and outlines the motivation, background, and related work in the field. Section 2 provides preliminaries, including the basic definitions, lemmas, and mathematical tools used throughout the paper. Section 3 introduces the concept of H ( · , · ) -accretive operators and discusses their fundamental properties. Section 4 formulates the generalized variational inclusion problem within the Banach space framework. Section 5 is devoted to the fixed-point formulation and iterative algorithm, where the proposed inertial-type scheme is constructed. Section 6 presents the Convergence Analysis of the proposed algorithm under suitable assumptions. Section 7 provides the Numerical Results and a comparative study with existing methods, followed by the Conclusion, which summarizes the main contributions and highlights possible directions for future research.

2. Basic Concepts

Let Q be a real Banach space, with its dual denoted by Q * . The duality pairing between elements of Q and Q * is represented by · , · . We write 2 Q for the collection of all nonempty subsets of Q . The generalized duality mapping D p : Q 2 Q * is defined by
D p ( z ) = { g * Q * : z , g * = z p , g * = z p 1 } , z Q ,
where p > 1 . For p = 2 , D p becomes the normalized duality mapping. More generally, for any z 0 , one can write D p ( z ) = z p 1 D 2 ( z ) . If the dual space Q * is strictly convex, then the operator D p is single-valued. In this work, we assume that Q is a real Banach space. The mapping D p is single-valued if Q is uniformly smooth (see [24]). The modulus of smoothness of Q is introduced through the function ψ z : [ 0 , ) [ 0 , ) defined by
ψ z ( t ) = sup 1 2 z 1 + z 2 + z 1 z 2 1 : z 1 1 , z 2 t .
A Banach space Q is said to be uniformly smooth whenever
lim t 0 ψ z ( t ) t = 0 .
Furthermore, Q is called p-uniformly smooth if there exists a constant r > 0 such that
ψ z ( t ) r t p , p > 1 .
In a uniformly smooth Banach space, the duality mapping D p is single-valued. The following result, proved by Xu [25], deals with characteristic inequalities in p-uniformly smooth Banach spaces.
Lemma 1
([25]). Let Q be a uniformly smooth Banach space. Then, Q is p-uniformly smooth if and only if there exists a constant r p > 0 such that, for all z 1 , z 2 Q ,
z 1 + z 2 p z 1 p + p z 1 , D p ( z 1 ) + r p z 1 p .
For completeness, we now recall some standard notions in the case where Q = H is a Hilbert space.
Definition 1. 
Let A : Q Q be a single-valued mapping. Then,
(i) 
A is monotone if
A ( z 1 ) A ( z 2 ) , z 1 z 2 0 , z 1 , z 2 Q .
(ii) 
A is strongly monotone if there exists δ A > 0 such that
A ( z 1 ) A ( z 2 ) , z 1 z 2 δ A z 1 z 2 2 , z 1 , z 2 Q .
Definition 2.
A set-valued operator Δ : Q 2 Q is said to be monotone if
w 1 w 2 , z 1 z 2 0 , z 1 , z 2 Q , w 1 Δ ( z 1 ) , w 2 Δ ( z 2 ) .
Definition 3.
Let H : Q Q be a mapping. A set-valued operator Δ : Q 2 Q is called H -monotone if Δ is monotone and
[ H + λ Δ ] ( Q ) = Q , λ > 0 .
The following extends Definitions 1–3 to the framework of p-uniformly smooth Banach spaces.
Definition 4
([24]). Let f , g , u , v : Q Q and H : Q × Q Q be single-valued mappings. Then,
(i) 
f is accretive if
f ( z 1 ) f ( z 2 ) , D p ( z 1 z 2 ) 0 , z 1 , z 2 Q .
(ii) 
f is strictly accretive if f is accretive and
f ( z 1 ) f ( z 2 ) , D p ( z 1 z 2 ) = 0 , z 1 = z 2 z 1 , z 2 Q .
(iii) 
H ( f , · ) is called α-strongly accretive with respect to f if there exists α > 0 such that
H ( f ( z 1 ) , w ) H ( f ( z 2 ) , w ) , D p ( z 1 z 2 ) α z 1 z 2 p , z 1 , z 2 , w Q .
(iv) 
g is τ-Lipschitz continuous if there exists τ > 0 such that
g ( z 1 ) g ( z 2 ) τ z 1 z 2 , z 1 , z 2 Q .
(v) 
H ( f , · ) is μ-co-coercive with respect to f if there exists μ > 0 such that
H ( f ( z 1 ) , w ) H ( f ( z 2 ) , w ) , D p ( z 1 z 2 ) μ f ( z 1 ) f ( z 2 ) p , z 1 , z 2 , w Q .
(vi) 
H ( · , g ) is β-relaxed co-coercive with respect to g if there exists β > 0 such that
H ( w , g ( z 1 ) ) H ( w , g ( z 2 ) ) , D p ( z 1 z 2 ) ( β ) g ( z 1 ) g ( z 2 ) p , z 1 , z 2 , w Q .
(vii) 
H ( f , g ) is called mixed Lipschitz continuous with respect to f and g if there exists t H > 0 such that
H ( f ( z 1 ) , g ( z 1 ) ) H ( f ( z 2 ) , g ( z 2 ) ) t H z 1 z 2 , z 1 , z 2 Q .
(viii) 
Ψ ( u , v ) is called mixed Lipschitz continuous with respect to u and v if there exists t Ψ > 0 such that
Ψ ( u ( z 1 ) , v ( z 1 ) ) Ψ ( u ( z 2 ) , v ( z 2 ) ) t Ψ z 1 z 2 , z 1 , z 2 Q .
(ix) 
A set-valued operator Δ : Q 2 Q is called accretive if
w 1 w 2 , D p ( z 1 z 2 ) 0 , z 1 , z 2 Q , w 1 Δ ( z 1 ) , w 2 Δ ( z 2 ) .
Lemma 2
([22]). Let { Φ n } be a sequence of nonnegative real numbers satisfying
Φ n + 1 ( 1 ζ n ) Φ n + ζ n σ n + δ n , n 0 ,
where
(i) 
{ ζ n } [ 0 , 1 ] with n = 1 ζ n = ;
(ii) 
lim sup σ n 0 ;
(iii) 
δ n 0 and n = 1 δ n < .
Then, lim n Φ n = 0 .

3. H ( · , · ) -Accretive Operator

This section introduces the concept of an H -accretive operator and highlights some of its essential properties.
Definition 5
([24]). Let H : Q × Q Q and f , g , h : Q Q be single-valued mappings. Let Δ : Q 2 Q be a set-valued operator. Then, Δ is called H ( · , · ) -accretive with respect to f and g (or simply H ( · , · ) -accretive) if the following hold:
(i) 
Δ is accretive;
(ii) 
For each λ > 0 ,
H ( f , g ) + λ Δ ( h ) ( Q ) = Q .
Theorem 1.
Assume that H ( f , g ) is α-strongly accretive with respect to f and β-relaxed co-coercive with respect to g, where g is τ-Lipschitz continuous. If α > β τ p and Δ is an H ( · , · ) -accretive operator with respect to f and g, then the mapping
H ( f , g ) + λ Δ ( h ) 1
is single-valued for every λ > 0 .
Proof. 
Take any w Q and let z 1 , z 2 ( H ( f , g ) + λ Δ ( h ) ) 1 ( w ) . Then,
1 λ H ( f ( z 1 ) , g ( z 1 ) ) + w Δ ( h ( z 1 ) ) , 1 λ H ( f ( z 2 ) , g ( z 2 ) ) + w Δ ( h ( z 2 ) ) .
Since Δ is accretive, we obtain
0 1 λ H ( f ( z 1 ) , g ( z 1 ) ) + w ( H ( f ( z 2 ) , g ( z 2 ) ) + w ) , D p ( z 1 z 2 ) = 1 λ H ( f ( z 1 ) , g ( z 1 ) ) H ( f ( z 2 ) , g ( z 2 ) ) , D p ( z 1 z 2 ) = 1 λ ( H ( f ( z 1 ) , g ( z 1 ) ) H ( f ( z 2 ) , g ( z 1 ) ) , D p ( z 1 z 2 ) + H ( f ( z 2 ) , g ( z 1 ) ) H ( f ( z 2 ) , g ( z 2 ) ) , D p ( z 1 z 2 ) ) .
Applying the α -strong accretivity of H ( f , g ) with respect to f and its β -relaxed co-coercivity with respect to g, we deduce
0 1 λ α z 1 z 2 p β g ( z 1 ) g ( z 2 ) p .
As g is τ -Lipschitz continuous, this becomes
0 1 λ ( α β τ p ) z 1 z 2 p .
Since α > β τ p and λ > 0 , the above inequality yields z 1 = z 2 . Thus, H ( f , g ) + λ Δ ( h ) 1 is single-valued.    □
Definition 6.
Let H ( f , g ) be α-strongly accretive with respect to f and β-relaxed co-coercive with respect to g, and let g be τ-Lipschitz continuous, with α > β τ p . If Δ is an H ( · , · ) -accretive operator with respect to f and g, the resolvent operator R Δ , λ H ( · , · ) : Q Q is defined as
R Δ , λ H ( · , · ) ( w ) = H ( f , g ) + λ Δ ( h ) 1 ( w ) , w Q .
The next theorem shows that this resolvent operator shares properties similar to those studied in [6].
Theorem 2.
Suppose H ( f , g ) is α-strongly accretive with respect to f and β-relaxed co-coercive with respect to g and g is τ-Lipschitz continuous. If α > β τ p , then the resolvent operator
R Δ , λ H ( · , · ) : Q Q
is 1 α β τ p -Lipschitz continuous. Specifically, for any v , w Q ,
R Δ , λ H ( · , · ) ( v ) R Δ , λ H ( · , · ) ( w ) 1 α β τ p v w .
Proof. 
Let v , w Q . By definition,
R Δ , λ H ( · , · ) ( v ) = ( H ( f , g ) + λ Δ ( h ) ) 1 ( v ) , R Δ , λ H ( · , · ) ( w ) = ( H ( f , g ) + λ Δ ( h ) ) 1 ( w ) .
Thus,
1 λ v H ( f ( R Δ , λ H ( · , · ) ( v ) ) , g ( R Δ , λ H ( · , · ) ( v ) ) ) Δ ( h ( R Δ , λ H ( · , · ) ( v ) ) ) ,
1 λ w H ( f ( R Δ , λ H ( · , · ) ( w ) ) , g ( R Δ , λ H ( · , · ) ( w ) ) ) Δ ( h ( R Δ , λ H ( · , · ) ( w ) ) ) .
For brevity, set
J ¯ ( v ) = R Δ , λ H ( · , · ) ( v ) , J ¯ ( w ) = R Δ , λ H ( · , · ) ( w ) .
Since Δ is accretive, it follows that
1 λ v H ( f ( J ¯ ( v ) ) , g ( J ¯ ( v ) ) ) w H ( f ( J ¯ ( w ) ) , g ( J ¯ ( w ) ) ) , D p ( J ¯ ( v ) J ¯ ( w ) ) 0 .
This gives
v w , D p ( J ¯ ( v ) J ¯ ( w ) ) H ( f ( J ¯ ( v ) ) , g ( J ¯ ( v ) ) ) H ( f ( J ¯ ( w ) ) , g ( J ¯ ( w ) ) ) , D p ( J ¯ ( v ) J ¯ ( w ) )
Using the property of duality mapping, we obtain
v w · J ¯ ( v ) J ¯ ( w ) p 1 = v w , D p ( J ¯ ( v ) J ¯ ( w ) ) .
Combining (1) and (2) and using the α -accretivity and β -relaxed co-coercivity of H , we have
v w · J ¯ ( v ) J ¯ ( w ) p 1 α J ¯ ( v ) J ¯ ( w ) p β g ( J ¯ ( v ) ) g ( J ¯ ( w ) ) p .
Since g is τ -Lipschitz continuous, it follows that
v w · J ¯ ( v ) J ¯ ( w ) p 1 ( α β τ p ) J ¯ ( v ) J ¯ ( w ) p .
Therefore,
R Δ , λ H ( · , · ) ( v ) R Δ , λ H ( · , · ) ( w ) 1 α β τ p v w .
   □

4. Generalized Variational Inclusion Problem

In this section, we demonstrate that, under suitable assumptions, the generalized H ( · , · ) -accretive operator introduced earlier can be effectively applied to solve variational inclusion problems in Banach spaces. Let Q denote a p-uniformly smooth Banach space. Consider single-valued mappings f , g , h , u , v : Q Q and Ψ : Q × Q Q , together with a set-valued operator Δ : Q 2 Q . We study the following generalized variational inclusion problem: find z Q such that
0 Ψ ( u ( z ) , v ( z ) ) + Δ ( h ( z ) ) .
When Ψ ( · , · ) = 0 and h is the identity mapping, problem (3) reduces to the simpler task of finding z Q such that
0 Δ ( z ) .
The formulation in (4) represents a standard inclusion problem that forms the basis for a wide range of practical applications in the applied sciences.

5. Fixed-Point Formulation and Iterative Algorithm

The next lemma establishes a fixed-point characterization of problem (3), utilizing the resolvent operator introduced in Definition 6.
Lemma 3.
The generalized variational inclusion problem (3) admits a solution a Q if and only if
a = R Δ , λ H ( · , · ) [ H ( f ( a ) , g ( a ) ) λ Ψ ( u ( a ) , v ( a ) ) ] .
Proof. 
Suppose a Q satisfies (5). Then,
a = R Δ , λ H ( · , · ) [ H ( f ( a ) , g ( a ) ) λ Ψ ( u ( a ) , v ( a ) ) ] .
This is equivalent to
a = ( H ( f , g ) + λ Δ ( h ) ) 1 [ H ( f ( a ) , g ( a ) ) λ Ψ ( u ( a ) , v ( a ) ) ] H ( f ( a ) , g ( a ) ) + λ Δ ( h ( a ) ) = H ( f ( a ) , g ( a ) ) λ Ψ ( u ( a ) , v ( a ) ) 0 Ψ ( u ( a ) , v ( a ) ) + Δ ( h ( a ) ) .
   □
Based on the Lemma 5, we now design an iterative algorithm to compute a solution to the problem (3).

6. Convergence Analysis

In this section, we study the convergence of the proposed scheme for the generalized variational inclusion problem in a real Banach space.
Theorem 3.
Let Q be a p-uniformly smooth Banach space. Let f , g , u , v : Q Q and H , Ψ : Q × Q Q be single-valued mappings such that H ( f , g ) is α strongly accretive with respect to f and β-relaxed co-coercive with respect to g, where g is τ-Lipschitz continuous. Also, assume that α > β τ p , H , and Ψ are mixed Lipschitz continuous with respect to mappings f , g and u , v with constant t H and t Ψ , respectively. Let Δ : Q 2 Q be an H -accretive set-valued operator. Suppose that R Δ , λ H ( · , · ) : Q Q is a resolvent operator such that R Δ , λ H ( · , · ) is 1 κ -Lipschitz continuous, where κ = α β τ p . Suppose that the following conditions are satisfied:
κ 3 t H 4 > 9 t H 2 + 16 4 ,
t H < κ λ t Ψ ,
where
t Ψ = t H κ + 1 λ κ , κ 0 , λ κ 0 .
Let α n , ν n [ 0 , 1 ] for all n 1 such that
n = 1 α n = as well as n = 1 ν n ( a n a n 1 ) < ,
where all constants are positive, and ν n is an extrapolating term Then, the sequence { a n } generated by Algorithm 1 strongly converges to the unique solution a * Q of generalized variational inclusion problem (3).
Algorithm 1: Inertial Extrapolation Method
Step 1 (Initialisation): For an initial point a 0 Q , and α n , ν n [ 0 , 1 ] , where ν n is the extrapolation parameter, and λ > 0 is a fixed constant.
Step 2: Given a 0 , a 1 Q , compute w n as follows:
w n = a n + ν n ( a n a n 1 ) , n 1 .
Step 3: Compute a n + 1 as follows:
a n + 1 = ( 1 α n ) a n + α n R Δ , λ H ( · , · ) H ( f ( a n ) , g ( a n ) ) + H ( f ( w n ) , g ( w n ) ) 2 λ Ψ ( u ( w n ) , v ( w n ) ) .
Proof. 
Let a * Q be the solution of generalized variational inclusion problem (3). Then, by the algorithm, we get
a * = ( 1 α n ) a * + α n R Δ , λ H ( · , · ) H ( f ( a * ) , g ( a * ) ) + H ( f ( a * ) , g ( a * ) ) 2 λ Ψ ( u ( a * ) , v ( a * ) ) ,
where α n [ 0 , 1 ] , for all n 1 .
Using iterative sequence a n and (9), we find that
a n + 1 a * = ( 1 α n ) a n + α n R Δ , λ H ( · , · ) H ( f ( a n ) , g ( a n ) ) + H ( f ( w n ) , g ( w n ) ) 2 λ Ψ ( u ( w n ) , v ( w n ) ) ( 1 α n ) a * α n R Δ , λ H ( · , · ) H ( f ( a * ) , g ( a * ) ) + H ( f ( a * ) , g ( a * ) ) 2 λ Ψ ( u ( a * ) , v ( a * ) ) = ( 1 α n ) ( a n a * ) + α n { R Δ , λ H ( · , · ) [ H ( f ( a n ) , g ( a n ) ) + H ( f ( w n ) , g ( w n ) ) 2 λ Ψ ( u ( w n ) , v ( w n ) ) ] R Δ , λ H ( · , · ) H ( f ( a * ) , g ( a * ) ) + H ( f ( a * ) , g ( a * ) ) 2 λ Ψ ( u ( a * ) , v ( a * ) ) } ( 1 α n ) a n a * + α n R Δ , λ H ( · , · ) [ H ( f ( a n ) , g ( a n ) ) + H ( f ( w n ) , g ( w n ) ) 2 λ Ψ ( u ( w n ) , v ( w n ) ) ] R Δ , λ H ( · , · ) H ( f ( a * ) , g ( a * ) ) + H ( f ( a * ) , g ( a * ) ) 2 λ Ψ ( u ( a * ) , v ( a * ) ) .
Applying the 1 κ -Lipschitz continuity of resolvent operator R Δ , λ H ( · , · ) , where κ = α β τ p , we get
a n + 1 a * ( 1 α n ) a n a * + α n κ H ( f ( a n ) , g ( a n ) ) + H ( f ( w n ) , g ( w n ) ) 2 H ( f ( a * ) , g ( a * ) ) + H ( f ( a * ) , g ( a * ) ) 2 λ [ Ψ ( u ( w n ) , v ( w n ) ) Ψ ( u ( a * ) , v ( a * ) ) ] ( 1 α n ) a n a * + α n 2 κ H ( f ( a n ) , g ( a n ) ) H ( f ( a * ) , g ( a * ) ) + α n 2 κ H ( f ( w n ) , g ( w n ) ) H ( f ( a * ) , g ( a * ) ) + α n λ κ Ψ ( u ( w n ) , v ( w n ) ) Ψ ( u ( a * ) , v ( a * ) ) .
Using the mixed Lipschitz continuity of H and Ψ with respect to f , g and u , v , respectively, we obtain
a n + 1 a * ( 1 α n ) a n a * + α n 2 κ t H a n a * + α n 2 κ t H w n a * + α n λ κ t Ψ w n a * = ( 1 α n ) + α n 2 κ t H a n a * + α n 2 κ t H + α n λ κ t Ψ w n a * .
From Algorithm 1, we have
w n a * = a n a * + ν n ( a n a n 1 ) a n a * + ν n a n a n 1 .
Combining (10) and (11), we obtain
a n + 1 a * ( 1 α n ) + α n 2 κ t H a n a * + α n ( t H + 2 λ t Ψ ) 2 κ a n a * + α n ( t H + 2 λ t Ψ ) 2 κ ν n a n a n 1 .
Thus, we have
a n + 1 a * ( 1 α n ) + α n 2 κ t H + α n ( t H + 2 λ t Ψ ) 2 κ a n a * + α n ( t H + 2 λ t Ψ ) 2 κ ν n a n a n 1 = [ ( 1 α n ) + α n S 1 + α n S 2 ] a n a * + α n S 2 ν n a n a n 1 ,
or
a n + 1 a * [ 1 α n ( 1 ( S 1 + S 2 ) ) ] a n a * + α n S 2 ν n a n a n 1 ,
where
S 1 = t H 2 κ S 2 = t H + 2 λ t Ψ 2 κ < 1 , ( By condition   ( 6 ) ) S 1 + S 2 = t H κ + λ t Ψ κ .
letting S = S 1 + S 2 , S < 1 from condition (7). By condition (8), we have
n = 1 α n = and n = 1 ν n a n a n 1 < .
Setting σ n = 0 and δ n = n = 1 ν n a n a n 1 < , it follows from Lemma 2 and Equation (12) that a n a * as n . Therefore, the iterative Algorithm 1 strongly converges to the unique element a * Q solving the generalized variational inclusion problem (3). Furthermore, we establish the uniqueness of the solution to the problem (3). Let a , a * Q be two distinct solutions of the generalized variational inclusion problem (3). Then, by Lemma 3, we have
a = R Δ , λ H ( · , · ) H ( f ( a ) , g ( a ) ) λ Ψ ( u ( a ) , v ( a ) )
and
a * = R Δ , λ H ( · , · ) H ( f ( a * ) , g ( a * ) ) λ Ψ ( u ( a * ) , v ( a * ) ) .
It follows that
a a * = R Δ , λ H ( · , · ) [ H ( f ( a ) , g ( a ) ) λ Ψ ( u ( a ) , v ( a ) ) ] R Δ , λ H ( · , · ) [ H ( f ( a * ) , g ( a * ) ) λ Ψ ( u ( a * ) , v ( a * ) ) ] .
Using the Lipschitz continuity of the resolvent operator R Δ , λ H ( · , · ) ,
a a * 1 κ [ H ( f ( a ) , g ( a ) ) λ Ψ ( u ( a ) , v ( a ) ) ] [ H ( f ( a * ) , g ( a * ) ) λ Ψ ( u ( a * ) , v ( a * ) ) ] 1 κ [ H ( f ( a ) , g ( a ) ) H ( f ( a * ) , g ( a * ) ) λ [ Ψ ( u ( a ) , v ( a ) Ψ ( u ( a * ) , v ( a * ) ) ] 1 κ [ H ( f ( a ) , g ( a ) ) H ( f ( a * ) , g ( a * ) ) ] + λ κ [ Ψ ( u ( a ) , v ( a ) Ψ ( u ( a * ) , v ( a * ) ) ] .
Using the mixed Lipschitz continuity of H and Ψ with respect to f , g and u , v , respectively, we obtain
a a * 1 κ t H a a * + λ κ t Ψ a a * = t H κ + λ t Ψ κ a a * = P ( θ ) a a * ,
where P ( θ ) = t H κ + λ t Ψ κ , t Ψ = t H r + 1 λ κ . From condition (7), we obtain 0 < P ( θ ) < 1 . Hence, in applying (13), the generalized variational inclusion problem (3) admits a unique solution a = a * .    □
When α n = 1 in Algorithm 1, we obtain the following algorithm and its convergence result.
Corollary 1.
Suppose that all the assumptions of Theorem 1 hold. Then, the sequence generated by Algorithm 2 strongly converges to the unique solution a * Q of the generalized variational inclusion problem (3).
Algorithm 2: Inertial Extrapolation Method with α n = 1
Step 1 (Initialisation): For an initial point a 0 Q , and ν n [ 0 , 1 ] , where ν n is the extrapolation parameter, and λ > 0 is a fixed constant.
Step 2: Given a 0 , a 1 Q , compute w n as follows:
w n = a n + ν n ( a n a n 1 ) , n 1 .
Step 3: Compute a n + 1 as follows:
a n + 1 = R Δ , λ H ( · , · ) H ( f ( a n ) , g ( a n ) ) + H ( f ( w n ) , g ( w n ) ) 2 λ Ψ ( u ( w n ) , v ( w n ) ) .
When ν n = 0 in Algorithm 1, we obtain the following algorithm and its convergence result:
Corollary 2.
Suppose that all conditions of Theorem 1 hold except condition (6). Then, the sequence generated by Algorithm 3 strongly converges to the unique solution a * Q of the generalized variational inclusion problem (3).
Algorithm 3: Without Inertial Parameter
Step 1 (Initialisation): For an initial point a 0 Q , and α n [ 0 , 1 ] , and λ > 0 is a fixed constant.
Step 2: Compute a n + 1 as follows:
a n + 1 = ( 1 α n ) a n + α n R Δ , λ H ( · , · ) H ( f ( a n ) , g ( a n ) ) λ Ψ ( u ( a n ) , v ( a n ) ) .

7. Numerical Results

To verify Theorem 3, we provide a numerical illustration implemented in MATLAB R2024a. The example includes a step-by-step computation table and a convergence plot to illustrate the results.
Example 1.
Consider Q = R with the standard inner product and norm, and let p = 2 . Let f , g , h , u , v : Q Q and H , Ψ : Q × Q Q be single-valued mappings and let Δ : Q 2 Q be a set-valued operator. Suppose
H ( z 1 , z 2 ) = 6 5 z 1 2 3 z 2 , for all z 1 , z 2 Q ,
and
f ( z ) = g ( z ) = 2 z , for all z Q .
Then,
(i) 
H ( f , · ) is α-strongly accretive with respect to f. Computation yields
H ( f ( z 1 ) , w ) H ( f ( z 2 ) , w ) , D p ( z 1 z 2 ) = 12 5 z 1 z 2 2 ,
so H ( f , · ) is 12 5 -strongly accretive with respect to f.
(ii) 
H ( · , g ) is β-relaxed co-coercive with respect to g:
H ( w , g ( z 1 ) ) H ( w , g ( z 2 ) ) , D p ( z 1 z 2 ) = 1 3 g ( z 1 ) g ( z 2 ) 2 .
Hence, H ( · , g ) is 1 3 -relaxed co-coercive with respect to g.
(iii) 
H ( f , g ) is 16 15 -mixed Lipschitz continuous with respect to f and g:
H ( f ( z 1 ) , g ( z 1 ) ) H ( f ( z 2 ) , g ( z 2 ) ) = 16 15 z 1 z 2 .
(iv) 
Ψ ( u , v ) is 5 2 -mixed Lipschitz continuous with respect to u and v, with
Ψ ( z 1 , z 2 ) = z 1 2 + z 2 3 , u ( z ) = v ( z ) = 3 z .
(v) 
g is 2-Lipschitz continuous:
g ( z 1 ) g ( z 2 ) = 2 z 1 z 2 .
(vi) 
Δ is H ( · , · ) -accretive. Let
Δ ( x ) = 1 5 z , h ( z ) = 1 2 z .
Then,
Δ ( h ( z 1 ) ) Δ ( h ( z 2 ) ) = 1 10 z 1 z 2 ,
and
[ H ( f , g ) + λ Δ ( h ) ] ( Q ) = Q , for λ = 1 .
(vii) 
From the above, the constants are
α = 12 5 , β = 1 3 , τ = 2 , p = 2 , r = α β τ p = 16 15 .
(viii) 
For λ = 1 , the resolvent operator is
R Δ , λ H ( · , · ) ( z ) = [ H ( f , g ) + λ Δ ] 1 ( z ) = 30 35 z ,
which is 1 κ = 15 16 -Lipschitz continuous.
(ix) 
Using these constants, all conditions (6) and (7) of Theorem 3 are satisfied.
(x) 
By choosing α n = 1 n + 1 and ν n = 1 n , the inertial iterative Algorithm 1 becomes
w n = a n + ν n ( a n a n 1 ) , a n + 1 = ( 1 α n ) a n + α n 16 35 a n 59 35 w n .
Table 1 and Figure 1 shows that the convergence behavior of sequence { a n } converges to a * = 0 Q for the initial values a 0 = 1 , a 1 = 0.5 ; a 0 = 4 , a 1 = 2 ; and a 0 = 4 , a 1 = 4 . The generalized variational inclusion problem (3) has the solution given by the limit a * = 0 . Next, we analyze the performance of Algorithm 1 for this example and compare it with Algorithms 4.1 and 4.2 from [26]. All computations and the convergence graph were produced using MATLAB_R2024a. In the MATLAB implementation, the computational complexity was evaluated based on two stopping criteria: either when the sequence satisfies the condition | a n + 1 a * | < 10 6 , indicating convergence, or when the maximum number of iterations reaches 20. The corresponding numerical results are presented in Figure 1.
The numerical experiments were conducted on a MacBook Air equipped with an Apple M1 chip (8-core CPU) running macOS Sequoia 15.6.1. The comparison behaviour of Algorithm 1 is shown in Table 2, Figure 2 and Figure 3. We observe that Algorithm 1 is faster than Algorithms 4.1 and 4.2 in [26].
By setting α n = 1 and ν n = 0 , new algorithmic variants were developed. Four comparative graphs Figure 4 and Figure 5 were then plotted to evaluate their convergence behavior with respect to the proposed Algorithm 1, Ishikawa-type Algorithm 4.1 and Mann-type Algorithm 4.2 in [26].

8. Conclusions

In this paper, we investigated the concept of H ( · , · ) -accretive mappings in Banach spaces and proposed iterative algorithms based on the resolvent operator technique for solving a specific class of variational inclusions. The convergence of the algorithm was established using an inertial extrapolation scheme, confirming that the iterative sequence generated by the algorithm converges reliably and efficiently to the solution.
The results obtained are also applicable to higher-dimensional Banach spaces, making them relevant for engineers, physicists, and other practitioners in a variety of applied contexts. Furthermore, the performance of the proposed scheme was validated through numerical result, demonstrating its practical effectiveness.

Author Contributions

Conceptualization: M.A.A. and I.A.; methodology: M.A.A. and I.A.; software: S.S.I. and I.A.; validation: S.S.I. and I.A.; formal analysis: M.A.A. and I.A.; writing—original draft preparation: M.A.A. and S.S.I.; writing—review and editing: M.A.A. and S.S.I.; funding: I.A. All authors have read and agreed to the published version of the manuscript.

Funding

The Researchers would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2025).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Hassouni, A.; Moudafi, A. A perturbed algorithm for variational inclusions. J. Math. Anal. Appl. 1994, 185, 706–712. [Google Scholar] [CrossRef]
  2. Huang, N.-J.; Fang, Y.-P. Generalized m-accretive mappings in Banach spaces. J. Sichuan Univ. (Nat. Sci. Ed.) 2001, 38, 591–592. [Google Scholar]
  3. Ahmad, R.; Ansari, Q.H. An iterative algorithm for generalized nonlinear variational inclusions. Appl. Math. Lett. 2000, 13, 23–26. [Google Scholar] [CrossRef]
  4. Browder, F.E. Nonlinear mappings of nonexpansive and accretive type in Banach spaces. Bull. Am. Math. Soc. 1967, 73, 875–882. [Google Scholar] [CrossRef]
  5. Fang, Y.-P.; Huang, N.-J. H-monotone operator and resolvent operator technique for variational inclusions. Appl. Math. Comput. 2003, 145, 795–803. [Google Scholar] [CrossRef]
  6. Fang, Y.-P.; Huang, N.-J. H-accretive operators and resolvent operator technique for solving variational inclusions in Banach spaces. Appl. Math. Lett. 2004, 17, 647–653. [Google Scholar] [CrossRef]
  7. AlNemer, G.; Ali, R.; Farid, M. On the strong convergence of combined generalized equilibrium and fixed point problems in a Banach space. Axioms 2025, 14, 428. [Google Scholar] [CrossRef]
  8. Iqbal, J.; Rajpoot, A.K.; Islam, M.; Ahmad, R.; Wang, Y. System of generalized variational inclusions involving Cayley operators and XOR-operation in q-uniformly smooth Banach spaces. Mathematics 2022, 10, 2837. [Google Scholar] [CrossRef]
  9. Tseng, P. A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 2000, 38, 431–446. [Google Scholar] [CrossRef]
  10. Noor, M.A. Generalized mixed variational inequalities and resolvent equations. Positivity 1997, 1, 145–154. [Google Scholar] [CrossRef]
  11. Noor, M.A. Generalized set-valued variational inclusions and resolvent equations. J. Math. Anal. Appl. 1998, 228, 206–220. [Google Scholar] [CrossRef]
  12. Polyak, B.T. Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 1964, 4, 1–17. [Google Scholar] [CrossRef]
  13. Ahmad, R.; Ali, I.; Rahaman, M.; Ishtyak, M.; Yao, J.C. Cayley inclusion problem with its corresponding generalized resolvent equation problem in uniformly smooth Banach spaces. Appl. Anal. 2022, 101, 1354–1368. [Google Scholar] [CrossRef]
  14. Ansari, Q.H.; Yao, J.-C. A fixed point theorem and its applications to a system of variational inequalities. Bull. Aust. Math. Soc. 1999, 59, 433–442. [Google Scholar] [CrossRef]
  15. Jabeen, S.; Noor, M.A.; Noor, K.I. Inertial iterative methods for general quasi variational inequalities and dynamical systems. J. Math. Anal. 2020, 11, 14–29. [Google Scholar]
  16. Barthel, B.; Gomez, S.; McKeon, B.J. Variational formulation of resolvent analysis. Phys. Rev. Fluids 2022, 7, 013905. [Google Scholar] [CrossRef]
  17. Rockafellar, R.T. Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 1976, 14, 877–898. [Google Scholar] [CrossRef]
  18. Tan, B.; Li, S. Strong convergence of inertial Mann algorithms for solving hierarchical fixed point problems. J. Nonlinear Var. Anal. 2020, 4, 337–355. [Google Scholar] [CrossRef]
  19. El Yazidi, Y.; Ellabib, A. An iterative method for optimal control of bilateral free boundaries problem. Math. Methods Appl. Sci. 2021, 44, 11664–11683. [Google Scholar] [CrossRef]
  20. Arifuzzaman, A.; Irfan, S.S.; Ahmad, I. On the convergence of the Yosida–Cayley variational inclusion problem with the XOR operation and inertial extrapolation scheme. Mathematics 2025, 13, 2447. [Google Scholar] [CrossRef]
  21. Bhat, I.A.; Nathiya, N.; Bhat, M.I. Convergence and stability analysis of a set-valued mixed variational inequality problem via three-step iterative approximation scheme. Chaos Solitons Fractals 2025, 201, 117221. [Google Scholar] [CrossRef]
  22. Rajpoot, A.K.; Ishtyak, M.; Ahmad, R.; Wang, Y.; Yao, J.-C. Convergence analysis for Yosida variational inclusion problem with its corresponding Yosida resolvent equation problem through inertial extrapolation scheme. Mathematics 2023, 11, 763. [Google Scholar] [CrossRef]
  23. Iqbal, J.; Wang, Y.; Rajpoot, A.K.; Ahmad, R. Generalized Yosida inclusion problem involving multi-valued operator with XOR operation. Demonstr. Math. 2024, 57, 20240011. [Google Scholar] [CrossRef]
  24. Zou, Y.-Z.; Huang, N.-J. H(·,·)-accretive operator with an application for solving variational inclusions in Banach spaces. Appl. Math. Comput. 2008, 204, 809–816. [Google Scholar] [CrossRef]
  25. Xu, H.-K. Inequalities in Banach spaces with applications. Nonlinear Anal. 1991, 16, 1127–1138. [Google Scholar] [CrossRef]
  26. Ahmad, R.; Rizvi, H.A.; Rahaman, M. H(·,·)-mixed relaxed co-monotone mapping and Ishikawa type iterative algorithm for generalized variational inclusions. Nonlinear Anal. Forum 2015, 20, 63–77. [Google Scholar]
Figure 1. Convergence of sequence a n with different starting points represented graphically.
Figure 1. Convergence of sequence a n with different starting points represented graphically.
Mathematics 13 03725 g001
Figure 2. Comparison of Algorithm 1 and Ishikawa-type Algorithm 4.1 in [26] with initial point x 0 = 3 .
Figure 2. Comparison of Algorithm 1 and Ishikawa-type Algorithm 4.1 in [26] with initial point x 0 = 3 .
Mathematics 13 03725 g002
Figure 3. Comparison of Algorithm 1 and Mann-type Algorithm 4.2 in [26] with initial point x 0 = 3 .
Figure 3. Comparison of Algorithm 1 and Mann-type Algorithm 4.2 in [26] with initial point x 0 = 3 .
Mathematics 13 03725 g003
Figure 4. (a) Comparison of Algorithm 1, Algorithm 2, and Ishikawa-type Algorithm 4.1 in [26]; (b) comparison of Algorithm 1, Algorithm 3, and Ishikawa-type Algorithm 4.1 in [26].
Figure 4. (a) Comparison of Algorithm 1, Algorithm 2, and Ishikawa-type Algorithm 4.1 in [26]; (b) comparison of Algorithm 1, Algorithm 3, and Ishikawa-type Algorithm 4.1 in [26].
Mathematics 13 03725 g004
Figure 5. (a) Comparison of Algorithm 1, Algorithm 2, and Mann-type Algorithm 4.2 in [26]; (b) comparison of Algorithm 1, Algorithm 3, and Mann-type Algorithm 4.2 in [26].
Figure 5. (a) Comparison of Algorithm 1, Algorithm 2, and Mann-type Algorithm 4.2 in [26]; (b) comparison of Algorithm 1, Algorithm 3, and Mann-type Algorithm 4.2 in [26].
Mathematics 13 03725 g005
Table 1. Results of the computations with different initial values 1 , 4 and −4.
Table 1. Results of the computations with different initial values 1 , 4 and −4.
No. of IterationsInitial Value a 0 = 1 Initial Value a 0 = 4 Initial Value a 0 = 4
(n) a n a n a n
10.500002.00000−2.00000
20.269041.07619−1.07619
30.151590.60637−0.60637
40.093920.37570−0.37570
50.062270.24911−0.24911
60.043720.17488−0.17488
70.032100.12840−0.12840
80.024420.09769−0.09769
90.019120.07649−0.07649
100.015330.06132−0.06132
110.012530.05013−0.05013
120.010410.04165−0.04165
130.008770.03510−0.03510
140.007480.02994−0.02994
150.006450.02580−0.02580
160.005610.02245−0.02245
170.004920.01968−0.01968
180.004340.01739−0.01739
190.003860.01546−0.01546
500.00050.0019−0.0019
1000.00010.0004−0.0004
1500.00000.0002−0.0002
2000.00000.0001−0.0001
2560.00000.00000.0000
Table 2. Comparison rate analysis of Algorithm 1 with Algorithms 4.1 and 4.2 in [26] with initial value x 0 = 3 .
Table 2. Comparison rate analysis of Algorithm 1 with Algorithms 4.1 and 4.2 in [26] with initial value x 0 = 3 .
No. of IterationsAlgorithm 1Algorithm 4.1 in [26]Algorithm 4.2 in [26]
(n) a n a n a n
0333
12.00002.05132.1750
20.79521.63291.7762
30.52141.38821.5320
40.31211.22401.3635
50.20791.10461.2385
60.14591.01291.1412
70.10710.93981.0627
80.08150.87980.9978
90.06380.82940.9429
100.05120786.40.8958
200.01150.54860.6311
300.00480.44210.5104
400.00300.37870.4380
500.00150.33570.3887
600.00100.30410.3524
700.00080.27970.3243
800.00060.26010.3017
900.00040.24390.2830
1000.00030.23030.2673
1200.00020.20850.2420
1400.00020.19160.2225
1600.00010.17810.2069
1800.00010.16700.1940
2000.00010.15760.1832
2200.00010.14960.1739
2400.00010.14260.1658
2500.00000.13950.1621
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

Alam, M.A.; Irfan, S.S.; Ahmad, I. Convergence Properties and Numerical Illustration of a Resolvent-Based Inertial Extrapolation Method for Variational Inclusions in Banach Space. Mathematics 2025, 13, 3725. https://doi.org/10.3390/math13223725

AMA Style

Alam MA, Irfan SS, Ahmad I. Convergence Properties and Numerical Illustration of a Resolvent-Based Inertial Extrapolation Method for Variational Inclusions in Banach Space. Mathematics. 2025; 13(22):3725. https://doi.org/10.3390/math13223725

Chicago/Turabian Style

Alam, Mohd Aftab, Syed Shakaib Irfan, and Iqbal Ahmad. 2025. "Convergence Properties and Numerical Illustration of a Resolvent-Based Inertial Extrapolation Method for Variational Inclusions in Banach Space" Mathematics 13, no. 22: 3725. https://doi.org/10.3390/math13223725

APA Style

Alam, M. A., Irfan, S. S., & Ahmad, I. (2025). Convergence Properties and Numerical Illustration of a Resolvent-Based Inertial Extrapolation Method for Variational Inclusions in Banach Space. Mathematics, 13(22), 3725. https://doi.org/10.3390/math13223725

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