Next Article in Journal
Temperature-Dependent Phase Variations in Van Der Waals CdPS3 Revealed by Raman Spectroscopy
Previous Article in Journal
Conformational and Chiroptical Properties of Salicylamide-Based Peptidomimetics
Previous Article in Special Issue
Robust Variable Selection Based on Relaxed Lad Lasso
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space

by
Mohammad Farid
1,* and
Saud Fahad Aldosary
2
1
Department of Mathematics, Deanship of Educational Services, Qassim University, Buraidah 51452, Saudi Arabia
2
Department of Mathematics, College of Science and Humanities in Alkharj, Prince Sattam bin Abdulaziz University, Alkharj 11942, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2024, 16(2), 139; https://doi.org/10.3390/sym16020139
Submission received: 13 December 2023 / Revised: 3 January 2024 / Accepted: 9 January 2024 / Published: 24 January 2024
(This article belongs to the Special Issue Symmetry in Functional Analysis and Engineering Mathematics)

Abstract

:
We formulate an iterative approach employing the inertial technique to approximate the anticipated solution for a generalized mixed variational-like inequality, as well as variational inequality and fixed point problems associated with a relatively nonexpansive multivalued mapping within the context of a real Banach space. Additionally, we delve into the robust convergence of our suggested algorithm. Furthermore, we highlight certain implications and present numerical observations to underscore the significance of our findings. The proposed theorem extends and consolidates several previously published works.

1. Introduction

Throughout the entire article, unless explicitly stated otherwise, we assume that Y is a two-uniformly convex and uniformly smooth Banach space, with Y denoting its dual. Let X represent a nonempty closed convex subset of Y. The fixed point problem (FPP) associated with a mapping T : X X is defined as the set { s X : T s = s } . The normalized duality mapping, denoted as J : Y 2 Y , is defined by J ( u ) = { u 0 E : u 0 , u = u 2 = u 0 2 } , for all u Y . This mapping assigns to each vector u a set of linear functionals in the dual space Y that satisfies specific orthogonality conditions.
The Lyapunov function, denoted as ϕ : Y × Y R , is defined as follows:
ϕ ( u 1 , u 2 ) = u 1 2 2 u 1 , J u 2 + u 2 2 , u 1 , u 2 X .
This Lyapunov function quantifies the distance between two vectors in the space Y through their norms and the action of the normalized duality mapping J.
It is essential to note that the characterization of the metric projection on a subset of a Hilbert space as nonexpansive is specific to Hilbert spaces, and is not readily applicable to more general Banach spaces. To address this limitation, Alber [1] introduced an operator in Banach space known as the generalized projection, as further discussed in [2]. The generalized projection extends the notion of projection to Banach spaces, providing a useful tool for solving optimization problems in more general functional settings.
We provide a concise overview of our proposed problem and its specific cases. We introduce the generalized mixed variational-like inequality problem (GMVLIP) as follows: Seek s 0 X satisfying
h ( s , s 0 ; s 0 ) + b ( s 0 , s ) b ( s 0 , s 0 ) 0 , s X ,
where h : X × X × X R and b : X × X R . The solution to (2) is denoted as Sol(GMVLIP(2)). When b 0 , GMVLIP (2) simplifies to
h ( s , s 0 ; s 0 ) 0 , s X ,
which represents the general variational-like inequality problem (GVLIP), as seen in [3,4]. Additionally, if h ( s , s 0 ; s 0 ) = D s 0 + A s 0 , η ( s , s 0 ) , where D , A : X Y and η : X × X Y , then (2) transforms into the mixed variational-like inequality problem (MVLIP) initiated by Noor [5]. Furthermore, by setting A 0 and b 0 , GMVLIP (2) becomes the variational-like inequality problem (VLIP), expressed as
D s 0 , η ( s , s 0 ) 0 , s X ,
as illustrated by Parida et al. [6]. This holds significant importance in mathematical programming. If we set η ( s , s 0 ) = s s 0 for all s , s o X , then the VLIP transforms into the classical variational inequality problem (abbreviated as VIP) [7], expressed as
D s 0 , s s 0 0 , s X .
Its solution is denoted as Sol(VIP (4)). If we set h ( s , s 0 ; s 0 ) f ( s 0 , s ) , where f : X × X R and D 0 , then GMVLIP (2) transforms into the equilibrium problem (abbreviated as EP) as
f ( s 0 , s ) 0 , s X ,
which was initiated by Blum et al. [8] in 1994. Its solution is described as Sol(EP (5)).
The generalized mixed variational-like inequality problem is recognized as a trifunction equilibrium problem. Consequently, the equilibrium problem can be viewed as a special case within the broader context of the trifunction equilibrium problem. The equilibrium problem is widely acknowledged for its substantial impact on the advancement of various scientific and engineering domains. Remarkably, it has become evident that many well-known problems can be conceptualized within the framework of the equilibrium problem, providing a natural, innovative, and unified approach to addressing issues in nonlinear analysis, optimization, economics, finance, game theory, physics, and engineering.
The theories developed for the equilibrium problem have demonstrated their applicability to numerous problems. Notably, this theoretical framework serves as a unifying structure for diverse problems encountered in mathematical programming, variational inclusion, variational inequality, complementary problems, saddle point problems, Nash equilibrium problems in noncooperative games, minimax inequality problems, minimization problems, and fixed point problems, as highlighted in [8,9,10,11,12].
In 1953, Mann [13] introduced an iterative algorithm for nonexpansive single-valued mappings and investigated weak convergence. Building upon Mann’s work, Haugazeau [14] introduced a hybrid projection iterative algorithm (HPIA) as an advancement. Subsequently, in 2003, Nakajo et al. [15] presented an HPIA that incorporates metric projection for a nonexpansive single-valued mapping in a Hilbert space, demonstrating strong convergence under specific parameter conditions.
In 2005, Matsushita et al. [16] introduced a hybrid iterative algorithm involving generalized projection, considering a more general space, namely, a Banach space. The algorithm is described by the following steps:
w 0 X , u n = J 1 ( β n w n + ( 1 β n ) w n ) , P n = { v X : ϕ ( v , u n ) ϕ ( v , w n ) } , Q n = { v X : w n v , J w 0 J w n } w n + 1 = Π P n Q n ( w 0 ) .
For additional sources and in-depth exploration, see [15,17,18,19,20].
In 1973, Markin [21] introduced the fixed point problem (FPP) for multivalued nonexpansive mappings, with wide-ranging applications in fields such as convex optimization and control theory, as demonstrated in [22,23,24]. In 2011, Homaeipour et al. [25] proposed an iterative scheme featuring a relatively nonexpansive multivalued mapping T, as outlined below:
w 0 X , w n + 1 = Π X J 1 ( β n J w n + ( 1 β n ) J v n ) , v n T w n .
Homaeipour et al. observed convergence of the sequence { w n } under specific conditions on the control sequence. In a more recent study, Zegeye et al. [26] delved into an iterative approach aimed at approximating the common solution of the equilibrium problem (EP) and the fixed point problem (FPP) for relatively nonexpansive multivalued mappings. Their work includes a comprehensive convergence analysis under suitable parameter conditions. Very recently, Taiwo et al. [27] introduced the following Halpern-S-iteration method:
w , w 1 , X , u n X such that f ( u n , u ) + 1 r n u u n , J u n J w n 0 , for all u X , z n = Π X J 1 ( ( 1 β n ) J w n + β n J v n ) , v n T w n , w n + 1 = J 1 ( β n J w + γ n J v n + η n J t n ) , t n T z n .
Their objective was to approximate the common solution of the equilibrium problem (EP) and the fixed point problem (FPP) for relatively nonexpansive multivalued mappings within uniformly convex and uniformly smooth Banach spaces. Furthermore, they successfully established strong convergence under appropriate conditions on the parameters.
A potent approach for enhancing the convergence rate of iterative algorithms involves incorporating an inertial term into the iterative scheme. Represented by γ n ( s n s n 1 ) , this term proves to be a valuable tool for boosting algorithmic performance, manifesting favorable convergence characteristics. The notion of the inertial extrapolation method was first introduced by Polyak [28], drawing inspiration from an implicit discretization of a second-order-in-time dissipative dynamical system known as the “Heavy Ball with Friction”.
In 2008, Mainge [29] introduced an inertial Krasnosel’skiǐ–Mann algorithm, which integrates the Krasnosel’skiǐ–Mann algorithm with inertial extrapolation
z n = s n + θ n ( s n s n 1 ) , s n + 1 = ( 1 ς n ) z n + ς n T z n .
for each n 1 . Mainge demonstrated that the sequence s n generated by the algorithm converges weakly to a fixed point of T under certain conditions on parameters. This development has ignited growing interest among researchers in this field, as evident in works such as [30,31,32,33,34,35].
Question: Could we apply the inertial technique involving the projection method for solving GMVLIP, VIP, and FPP for relatively nonexpansive multivalued mapping in the setting of two-uniformly convex and uniformly smooth Banach space?
Explanations: Exploring the synergy of the inertial technique with a projection method holds promise in addressing the challenges posed by the generalized mixed variational-like inequality problem (GMVLIP), variational inequality problem (VIP), and fixed point problem (FPP) associated with relatively nonexpansive multivalued mappings. This approach, especially when implemented in the realm of a two-uniformly convex and uniformly smooth Banach space, capitalizes on the inherent geometric and analytical advantages of such spaces. The inertial term, designed to expedite convergence through judicious extrapolation, combines seamlessly with the projection method, forming a robust strategy to tackle these intricate problems. Leveraging the unique properties of the Banach space, this combined methodology exhibits the potential for enhanced computational efficiency and convergence rates. This avenue of research opens doors to innovative solutions for a broad spectrum of applications in mathematical analysis and optimization.
Building upon the pioneering work of Taiwo et al. [27], Zegeye et al. [26], Mainge [29], and Farid et al. [9], we introduce a novel iterative algorithm incorporating the inertial technique. This algorithm is designed to ascertain the common solution of the generalized mixed variational-like inequality problem (GMVLIP), variational inequality problem (VIP), and fixed point problem (FPP) for relatively nonexpansive multivalued mappings. Our investigation into the strong convergence properties of this proposed method unveils specific aspects of our theorem, emphasizing its robustness. Furthermore, we conduct a computational analysis to underscore the significance of our findings and draw meaningful comparisons. The results presented in this paper contribute to the extension and unification of numerous previously established outcomes in this specific research domain.
The iterative model for variational-like inequality problems and related problems has several uses and applications, including
(1)
Numerical Solutions: Iterative models provide numerical solutions to variational-like inequality problems, offering a computational approach to finding approximate solutions when analytical solutions are challenging or not feasible.
(2)
Versatility Across Problem Classes: Iterative models can be adapted to solve various problem classes, such as variational inequalities, fixed point problems, and generalized mixed variational-like inequalities. This versatility makes them valuable tools for addressing a wide range of mathematical and optimization challenges.
(3)
Convergence Analysis: The iterative nature of these models allows for the study of convergence properties. Convergence analysis helps understand the behavior of the iterative process and establishes conditions under which the algorithm converges to a solution.
(4)
Image Reconstruction in Medical Imaging: In medical imaging, iterative models are used for image reconstruction problems formulated as variational inequalities. They provide a framework for obtaining high-quality images from noisy or incomplete data.
In essence, iterative models for variational-like inequality problems provide powerful computational tools with broad applications across mathematics, optimization, and various applied sciences. Their adaptability, versatility, and ability to handle complex, real-world problems make them valuable in both theoretical analysis and practical problem solving.
In summary, the study’s limitations include potential applicability restrictions to certain Banach spaces, algorithm complexity for practical implementation, sensitivity to parameter choices, possible slow convergence rates, lack of real-world validation, and limited generalization to other problem classes. Additionally, the algorithm’s sensitivity to initial guesses poses a consideration for its robustness. These factors highlight areas for further investigation and refinement in future research.
Our paper is organized as follows: In Section 2, we provide a comprehensive explanation of fundamental concepts and conduct a review of established results. Section 3 encapsulates our primary contributions, featuring the main theoretical developments, numerical analyses, and graphical presentations. The interpretation and implications of our work are thoroughly discussed in Section 4.

2. Preliminaries

In this section, we lay the groundwork for our study by presenting key preliminaries and fundamental concepts essential to understanding the subsequent theoretical developments. We delve into the background literature, outlining established results and theoretical frameworks that form the basis of our research. This foundation serves as a crucial stepping stone for the detailed exposition of our main contributions in the subsequent sections. In the context of a Banach space Y, the space is deemed strictly convex if the following condition holds: u 1 + u 2 2 < 1 for all distinct u 1 , u 2 U , where U = { u Y : u = 1 } . This strict convexity criterion ensures a distinct separation between vectors in the unit sphere.
The modulus of smoothness on Y is a mathematical operator denoted by ϱ Y : [ 0 , ) [ 0 , ) and defined as follows:
ϱ Y ( τ ) = sup 1 | u 1 + u 2 | + | u 1 u 2 | 2 1 : u 1 = 1 , u 2 = τ .
If ϱ Y ( τ ) > 0 for all τ > 0 , then Y is termed a smooth space, and it is considered uniformly smooth if the limit lim s 0 + ϱ Y ( s ) s = 0 holds.
Furthermore, the modulus of convexity on X is represented by δ Y : ( 0 , 2 ] [ 0 , 1 ] and defined as follows:
δ Y ( ϵ ) = inf 1 | u 1 + u 2 | 2 : u 1 = u 2 = 1 , u 1 u 2 = ϵ .
A space Y is termed uniformly convex if δ Y ( ϵ ) > 0 for all ϵ ( 0 , 2 ] . In the broader context, a space Y is considered p-uniformly convex if there exists a constant c p > 0 such that δ Y ( ϵ ) c p for all ϵ ( 0 , 2 ] , as detailed in [36]. For further elucidation, please refer to the cited source. Let us consider the space Y = l 2 , the space of square-summable sequences equipped with the standard l 2 norm. This space is both two-uniformly convex and uniformly smooth.
The function ϕ defined in (1), introduced by Alber [1], exhibits well-established properties for any u 1 , u 2 , u 3 X , and α ( 0 , 1 ) . These fundamental properties, deeply rooted in the theory of Banach spaces, serve as a cornerstone in various mathematical analyses and optimization frameworks.
(L1)
( u 1 u 2 ) 2 ϕ ( u 1 , u 2 ) ( u 1 + u 2 ) 2 ;
(L2)
ϕ ( u 1 , J 1 ( λ J u 2 + ( 1 λ ) J u 3 ) λ ϕ ( u 1 , u 2 ) + ( 1 λ ) ϕ ( u 1 , u 3 ) ;
(L3)
ϕ ( u 1 , u 2 ) = ϕ ( u 1 , u 3 ) + ϕ ( u 3 , u 2 ) + 2 u 3 u 1 , J u 2 J u 3 ;
(L4)
ϕ ( u 1 , u 2 ) 2 u 2 u 1 , J u 2 J u 1 .
Moving forward, we introduce the functional Φ : Y × Y R , defined as
Φ ( u , u ) = u 2 u , u + u 2 , u Y , u Y .
It is notable that Φ ( u , u ) = ϕ ( u , J 1 u ) , establishing a connection between Φ and the previously defined Lyapunov function ϕ . Moreover, Φ demonstrates convexity in its second argument. Furthermore,
Φ ( u , u ) + 2 J 1 u u , v Φ ( u , u + v ) ,
where this convexity property holds for all u Y and u , v Y , as established in [1]. These properties lay the groundwork for a deeper understanding of the behavior and properties of the functional Φ in various mathematical and analytical contexts.
An element u 0 X is considered an asymptotic fixed point of T : X X if there exists a sequence u n X with u n u 0 such that lim n T u n u n = 0 . The set of asymptotic fixed points is denoted as F ^ ( T ) . A map T is deemed relatively nonexpansive if F ^ ( T ) = F ( T ) and ϕ ( u 0 , T u ) ϕ ( u 0 , u ) , u X , u 0 F ( T ) .
Consider N ( X ) as a family of subsets of X, and C B ( X ) as a family of closed bounded subsets of X. The Hausdorff metric, denoted as H ( X 1 , X 2 ) , between X 1 and X 2 , where X 1 , X 2 C B ( X ) , is defined as
H ( X 1 , X 2 ) = max { sup u X 1 d ( u , X 2 ) , sup v X 2 d ( v , X 1 ) } ,
where d ( u , X 2 ) = inf { u u 0 : u 0 X 1 } .
A map T : X N ( X ) is nonexpansive if H ( T u 1 , T u 2 ) u 1 u 2 . An element u 0 X is considered an asymptotic fixed point if there exists a sequence { u n } X such that u n u 0 and lim n d ( T u n , u n ) = 0 .
A map T is said to be relatively nonexpansive if Fix ^ ( T ) = Fix ( T ) and ϕ ( u 0 , s ) ϕ ( u 0 , v ) for all v X , s T v , and u 0 F ( T ) . It is worth noting that Homaeipour et al. [25] provided a counterexample for a relatively nonexpansive multivalued mapping that is not nonexpansive. The concept of relative nonexpansiveness provides a broader understanding of the behavior of multivalued mappings, encompassing cases where traditional nonexpansiveness may not be applicable.
Relatively nonexpansive multivalued mappings in Banach spaces have applications in various fields. Here are some examples:
(1)
Fixed Point Theory: Relatively nonexpansive multivalued mappings are fundamental in fixed point theory. They play a crucial role in proving the existence and uniqueness of fixed points in Banach spaces.
(2)
Projection Operators: Multivalued projection operators onto convex sets are examples of relatively nonexpansive multivalued mappings. These operators find applications in solving variational inequalities and convex optimization problems.
(3)
Image Reconstruction: In medical imaging and signal processing, relatively nonexpansive multivalued mappings are applied to image reconstruction problems. They help in preserving certain structures in the reconstructed images.
(4)
Control Theory: In control theory, relatively nonexpansive multivalued mappings are used to model and analyze the behavior of dynamic systems. They play a role in stability analysis and controller design.
These applications highlight the versatility and importance of relatively nonexpansive multivalued mappings in various mathematical and applied areas.
Definition 1.
A map D : Y Y is characterized by the following properties:
(i)
It is monotone if u 1 u 2 , D u 1 D u 2 0 , u 1 , u 2 Y ;
(ii)
It is σ-inverse strongly monotone (ism) if σ > 0 , such that
u 1 u 2 , D u 1 D u 2 σ D u 1 D u 2 2 , u 1 , u 2 Y ;
(iii)
It is Lipschitz continuous if L > 0 , such that D u 1 D u 2 L u 1 u 2 .
Lemma 1
([36]). In a two-uniformly convex Banach space Y, for any x , y Y , the following inequality is satisfied:
u v 2 c J u J v ,
where 0 < c 1 , and c is referred to as the two-uniformly convex constant of Y.
Lemma 2
([37]). In a smooth and uniformly convex Banach space Y, consider two sequences { u n } and { v n } in Y, such that either { u n } or { v n } is bounded. If lim n ϕ ( u n , v n ) = 0 then lim n u n v n = 0 .
Remark 1
([37]). Certainly, when both sequences { u n } and { v n } are bounded, the converse of Lemma 2 holds as well.
Lemma 3
([18]). Consider a nonempty closed convex subset X of Y, a real Banach space, and D be a monotone and hemicontinuous mapping from X into Y . Then, the solution set of the variational inequality problem, denoted as VIP ( X , D ) or Sol ( VIP ( 4 ) ) , is closed and convex.
Lemma 4
([25]). Consider a strictly convex and smooth Banach space Y with a nonempty closed convex subset X. Let T : X C B ( X ) be a relatively nonexpansive multivalued mapping. Then, the fixed point set Fix ( T ) is closed and convex.
Lemma 5
([1]). In a reflexive, strictly convex, and smooth Banach space Y, consider a nonempty closed convex subset X. Then, u X and v Y , the inequality
ϕ ( u , Π X v ) + ϕ ( Π X v , v ) ϕ ( u , v ) ,
holds, where Π X denotes the generalized projection onto X.
Lemma 6
([1]). In a reflexive, strictly convex Banach space Y, with X being a nonempty closed convex subset of a smooth Banach space Y, for any u Y and w X , the following equivalence holds:
w = Π X u w v , J u J w 0 , v X .
Lemma 7
([38]). For a nondecreasing sequence { c n } of real numbers that increases at infinity, there exists a subsequence { c n i } such that c n i < c n i + 1 for all i N . Moreover, for a nondecreasing sequence { m k } N with m k and m k = max { j k : c j c j + 1 } , the following inequalities hold:
c m k c m k + 1 , c k c m k + 1 .
Lemma 8
([20]). Let B R ( 0 ) be a closed ball of Y, a uniformly convex Banach space. Then, g : [ 0 , ) [ 0 , ) , a continuous strictly increasing convex function with g ( 0 ) = 0 such that
λ 1 u 1 + λ 2 u 2 + + λ N x N 2 i = 1 N λ i u i 2 λ i λ j g ( u i u j ) , i , j = 0 , 1 , 2 , , N ,
where λ i ( 0 , 1 ) with i = 1 N λ i = 1 and u i B r ( 0 ) = { u Y : u r } .
Lemma 9
([39]). In the context of a p-uniformly convex Banach space E, the relationship between metric and Bregman distance is characterized by the following inequalities:
π p | w v | p D p ( w , v ) w v , J E p ( w ) J E q ( v ) ,
where π p is a fixed positive number. Additionally, using Young’s inequality for any q > 1 and 1 p + 1 q = 1 , we can further establish
J E p ( w ) , v   | J E p ( w ) | | v | 1 q | J E p ( w ) | q + 1 p | v | p = 1 q ( | w | p 1 ) q + 1 p | v | p = 1 q | w | p + 1 p | v | p .
These relationships highlight the interplay between the metric and Bregman distance in the specific setting of p-uniformly convex Banach spaces, providing valuable insights into the geometric properties of these spaces.
Lemma 10
([40]). Given a sequence of nonnegative real numbers { c n } satisfying the condition
c n + 1 ( 1 α n ) c n + α n ξ n , n m , for some m N ,
where α n ( 0 , 1 ) , ξ n R , lim n α n = 0 , n = 1 α n = , and lim sup n ξ n 0 , it follows that lim n c n = 0 . This result is established under the specified conditions on the sequence and provides insight into the convergence behavior of { c n } .
Assumption 1
([9]). The given assumptions on the function b : X × X R are as follows:
(i)
b is skew-symmetric, i.e., b ( x , x ) b ( x , z ) b ( z , x ) + b ( z , z ) 0 , x , z X ;
(ii)
b is convex in the second argument;
(iii)
b is continuous.
These conditions characterize the behavior of the function b with respect to skew symmetry, convexity in the second argument, and continuity. The auxiliary problems associated with the generalized mixed variational-like inequality problem (GMVLIP) (2) are formulated as follows: find x X such that
h ( z , x ; x ) + 1 τ z x , J x J z + b ( x , z ) b ( x , x ) 0 z X , τ > 0 .
These auxiliary problems involve the function h ( z , x ; x ) , and they play a role in finding a solution x that satisfies the conditions specified in the inequality (10).
The paragraph describes the assumptions and conditions for the auxiliary problems, denoted as AP (10), associated with the generalized mixed variational-like inequality problem (GMVLIP). The conditions for the existence of a solution to AP (10) are outlined as follows:
Lemma 11
([41]). Let X be a nonempty closed, convex, and bounded subset of a smooth strictly convex and reflexive Banach space Y. The function b : X × X R satisfies Assumption 1 (ii)–(iii) and α : X × X R is a bifunction. Additionally, h : X × X × X R , w X , and τ > 0 . The following conditions are assumed:
(i)
h ( z , x ; · ) is hemicontinuous;
(ii)
h ( · , x ; w ) is convex and lower semicontinuous;
(iii)
h ( x , z ; w ) + h ( z , x ; w ) = 0 ;
(iv)
h is generalized relaxed α-monotone, satisfying the inequality
h ( z , x ; z ) h ( z , x ; x ) α ( x , z ) ,
where α : Y × Y R such that
lim t 0 α ( x , t z + ( 1 t ) x ) t = 0 ;
(v)
α ( · , z ) is lower semicontinuous.
Under these conditions, it is asserted that AP (10) has a solution.
The paragraph introduces a mapping Υ r defined for a given x Y and τ > 0 . The mapping is defined as follows:
Υ r x = w X : h ( z , w ; w ) + 1 τ z w , J w J x + b ( w , z ) b ( w , w ) 0 , z X .
The paragraph indicates that the subsequent discussion will focus on examining certain properties of the mapping Υ r .
Lemma 12
([41]). Consider a nonempty, closed, convex, and bounded subset X of a smooth, strictly convex, and reflexive Banach space Y. Let h : X × X × X R satisfy all the conditions outlined in Lemma 11, and let b : X × X R adhere to the assumptions of 1. Assume the mapping Υ τ : Y X is defined as in (11). The ensuing properties can be established:
(i)
Υ τ x is single-valued;
(ii)
Υ τ x Υ τ z , J Υ τ x J x Υ τ x Υ τ z , J Υ τ z J z ;
(iii)
Fix ( Υ τ ) = Sol ( GMVLIP ( 2 ) ) is closed and convex;
(iv)
ϕ ( w , Υ τ x ) + ϕ ( Υ τ x , x ) ϕ ( w , x ) for all w Fix ( Υ τ ) , x Y .

3. Main Result

Theorem 1.
Let Y denote a two-uniformly convex and uniformly smooth real Banach space with dual space Y and X be a nonempty closed convex subset of Y. Consider a trifunction h : X × X × X R adhering to the conditions of Lemma 11, featuring continuous h ( z , . ; z ) , and a bifunction b : X × X R satisfying Assumption 1. Let D : Y Y be a σ-ism mapping, with σ ( 0 , 1 ) . Additionally, let T i : X C B ( X ) , where i = 1 , 2 , 3 , , N , form a finite family of relatively nonexpansive multivalued mappings. Assume Λ : = Sol ( GMVLIP ( 2 ) ) ( i = 1 N F ( T i ) ) Sol ( VIP ( 4 ) ) . Let the sequence { p n } be generated by following iterative
p 0 , p 1 X , t n = J 1 ( J p n + α n ( J p n J p n 1 ) ) , q n = Π X J 1 ( J t n δ n D t n ) , s n = Π X J 1 ( ζ n J t n + ( 1 ζ n ) J q n ) , h ( z , z n ; z n ) + 1 τ n z z n , J z n J s n + b ( z n , z ) b ( z n , z n ) 0 , z X , p n + 1 = J 1 ( μ n , 0 J z n + i = 1 N μ n , i J v n , i ) , v n , i T i s n , n 1 .
In the given conditions, where δ n , α n ( 0 , 1 ) , τ n ( 0 , ) , { ζ n } ( 0 , 1 ) with lim n ζ n = 0 , n = 1 ζ n = , and μ n , i ( 0 , 1 ) for i = 1 , 2 , 3 , , N with j = 0 N μ n , j = 1 , along with ρ n ( 0 , 1 ) satisfying ρ n 2 < ζ n . For any 0 < ρ , the following assumption is made:
α n = min { ρ n p n p n 1 , ρ } , if p n p n 1 , ρ , else .
Under these conditions, it can be concluded that the sequence { p n } converges strongly to x ^ Λ , where x ^ = Π Λ p 0 .
Proof. 
Firstly, we demonstrate that the sequence { p n } is bounded. To establish this, we take an arbitrary κ Λ . Then, we estimate, as follows, using Lemmas 5 and 6:
ϕ ( κ , q n ) = ϕ ( κ , Π X J 1 ( J t n δ n D t n ) ϕ ( κ , J 1 ( J t n δ n D t n ) = Φ ( κ , J t n δ n D t n ) Φ ( κ , J t n ) 2 δ n ( J t n δ n D t n ) κ , D t n = ϕ ( κ , t n ) 2 δ n t n q , D t n 2 δ n J 1 ( J t n δ n D t n ) t n , D t n = ϕ ( κ , t n ) 2 δ n t n q , D t n D κ 2 δ n J 1 ( J t n δ n D t n ) t n , D t n ϕ ( κ , t n ) 2 δ n σ D t n 2 + 2 δ n J 1 ( J t n δ n D t n ) J 1 J t n D t n ϕ ( κ , t n ) 2 δ n σ D t n 2 + 4 δ n 2 c 2 D t n 2 = ϕ ( κ , t n ) 2 δ n ( σ 2 η n c 2 ) D t n 2 .
Since η n < c 2 σ 2 , therefore
ϕ ( κ , q n ) ϕ ( κ , t n ) .
By applying Lemma 12, we compute
ϕ ( κ , p n ) = ϕ ( κ , Π X J 1 ( ζ n J t n + ( 1 ζ n ) J q n ) ) ϕ ( κ , J 1 ( ζ n J t n + ( 1 ζ n ) J q n ) ) = κ 2 2 κ , ζ n J t n + ( 1 ζ n ) J q n + ζ n J t n + ( 1 ζ n ) J q n 2 κ 2 2 ζ n κ , J t n 2 ( 1 ζ n ) κ , J q n + ζ n t n 2 + ( 1 ζ n ) q n 2 ζ n ϕ ( κ , t n ) + ( 1 ζ n ) ϕ ( κ , q n ) .
By applying (14) and (15), we get
ϕ ( κ , s n ) ζ n ϕ ( κ , t n ) + ( 1 ζ n ) ϕ ( κ , t n ) = ϕ ( κ , t n ) .
Next, we estimate
ϕ ( κ , p n + 1 ) = ϕ ( κ , J 1 ( μ n , 0 J z n + i = 1 N μ n , i J v n , i ) μ n , 0 ϕ ( κ , z n ) + i = 1 N μ n , i ϕ ( κ , v n , i ) μ n , 0 ϕ ( κ , Υ τ n s n ) + i = 1 N μ n , i ϕ ( κ , v n , i ) μ n , 0 ϕ ( κ , s n ) + ( 1 μ n , 0 ) ϕ ( κ , s n ) ϕ ( κ , s n ) .
Given that t n = J 1 ( J p n + α n ( J p n J p n 1 ) ) , we proceed to estimate this expression by employing Lemma 9, as follows:
t n κ , J t n J p n t n κ J t n J p n = α n J p n J p n 1 t n p n α n J p n J p n 1 [ 1 2 z n p n 2 + 1 2 ] α n 2 J p n J p n 1 [ 2 ( p n t n 2 + p n κ 2 ) ] + α n 2 J p n J p n 1 α n 2 J p n J p n 1 ( ϕ ( p n , t n ) + ϕ ( p n , q ) ) + α n 2 J p n J p n 1 ρ n 2 ( ϕ ( p n , t n ) + ϕ ( p n , κ ) ) + ρ n 2 , where ρ n = α n J p n J p n 1 .
Using the property (L3) of ϕ , we get
ϕ ( κ , t n ) = ϕ ( κ , p n ) ϕ ( t n , p n ) + κ t n , J t n J p n .
Combining (18) and (19), we get
ϕ ( κ , t n ) ( 1 + λ n 2 ) ϕ ( κ , p n ) ( 1 ρ n 2 ) ϕ ( p n , t n ) + ρ n 2 ( 1 + ζ n ) ϕ ( κ , p n ) ( 1 ζ n ) ϕ ( p n , t n ) + ζ n , take æ n 2 < 1 n ( 1 + ζ n ) ϕ ( κ , p n ) + ζ n .
By implementing (14), (17), (20), and applying induction, we obtain
ϕ ( κ , p n + 1 ) ( 1 + ζ n ) ϕ ( κ , p n ) + ζ n max { ϕ ( κ , p N ) } , n N .
Indeed, this implies that { p n } is bounded. Consequently, { t n } , { q n } , { s n } , and { z n } are also bounded.
Next, we demonstrate that κ Λ and p n κ . Let ϱ n = J 1 ( ζ n J t n + ( 1 ζ n ) J q n ) . For any κ Λ and using (7), we compute
ϕ ( κ , s n ) ϕ ( κ , ϱ n ) = Φ ( κ , J ϱ n ) Φ ( κ , J ϱ n ζ n ( J t n J κ ) ) 2 ϱ n κ , ζ n ( J t n J κ ) = ϕ ( κ , J 1 ( ζ n J κ + ( 1 ζ n ) J q n ) ) + 2 ζ n ϱ n κ , J t n J κ ( 1 ζ n ) ϕ ( κ , q n ) + 2 ζ n ϱ n κ , J t n J κ ( 1 ζ n ) ϕ ( κ , t n ) + 2 ζ n ϱ n κ , J t n J κ .
By utilizing Lemmas 8 and 12, the fact that T i is relatively nonexpansive, and (21), we obtain
ϕ ( κ , p n + 1 ) = ϕ ( κ , J 1 ( μ n , 0 J z n + i = 1 N μ n , i J v n , i ) ) μ n , 0 ϕ ( κ , z n ) + i = 1 N μ n , i ϕ ( κ , v n , i ) μ n , 0 μ n , i g ( J z n J v n , i ) = μ n , 0 ϕ ( κ , Ψ r n s n ) + i = 1 N μ n , i ϕ ( κ , v n , i ) μ n , 0 μ n , i g ( J z n J v n , i ) μ n , 0 ( ϕ ( κ , s n ) ϕ ( s n , v n ) ) + ( 1 μ n , 0 ) ϕ ( κ , s n ) μ n , 0 μ n , i g ( J z n J v n , i ) ( 1 ζ n ) ϕ ( κ , t n ) + 2 ζ n ϱ n κ , J t n J κ μ n , 0 ϕ ( s n , z n ) μ n , 0 μ n , i g ( J z n J v n , i ) ( 1 ζ n 2 ) ϕ ( κ , p n ) ( 1 ζ n ) 2 ϕ ( s n , t n ) + ζ n ( 1 ζ n ) + 2 ζ n ϱ n κ , J t n J κ μ n , 0 ϕ ( s n , z n ) μ n , 0 μ n , i g ( J z n J v n , i ) ,
and thus,
ϕ ( κ , p n + 1 ) ( 1 ζ n 2 ) ϕ ( κ , t n ) + 2 ζ n ϱ n κ , J t n J κ + ζ n ( 1 ζ n ) .
Now, we consider two cases: Case 1. Assume that for some m 0 N , ϕ ( κ , p n ) is monotonically nonincreasing for all n m 0 , and since ϕ ( κ , p n ) is bounded, it must be convergent. Therefore, by utilizing (22), it follows that ϕ ( p n , t n ) 0 and ϕ ( s n , z n ) 0 as n . Additionally, employing Lemma 2, we can further deduce
lim n p n t n = 0 and lim n s n z n = 0 .
Also, by implementing (22), μ n , 0 μ n , i g ( J z n J v n , i ) 0 as n , which yields that J z n J v n , i 0 , and thus, by using uniform continuity of J 1 , we have
lim n z n v n , i = 0 , for each i = 1 , 2 , , N .
Using (15) and (13), we get
ϕ ( κ , s n ) ζ n ϕ ( κ , t n ) + ( 1 ζ n ) ϕ ( κ , q n ) ϕ ( κ , t n ) 2 δ n ( σ 2 δ n c 2 ) D t n 2 ,
which yields that
2 δ n ( σ 2 δ n c 2 ) D t n 2 ϕ ( κ , t n ) ϕ ( κ , s n ) .
Since lim inf n ( 1 ζ n ) > 0 , δ n ( σ 2 δ n c 2 ) > 0 , therefore
lim n D t n = 0 .
Using (7) and Lemma 1, we get
ϕ ( t n , q n ) = ϕ ( t n , Π X J 1 ( J t n δ n D t n ) ) ϕ ( t n , J 1 ( J t n δ n D t n ) ) Φ ( t n , ( J t n δ n D t n ) ) Φ ( t n , ( J t n δ n D t n ) + δ n D t n ) 2 J 1 ( J t n δ n D t n ) t n , δ n D t n = ϕ ( t n , t n ) + 2 J 1 ( J t n δ n D t n ) t n , δ n D t n = 2 δ n J 1 ( J t n δ n D t n ) t n , D t n J 1 ( J t n δ n D t n ) J 1 J t n 4 c 2 δ n 2 D t n 2 ,
and by applying (27), we get
lim n ϕ ( t n , q n ) = 0 .
According to Lemma 2,
t n q n 0 as n .
Applying Lemmas 5 and 6, we compute
ϕ ( t n , s n ) = ϕ ( t n , Π X ϱ n ) ϕ ( t n , ϱ n ) = ϕ ( t n , J 1 ( ζ n J t n + ( 1 ζ n ) J q n ) ) ζ n ϕ ( t n , t n ) + ( 1 ζ n ) ϕ ( t n , q n ) 0 as n ,
which implies that
t n s n 0 , t n ϱ n 0 , as n .
Thus, for each i = 1 , 2 , , N , we have
d ( s n T i s n )   s n v n , i s n z n + z n v n , i 0 , as n .
Assume { ϱ n i } is a subsequence of { ϱ n } with ϱ n i ϱ and sup n ϱ n κ , J t n J κ = lim i ϱ n i κ , J t n i J κ . Thus, by applying (30), (32), and the concept of J, we get
s n i , z n i ϱ , J s n J z n 0 , as n .
Next, we show that κ Sol ( VIP ( 4 ) ) . Applying the concept of σ -ism mapping of D, and by implementing (27) and (24), we obtain lim n p n = κ and κ D 1 ( 0 ) . Hence, κ Sol ( VIP ( 4 ) ) .
Further, we show that κ Sol ( GMVLIP ( 2 ) ) , as z n = Υ τ n s n . Therefore,
h ( y , z n i ; z n i ) + b ( y , z n i ) b ( z n i , z n i ) + 1 τ n i y z n i , J z n i J s n i 0 , y X .
Using (34) and lim inf n τ n i > 0 , we have
lim n J s n i J z n i τ n i = 0 .
By the concept of generalized relaxed α -monotonicity of h and (35), we have
y z n i J z n i J s n i τ n i 1 τ n i y z n i , J z n i J s n i h ( y , z n i ; z n i ) + b ( z n i , z n i ) b ( z n i , y ) α ( z n i , y ) h ( y , z n i ; y ) + b ( z n i , z n i ) b ( z n i , y ) .
Through the lower semicontinuity of α in the first argument, continuity of h in the second argument, continuity of b, τ n ϵ , and (36), we obtain
α ( κ , y ) h ( y , κ ; y ) + b ( κ , κ ) b ( κ , y ) 0 y X .
Let y s = ( 1 s ) κ + s y , s ( 0 , 1 ] . Since y , κ X , we get y s X , and hence,
α i ( κ , y s ) h ( y s , κ ; y s ) + b ( κ , κ ) b ( κ , y s ) 0 ,
which implies that
α ( κ , y s ) h ( y s , κ ; y s ) b ( κ , κ ) + b ( κ , y s ) s h ( y , κ ; y ) + ( 1 s ) h ( κ , κ ; y s ) b ( κ , κ ) + s b ( κ , y ) + ( 1 s ) b ( κ , κ ) s [ h ( y , κ ; y s ) + b ( κ , y ) b ( κ , κ ) ] .
Since h ( y , κ ; · ) is hemicontinuous, we have
lim s 0 { h ( y , κ ; y s ) + b ( κ , y ) b ( κ , κ ) } lim s 0 α ( κ , y s ) s ,
which implies
h ( y , κ ; κ ) + b ( κ , y ) b ( κ , κ ) 0 .
Hence, κ Sol ( GMVLIP ( 2 ) ) . Thus, κ Γ .
Further, we show that κ i = 1 N F ( T i ) . Using (32), (34), and the concept of T, we get κ F ( T i ) , which yields that κ i = 1 N F ( T i ) , i = 1 , 2 , 3 , , N . Hence, κ Λ . By applying Lemma 6, we get sup n ϱ n x ^ , J t n J x ^ = lim i ϱ n i x ^ , J t n i J x ^ 0 . Thus, according to Lemma 10 and (23), ϕ ( p n , x ^ ) 0 as n . Further, using Lemma 2, we observe that x ^ = Π Λ p 0 .
Case 2. Assume { ϕ ( κ , p n ) } is not monotonically decreasing. Then, there exists a subsequence { p n i } of { p n } with ϕ ( κ , p n i ) < ϕ ( κ , p n i + 1 ) , for each i = 1 , 2 , , N . By applying Lemma 7, there exists a nondecreasing sequence { m j } N with m j , ϕ ( κ , p m j ) ϕ ( κ , p m j + 1 ) and ϕ ( κ , p j ) ϕ ( κ , p m j + 1 ) , for j N . Using (22), we get
( 1 ζ m j ) 2 ϕ ( p m j , t m j ) + μ m j , 0 ϕ ( s m j , z m j ) + μ m j , 0 μ m j , i g ( J z m j J v m j , i ) ( 1 ζ m j 2 ) ϕ ( x ^ , p m j ) ϕ ( x ^ , p m j + 1 ) + ζ m j ( 1 ζ m j ) + 2 ζ m j ϱ m j x ^ , J t m j J x ^ .
Using similar arguments to those of case 1, we have for each i = 1 , 2 , , N , p m j t m j 0 , z m j v m j , i 0 and z m j v m j , i 0 as j .
Thus,
lim sup j ϱ m j x ^ , J t m j J x ^ 0 .
Using (23), we obtain
ϕ ( x ^ , p m j + 1 ) ( 1 ζ n 2 ) ϕ ( x ^ , p m j ) + 2 ζ m j ϱ m j x ^ , J t m j J x ^ + ς m j ( 1 ζ m j ) .
Since ϕ ( x ^ , p m j ) ϕ ( x ^ , p m j + 1 ) , for each j N ; therefore, from (37) and (38), we have ϕ ( x ^ , p m j ) 0 and ϕ ( x ^ , p m j + 1 ) 0 as j . Also, ϕ ( x ^ , p j ) ϕ ( x ^ , p m j + 1 ) , for each j N ; therefore, p j x ^ as j . Thus, based on the above two cases, we observe that the sequence { p n } converges strongly to x ^ = Π Λ p 0 . □
Building upon the results established in Theorem 1, we derive several corollaries that extend the applicability and significance of the proposed iterative approach. These corollaries encapsulate key insights obtained from the main theorem, providing a structured overview of its broader implications. Moreover, they pave the way for the exploration and application of the presented iterative scheme across various mathematical and computational domains.
If we specialize Theorem 1 by considering the case where N = 1 , a pertinent corollary unfolds. This focused examination serves to enhance our understanding of the iterative process and its relevance in singular cases.
Corollary 1.
In a real Banach space Y, assumed to be two-uniformly convex and uniformly smooth with the dual space Y, consider a trifunction h : X × X × X R adhering to the conditions of Lemma 11, featuring continuous h ( z , . ; z ) , and a bifunction b : X × X R satisfying Assumption 1. Let D : Y Y be a σ-ism mapping, with σ ( 0 , 1 ) . Additionally, let T : X C B ( X ) be a relatively nonexpansive multivalued mapping. Assume the nonempty intersection Λ : = Sol ( GMVLIP ( 2 ) ) F ( T ) Sol ( VIP ( 4 ) ) is not empty. Then, the sequence { p n } generated by (12) converges strongly to x ^ Λ , where x ^ = Π Λ p 0 .
Continuing in the same vein, we delve into additional implications and consequences stemming from the conditions outlined in Theorem 1, particularly when h and b are explicitly assumed to be zero.
Corollary 2.
In a real Banach space Y, assumed to be two-uniformly convex and uniformly smooth with the dual space Y . Let D : Y Y be a σ-ism mapping, with σ ( 0 , 1 ) . Additionally, let T i : X C B ( X ) , where i = 1 , 2 , 3 , , N , form a finite family of relatively nonexpansive multivalued mappings. Assume the nonempty intersection Λ : = ( i = 1 N F ( T i ) ) Sol ( VIP ( 4 ) ) is not empty. Then, the sequence { p n } generated by (12) converges strongly to x ^ Λ , where x ^ = Π Λ p 0 .
Remark 2.
If Y is a Hilbert space denoted as H, then the dual space Y coincides with H, and the mapping J becomes the identity operator I. The function ϕ ( u , v ) can be expressed as u v 2 for all u , v Y , with c representing the two-uniformly convex constant of Y. Additionally, the operator Π X corresponds to the metric projection P X onto the convex set X. Notably, in the context of Hilbert spaces, the concept of a relatively nonexpansive mapping aligns with that of a nonexpansive mapping. These simplifications emerge from the inherent properties and structures of Hilbert spaces, facilitating a more straightforward interpretation of various operations and concepts.
Verification: Let us consider the Hilbert space R 2 with the standard Euclidean inner product. The Riesz representation theorem tells us that the dual space of R 2 is isomorphic to R 2 itself.
Now, let us take a specific vector in R 2 , say v = ( 3 , 4 ) . According to the Riesz representation theorem, the corresponding linear functional in the dual space is given by L v ( u ) = v , u , where u is any vector in R 2 .
Now, let us normalize L v by dividing it by its norm. The norm of L v is L v = v = 5 (the Euclidean norm of v). So, the normalized dual functional is 1 5 L v .
For any vector u = ( a , b ) in R 2 , the normalized dual functional evaluates to
1 5 L v ( u ) = 1 5 v , u = 1 5 ( 3 a + 4 b )
Now, let us consider this normalized dual functional in the context of the Hilbert space. If we take a vector u = 3 5 , 4 5 , the inner product v , u is equal to 3 · 3 5 + 4 · 4 5 = 25 5 = 5 . This value is exactly the same as the evaluation of the normalized dual functional on u .
So, in this numerical example, normalizing the dual functional L v yields a corresponding vector in the Hilbert space, illustrating the concept of the normalized duality mapping as an identity mapping in this context.

4. Numerical Example

Example 1.
Consider the real space Y = R and the closed convex subset X = [ 0 , 5 ] . For any p , t R , define the functions h ( p , t ; t ) = ( p t ) ( p + 2 t ) , α ( t , p ) = ( p t ) 2 , and b ( p , t ) = p t . Let D be a 1 2 -ism mapping, specifically D ( p ) = 2 p , and T ( p ) = [ 0 , p 7 ] . It is evident that h and b satisfy Assumption 1. Moreover, F ( T ) = 0 , and for any t T p , it holds that ϕ ( 0 , t ) = 0 t 2 0 p 2 = ϕ ( 0 , p ) .
Let q F ^ ( T ) . Then, there exists a sequence { p n } with p n κ and d ( p n , T p n ) = 6 7 p n 0 as n . This implies that p n 0 , and consequently, κ = 0 . Therefore, F ^ ( T ) = F ( T ) = 0 , signifying that T is relatively nonexpansive. Since z n = Υ τ n s n , therefore, for any w X
h ( w , z n ; z n ) + 1 τ n w z n , z n s n + b ( z n , w ) b ( z n , z n ) 0 ( w z n ) ( w + 2 z n ) + 1 τ n ( w z n ) ( z n s n ) + z n w z n 2 0 τ n w 2 + ( 2 τ n z n + z n s n ) w + ( 3 τ n z n 2 + z n s n z n 2 ) 0 .
Assume F ( w ) = τ n w 2 + ( 2 τ n z n + z n s n ) w + ( 3 τ n z n 2 + z n s n z n 2 ) , which is a quadratic relation in w and its discriminant is
d = ( 2 τ n z n + z n s n ) 2 4 τ n ( 3 τ n z n 2 + z n s n z n 2 ) = 16 τ n 2 z n 2 + 8 τ n z n 2 8 τ n s n z n + z n 2 2 s n z n + s n 2 = ( 16 τ n 2 + 8 τ n + 1 ) z n 2 2 s n ( 4 τ n + 1 ) z n + s n 2 = ( ( 4 τ n + 1 ) z n s n ) 2 ,
which is a complete square. This means that Υ τ n ( s n ) = z n is single-valued. Thus, z n = s n 4 τ n + 1 . Note that in this scenario, the parameters are chosen as τ n = { 1 4 } , δ n = { 9 10 n } , ζ n = { 2 5 n } , ρ n = { 1 5 ( n + 1 ) } and μ n , 0 = { 1 2 ( n + 1 ) } . For each i = 1 , 2 , 3 , , N , v n , i [ 0 , s n 7 i ] . Choose
α n = min { 1 5 ( n + 1 ) p n p n 1 , 0.1 } , if p n p n 1 , 0.1 , else .
Then, the sequence { p n } , originated by (12), converges to x ^ = { 0 } Θ .
To compute and compare the results, MATLAB R2015(a) was utilized. The same initial points ( p 0 , p 1 ) were used for both the proposed algorithm and Mainge’s algorithm, while for Homaeipur et al., only p 1 was employed. The stopping criterion for the computation was set as | p n + 1 p n | < 10 10 . The computed and compared results are presented in Table 1 and Table 2 and Figure 1 and Figure 2, respectively.

5. Conclusions

In summary, our investigation has led to several notable discoveries. The algorithm proposed in this study demonstrates robust convergence within the context of a two-uniformly convex and uniformly smooth real Banach space, featuring a relatively nonexpansive multivalued mapping. The theoretical results find support in numerical experiments conducted using Matlab R2015(a). Comparative analyses with existing algorithms, including those by Homaeipour et al. and Mainge, were performed under consistent conditions. The results, detailed in Table 1 and Table 2 and Figure 1 and Figure 2, underscore the effectiveness of our approach in terms of convergence behavior. These findings contribute valuable insights to ongoing research in optimization algorithms, highlighting the potential applicability of the proposed method in diverse contexts.

Author Contributions

M.F.: Writing—Original Draft, Software; S.F.A.: Review and Editing. All authors have read and agreed to the published version of the manuscript.

Funding

The APC was funded by Deanship of Scientific Research, Qassim University, Saudi Arabia.

Data Availability Statement

Data are contained within the article.

Acknowledgments

Researchers would like to thank the Deanship of Scientific Research, Qassim University for funding publication of this project.

Conflicts of Interest

The authors declare that they have no competing interests.

References

  1. Alber, Y.I. Metric and generalized projection operators in Banach spaces. In Theory and Applications of Nonlinear Operators of Accretive and Monotone Type; Dekker: New York, NY, USA, 1996; pp. 15–50. [Google Scholar]
  2. Reich, S. A weak convergence theorem for the alternating method with Bregman distances. In Theory and Applications of Nonlinear Operators of Accretive and Monotone Type; Kartsatos, A.G., Ed.; Lecture Notes in Pure and Applied Mathematics; Dekker: New York, NY, USA, 1996; Volume 178, pp. 313–318. [Google Scholar]
  3. Mahato, N.K.; Nahak, C. Hybrid projection methods for the general variational-like inequality problems. J. Adv. Math. Stud. 2013, 6, 143–158. [Google Scholar]
  4. Preda, V.; Beldiman, M.; Batatoresou, A. On variational-like inequalities with generalized monotone mappings. In Generalized Convexity and Related Topics; Lecture Notes in Economics and Mathematical Systems; Springer: Berlin/Heidelberg, Germany, 2006; Volume 583, pp. 415–431. [Google Scholar]
  5. Noor, M.A. General nonlinear mixed variational-like inequalities. Optimization 1996, 37, 357–367. [Google Scholar] [CrossRef]
  6. Parida, J.; Sahoo, M.; Kumar, A. A variational-like inequalitiy problem. Bull. Austral. Math. Soc. 1989, 39, 225–231. [Google Scholar] [CrossRef]
  7. Hartman, P.; Stampacchia, G. On some non-linear elliptic differential-functional equation. Acta Mathenatica 1996, 115, 271–310. [Google Scholar] [CrossRef]
  8. Blum, E.; Oettli, W. From optimization and variational inequalities to equilibrium problems. Math. Stud. 1994, 63, 123–145. [Google Scholar]
  9. Farid, M.; Cholamjiak, W.; Ali, R.; Kazmi, K.R. A new shrinking projection algorithm for a generalized mixed variational-like inequality problem and asymptotically quasi-ϕ-nonexpansive mapping in a Banach space. Rev. Real Acad. Cienc. Exactas FíSicas Nat. Ser. MatemáTicas 2021, 115, 114. [Google Scholar]
  10. Khan, M.B.; Noor, M.A.; Noor, K.I.; Chu, Y.M. Higher-Order Strongly Preinvex Fuzzy Mappings and Fuzzy Mixed Variational-Like Inequalities. Int. J. Comput. Intell. 2021, 14, 1856–1870. [Google Scholar] [CrossRef]
  11. Moudafi, A. Second order differential proximal methods for equilibrium problems. J. Inequal. Pure Appl. Math. 2003, 4, 18. [Google Scholar]
  12. Daniele, P.; Giannessi, F.; Mougeri, A. (Eds.) Equilibrium Problems and Variational Models; Nonconvex Optimization and Its Application; Kluwer Academic Publications: Norwell, MA, USA, 2003; Volume 68. [Google Scholar]
  13. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  14. Haugazeau, Y. Sur les Inequations Variationnelles et la Minimisation de Fonctionnelles Convexes. These, Universite de Paris. 1968. Available online: https://cir.nii.ac.jp/crid/1572261550817940096 (accessed on 12 December 2023).
  15. Nakajo, K.; Takahashi, W. Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups. J. Math. Anal. Appl. 2003, 279, 372–379. [Google Scholar] [CrossRef]
  16. Matsushita, S.Y.; Takahashi, W. A strong convergence theorem for relatively nonexpansive mappings in a Banach space. J. Approx. Theory 2005, 134, 257–266. [Google Scholar] [CrossRef]
  17. Farid, M.; Irfan, S.S.; Khan, M.F.; Khan, S.A. Strong convergence of gradient projection method for generalized equilibrium problem in a Banach space. J. Inequalities Appl. 2017, 2017, 297. [Google Scholar] [CrossRef] [PubMed]
  18. Nakajo, K. Strong convergence for gradient projection method and relatively nonexpansive mappings in Banach spaces. Appl. Math. Comput. 2017, 271, 251–258. [Google Scholar] [CrossRef]
  19. Takahashi, W.; Zembayashi, K. Strong and weak convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces. Nonlinear Anal. 2009, 70, 45–57. [Google Scholar] [CrossRef]
  20. Zegeye, H.; Ofoedu, E.U.; Shahzad, N. Convergence theorems for equilibrium problem, variational inequality problem and countably infinite relatively quasi-nonexpansive mappings. Appl. Math. Comput. 2010, 216, 3439–3449. [Google Scholar] [CrossRef]
  21. Markin, J.T. Continuous dependence of fixed point sets. Proc. Am. Math. Soc. 1973, 38, 545–547. [Google Scholar] [CrossRef]
  22. Górniewicz, L. Topological Fixed Point Theory of Multivalued Mappings. In Mathematics and Its Applications; Kluwer Academic: Dordrecht, The Netherlands, 1999; Volume 495. [Google Scholar]
  23. Lim, T.C. A fixed point theorem for multivalued nonexpansive mappings in a uniformly convex Banach space. Bull. Am. Math. Soc. 1974, 80, 1123–1126. [Google Scholar] [CrossRef]
  24. Nadler, S.B. Multi-valued contraction mappings. Pac. J. Math. 1969, 30, 475–488. [Google Scholar] [CrossRef]
  25. Homaeipour, S.; Razani, A. Weak and strong convergence theorems for relatively nonexpansive multi-valued mappings in Banach spaces. Fixed Point Theory Appl. 2011, 2011, 73. [Google Scholar] [CrossRef]
  26. Zegeye, H.; Shahzad, N. Convergence theorems for a common point of solutions of equilibrium and fixed point of relatively nonexpansive multivalued mapping problems. Abstr. Appl. Anal. 2012, 2012, 859598. [Google Scholar] [CrossRef]
  27. Taiwo, A.; Alakoya, T.O.; Mewomo, O.T. Strong convergence theorem for fixed points of relatively nonexpansive multi-valued mappings and equilibrium problems in Banach spaces. Asian-Eur. J. Math. 2021, 14, 2150137. [Google Scholar] [CrossRef]
  28. Polyak, B.T. Some methods of speeding up the convergence of iterates methods. USSR Comput. Math. Math. Phys. 1964, 4, 1–17. [Google Scholar] [CrossRef]
  29. Maingé, P.E. Convergence theorem for inertial KM-type algorithms. J. Comput. Appl. Math. 2019, 219, 223–236. [Google Scholar] [CrossRef]
  30. Dong, Q.L.; Yuan, H.B.; Cho, Y.J.; Rassias, T.M. Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings. Optim. Lett. 2018, 12, 87–102. [Google Scholar] [CrossRef]
  31. Bot, R.I.; Csetnek, E.R.; Hendrich, C. Inertial Douglas-Rachford splitting for monotone inclusion problems. Appl. Math. Comput. 2015, 256, 472–487. [Google Scholar]
  32. Alansari, M.; Ali, R.; Farid, M. Strong convergence of an inertial iterative algorithm for variational inequality problem, generalized equilibrium problem, and fixed point problem in a Banach space. J. Inequalities Appl. 2020, 2020, 42. [Google Scholar] [CrossRef]
  33. Tan, B.; Cho, S.Y.; Yao, J.C. Accelerated inertial subgradient extragradientalgorithms with non-monotonic step sizes for equilibrium problemsand fixed point problems. J. Nonlinear Var. Anal. 2022, 6, 89–122. [Google Scholar]
  34. Farid, M.; Ali, R.; Kazmi, K.R. Inertial iterative method for a generalized mixed equilibrium, variational inequality and a fixed point problems for a family of quasi-ϕ-nonexpansive mappings. Filomat 2023, 37, 6133–6150. [Google Scholar]
  35. Zhang, Y.; Wang, Y. A new inertial iterative algorithm for splitnull point and common fixed point problems. J. Nonlinear Funct. Anal. 2023, 2023, 36. [Google Scholar]
  36. Xu, H.K. Inequalities in Banach spaces with applications. Nonlinear Anal. 1991, 16, 1127–1138. [Google Scholar] [CrossRef]
  37. Kamimura, S.; Takahashi, W. Strong convergence of a proximal-type algorithim in a Banach space. SIAM J. Optim. 2002, 13, 938–945. [Google Scholar] [CrossRef]
  38. Maingé, P.E. Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal. 2008, 16, 899–912. [Google Scholar] [CrossRef]
  39. Schopfer, F.; Schuster, T.; Louis, A.K. An iterative regularization method for solving the split feasibility problem in Banach spaces. Inverse Probl. 2008, 24, 055008. [Google Scholar] [CrossRef]
  40. O’Hara, J.G.; Pillay, P.; Xu, H.K. Iterative approaches to convex feasibility problems in Banach spaces. Nonlinear Anal. 2006, 64, 2022–2042. [Google Scholar] [CrossRef]
  41. Kazmi, K.R.; Ali, R. Hybrid projection methgod for a system of unrelated generalized mixed variational-like inequality problems. Georgian Math. J. 2019, 26, 63–78. [Google Scholar] [CrossRef]
Figure 1. Producing a plot to visually depict the numerical insights outlined in Table 1 [25,29].
Figure 1. Producing a plot to visually depict the numerical insights outlined in Table 1 [25,29].
Symmetry 16 00139 g001
Figure 2. Producing a plot to visually depict the numerical insights outlined in Table 2 [25,29].
Figure 2. Producing a plot to visually depict the numerical insights outlined in Table 2 [25,29].
Symmetry 16 00139 g002
Table 1. Numerical observations corresponding to the initial point ( p 0 , p 1 ) = ( 0.01 , 0.17 ) .
Table 1. Numerical observations corresponding to the initial point ( p 0 , p 1 ) = ( 0.01 , 0.17 ) .
No. of IterationsProposed Alg.Mainge [29] Alg.Homaeipur et al. [25] Alg.
ValuesValuesValues
10.01477090910.08568000000.0728571429
20.00078299780.04331123230.0353877551
30.00003495380.02262806740.0180549771
40.00000128000.01203959980.0094573690
50.00000003950.00648118450.0050357419
60.00000000110.00351801500.0027115533
70.00000000000.00192152990.0014719861
80.00000000000.00105465700.0008040260
90.00000000000.00058113340.0004413075
100.00000000000.00032124660.0002431694
Table 2. Numerical observations corresponding to the initial point ( p 0 , p 1 ) = ( 1 , 1.49 ) .
Table 2. Numerical observations corresponding to the initial point ( p 0 , p 1 ) = ( 1 , 1.49 ) .
No. of IterationsProposed Alg.Mainge [29] Alg.Homaeipur et al. [25] Alg.
ValuesValuesValues
10.15748077920.74751428570.6385714286
20.00274510520.35013285350.3101632653
30.00007250960.17823318510.1582465639
40.00000264690.09427401840.0828910573
50.00000008160.05065749710.0441367967
60.00000000220.02747870800.0237659675
70.00000000010.01500479300.0129015252
80.00000000000.00823465910.0070470516
90.00000000000.00453721270.0038679306
100.00000000000.00250808620.0021313087
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

Farid, M.; Aldosary, S.F. An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space. Symmetry 2024, 16, 139. https://doi.org/10.3390/sym16020139

AMA Style

Farid M, Aldosary SF. An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space. Symmetry. 2024; 16(2):139. https://doi.org/10.3390/sym16020139

Chicago/Turabian Style

Farid, Mohammad, and Saud Fahad Aldosary. 2024. "An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space" Symmetry 16, no. 2: 139. https://doi.org/10.3390/sym16020139

APA Style

Farid, M., & Aldosary, S. F. (2024). An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space. Symmetry, 16(2), 139. https://doi.org/10.3390/sym16020139

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