Next Article in Journal
Bessel–Riesz Operator in Variable Lebesgue Spaces Lp(·)(R+)
Previous Article in Journal
A Novel Robust Test to Compare Covariance Matrices in High-Dimensional Data
Previous Article in Special Issue
I-Convergence Sequence Paranormed Spaces of Order (α, β)
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Strong Convergence of Combined Generalized Equilibrium and Fixed Point Problems in a Banach Space

1
Department of Mathematical Sciences, College of Sciences, Princess Nourah bint Abdulrahman University, Riyadh 11671, Saudi Arabia
2
Department of Mathematics, Central University of Kashmir Ganderbal, Jammu and Kashmir 191131, India
3
Department of Mathematics, College of Science, Qassim University, Saudi Arabia
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(6), 428; https://doi.org/10.3390/axioms14060428
Submission received: 7 April 2025 / Revised: 9 May 2025 / Accepted: 26 May 2025 / Published: 30 May 2025
(This article belongs to the Special Issue Research on Functional Analysis and Its Applications)

Abstract

This work develops and analyzes an iterative method to solve the combined generalized equilibrium and fixed point problems involving two relatively nonexpansive mappings. We establish that the generated sequence converges strongly to a shared solution within a two-uniformly convex and uniformly smooth real Banach space. We also highlight some immediate consequences of the main result. To confirm the algorithm’s efficiency, a numerical example is provided. Furthermore, the practical utility of the proposed algorithm is illustrated using comprehensive tables and figures.

1. Introduction

Let X be a real Banach space, and let X * denote its dual space. The duality pairing between these spaces is represented by · , · . Suppose a nonempty, closed, and convex subset D X . A mapping J : X 2 X * with J ( d ) = { t X * : t , d = d 2 = t 2 } , d X , is known as a normalized duality mapping. It is fundamental in studying the geometric and functional characteristics of Banach spaces.
Let T : D D be a mapping. Let Fix ( T ) denote the set of fixed points of T, i.e., Fix ( T ) = { t D : T t = t } . Fixed point theory, a fundamental area of nonlinear analysis, has been extensively applied to the study of nonlinear phenomena. Over the past five decades, numerous notable fixed point existence theorems have been established (see, for example, [1,2,3,4]).
However, from a practical perspective, it is not sufficient to merely establish the existence of fixed points for nonlinear mappings; it is equally important to develop iterative methods to approximate these fixed points. The computation of fixed points plays a crucial role in solving many real-world problems, including inverse problems. For instance, both the split feasibility problem and the convex feasibility problem, which arise in signal processing and image reconstruction, can be reformulated as problems of finding fixed points of specific operators (see [5,6] and references therein for further details). Fixed point theory is a cornerstone of mathematics, with applications in solving equations, optimization, and modeling in pure and applied sciences. The study of fixed points in the moduli spaces of vector bundles over algebraic curves is fundamental in understanding the geometry of these spaces; see [7]. It is foundational to fields like topology (Brouwer’s theorem), analysis (Banach’s contraction principle), and mathematical physics (e.g., Hitchin integrable systems and mirror symmetry). Fixed points also play a vital role in economics and game theory, such as in Nash equilibria; see [8,9,10,11].
In our study, we consider the combination of generalized equilibrium problems (CGEPs), which extends EPs (3) as a particular instance. Let H i : D × D R , i = 1 , 2 , , N , and real numbers a i ( 0 , 1 ) satisfy i = 1 N a i = 1 . Consider i = 1 N a i H i : D × D R . Then, the CGEP is to find t D such that
i = 1 N a i H i ( t , q ) + b ( t , q ) b ( t , t ) 0 , q D ,
where b : D × D R fulfills the assumptions defined below:
Assumption 1. 
(i)
Skew-symmetric, i.e., b ( t , t ) b ( t , q ) b ( q , t ) + b ( q , q ) 0 for all t , q D .
(ii)
Convex with respect to its second argument.
(iii)
Continuous.
Assume Ω = Sol ( CGEP ( 1 ) ) as a solution set of CGEP (1). Assume that b 0 ; then, the CGEP (1) simplifies to the combination of equilibrium problems (CEP), where we seek t D such that
i = 1 N a i H i ( t , q ) 0 , q D ,
which was studied by Suwannaut et al. [12]. For further studies on the combination of equilibrium problems, see [13,14,15].
Inspired by minimax problems arising in economic equilibrium theory, the concept of equilibrium problems was first introduced by Zuhovickii et al. [16], Fan [17], and Brezis et al. [18]. Blum and Oettli [19] later adopted this notion and formulated the abstract equilibrium problem (commonly referred to as the EP), which is a special case of the CEP (2). For i = 1 and b = 0 , the CGEP simplifies to the equilibrium problem (EP), where we seek t D such that
H ( t , q ) 0 , q D .
  In 2009, Marino et al. [20] analyzed the convergence properties of a Krasnoselski–Mann-type iterative scheme designed to identify a common element of Fix ( T ) and the solution set of EP (3). They established that EP (3) serves as a unifying framework encompassing various well-known mathematical problems, such as optimization, variational inequality, Nash equilibrium, complementarity, and fixed point problems. Its solution is represented as Ω 1 = Sol ( EP ( 3 ) ) (see [19,21,22]).
  If we define H ( t , q ) = q t , A t for all t , q D , where A : D X , then we find t D such that
q t , A t 0 , q D ,
which is known as a variational inequality problem (VIP) [23]. Its solution is represented as Sol ( VIP ( 4 ) ) .
  In a Hilbert space X , Korpelevich [24] proposed an extragradient method to solve VIP (4) as
d 0 D X , v n = P D ( d n λ A d n ) , d n + 1 = P D ( d n λ A v n ) .
Under suitable assumptions, he studied the convergence analysis.
A hybrid extragradient method studied by Nadezkhina et al. [25] in Hilbert space X is defined as
d 0 D X , v n = P D ( d n r n A d n ) , q n = ξ n d n + ( 1 ξ n ) T P D ( d n r n A v n ) , D n = { z D : q n z 2 d n z 2 } , B n = { z D : d n z , x d n 0 } , d n + 1 = P D n B n d 0 .
They established that the sequence initiated by (6) converges strongly to a shared solution of VIP (4) and the FPP for the nonexpansive mapping T on D . Several extensions and modifications of this method have been explored in the literature (see [26,27,28,29,30] and the references therein).
A hybrid iterative algorithm studied by Matsushita et al. [31] utilizes generalized projection techniques within the broader setting of a Banach space. The iterative process is formulated as follows:
d 0 D , v n = J 1 ( ξ n d n + ( 1 ξ n ) d n ) , D n = { z D : ϕ ( z , v n ) ϕ ( z , d n ) } , B n = { z D : d n z , J d 0 J d n } d n + 1 = Π D n B n d 0 .
Takahashi et al. [32] established an iterative scheme to find a shared solution to the EP and FPP involving a relatively nonexpansive mapping T in a Banach space as
d 0 D , v n = J 1 ( ξ n J d n + ( 1 ξ n ) J T d n ) , ϱ n = T r n v n D such that H ( ϱ n , y ) + 1 r n y ϱ n , J ϱ n J v n 0 , y D , D n = { z D : ϕ ( z , ϱ n ) ϕ ( z , d n ) } , B n = { z D : d n z , J d 0 J d n 0 } , d n + 1 = Π D n B n d 0 ,
Under suitable assumptions, they studied the convergence analysis.
Building upon the contributions in [12,14,15,20,31,32], we establish a strong convergence theorem for determining a shared solution of CGEP (3) and the FPP associated with two relatively nonexpansive mappings in a uniformly smooth and uniformly convex Banach space. The approach and findings presented extend and unify various established methods in Banach spaces; see [12,14,15,20,31,32].

2. Preliminaries

Let the symbols → and ⇀ denote strong and weak convergence, respectively. The unit sphere of a Banach space X is given by S = { d X : d = 1 } . A Banach space X is said to be strictly convex if, for all distinct elements d , q S , the inequality d + q 2 < 1 holds for all d , q S with d q . It is called uniformly convex if for any ε ( 0 , 2 ] , there exists a δ > 0 such that for all d , q S ,
d q ε implies d + q 2 1 δ .
It is well known that every uniformly convex Banach space is both reflexive and strictly convex. A Banach space X is said to be smooth if the limit lim t 0 d + t q d t exists for all d , q S . Furthermore, if this limit is attained uniformly for all d , q S , then X is called uniformly smooth.
A Banach space X is said to satisfy the Kadec–Klee property if for any sequence { d n } X and any d X , the conditions { d n } d and | d n | | d | imply that | d n d | 0 as n . It is well established that every uniformly convex Banach space possesses the Kadec–Klee property.
Additionally, if X is smooth, the normalized duality mapping J is single-valued. If X is uniformly smooth, then J is uniformly norm-to-norm continuous on bounded subsets of X . Moreover, J is strictly monotone if and only if X is strictly convex. In the special case where X is a Hilbert space, the duality mapping reduces to the identity operator, i.e., J = I , where I is the identity mapping.
The Lyapunov function ϕ : X × X R is defined as
ϕ ( d , q ) = d 2 2 d , J q + q 2 , d , q X .
From the definition of ϕ , it follows that
( | d | | q | ) 2 ϕ ( d , q ) ( | d | + | q | ) 2 , d , q X .
Additionally, the function satisfies the inequality
ϕ ( d , J 1 ( λ J q + ( 1 λ ) J z ) ) λ ϕ ( d , q ) + ( 1 λ ) ϕ ( d , z ) , d , q X , λ [ 0 , 1 ] ,
and can also be expressed as
ϕ ( d , q ) = | d | | J d J q | + | q | | d q | , d , q X .
Remark 1. 
If  X is a reflexive, strictly convex, and smooth Banach space, then for any d , q X , ϕ ( d , q ) = 0 holds if and only if d = q .
Lemma 1 
([33]). Let X be a Banach space that is both smooth and uniformly convex. Consider two sequences { d n } and { q n } in X , where at least one of them is bounded. If lim n ϕ ( d n , q n ) = 0 , then it follows that lim n d n q n = 0 .
Remark 2. 
By applying (11), it follows that the converse of Lemma 1 also holds provided that both sequences { d n } and { q n } are bounded.
Lemma 2 
([34]). In a two-uniformly convex Banach space X , the following inequality holds for all d , q X :
d q 2 c J d J q ,
where c is a constant satisfying 0 < c 1 , which is referred to as the two-uniformly convex constant of X .
Definition 1. 
Let T : D D be a mapping. Then, we have the following:
(i)
Fix ( T ) represents the set of fixed points of T, i.e., Fix ( T ) = { d D : T d = d } ;
(ii)
A point p D is called an asymptotic fixed point of T if there exists a sequence { d n } D that converges weakly to p and satisfies lim n T d n d n = 0 . The set of all asymptotic fixed points of T is denoted by Fix ^ ( T ) .
(iii)
The mapping T is called relatively nonexpansive if
Fix ^ ( T ) = Fix ( T ) and ϕ ( p , T d ) ϕ ( p , d ) , d D , p Fix ( T ) .
(iv)
T is closed if for any sequence { d n } D such that { d n } d and { T d n } q , it follows that T d = q .
Lemma 3 
([31]). Let X be a reflexive, strictly convex, and smooth Banach space, and let D be a nonempty closed convex subset of X . Suppose T : D D is a relatively nonexpansive mapping. Then, the set Fix ( T ) of fixed points of T is a closed convex subset of D .
Lemma 4 
([35]). Let D be a nonempty closed convex subset of X , and let A be a monotone and hemicontinuous mapping from D into X * . Then, the set VIP ( D , A ) is closed and convex.
Lemma 5 
([36]). Let X be a uniformly convex Banach space, r > 0 be a positive number, and B r ( 0 ) denote the closed ball in X . For a given set { d 1 , d 2 , , d N } B r ( 0 ) and a set of positive numbers { λ 1 , λ 2 , , λ N } such that i = 1 N λ i = 1 , there exists a continuous, strictly increasing, and convex function g : [ 0 , 2 r ) [ 0 , ) with g ( 0 ) = 0 such that, for any i , j { 1 , 2 , 3 , , N } where i < j , the following inequality holds:
n = 1 N λ n d n 2 n = 1 N λ n d n 2 λ i λ j g ( d i d j ) .
In the following, we utilize the function V : X × X * R defined by
V ( d , d * ) = d 2 d , d * + d * 2 .
Note that V ( d , d * ) = ϕ ( d , J 1 d * ) . The following lemma is well known.
Lemma 6 
([37]). Let X be a smooth, strictly convex, and reflexive Banach space, with X * denoting its dual. Then, for all d X and all d * , q * X * , the following inequality holds:
V ( d , d * ) + 2 J 1 d * x , q * V ( d , d * + q * ) .
Lemma 7 
([33]). Let D be a nonempty closed convex subset of a real reflexive, strictly convex, and smooth Banach space X , and let d X . Then, there exists a unique element d 0 D such that
ϕ ( d 0 , d ) = inf q D ϕ ( q , d ) .
Recently, Alber [37] introduced the generalized projection operator Π D in a Banach space X , which serves as an analogue of the metric projection P D in a Hilbert space H.
Definition 2. 
A generalized projection Π D : X D is a mapping that assigns to any point d X the point d ¯ D that minimizes the functional ϕ ( d , q ) , i.e., Π D d = d ¯ , where d ¯ is the solution to the minimization problem ϕ ( d ¯ , d ) = inf q D ϕ ( q , d ) .
Lemma 8 
([37]). Let X be a reflexive, strictly convex, and smooth Banach space, and let D be a nonempty closed convex subset of X . Then, the following inequality holds:
ϕ ( d , Π D q ) + ϕ ( Π D q , q ) ϕ ( d , q ) , d D , q X .
Lemma 9 
([37]). Let X be a reflexive, strictly convex Banach space, and let D be a nonempty closed convex subset of X . For d X and z D , the following holds:
z = Π D d z q , J d J z 0 , q D .
Next, we present the following assumption for the bifunction H : D × D R .
Assumption 2. 
The bifunction H : D × D R satisfies the following conditions:
(i)
H ( d , d ) = 0 d D ;
(ii)
H is monotone, i.e., H ( d , q ) + H ( q , d ) 0 d D ;
(iii)
For each d , q , z D , we have
lim sup t 0 H ( t z + ( 1 t ) d , q ) H ( d , q ) ;
(iv)
For each d D , the mapping q H ( d , q ) is convex and lower semicontinuous.
Lemmas 10 and 11 can be derived from Lemma 2.7, Lemma 2.11, and Remark 2.12, as presented by S. Suwannaut and A. Kangtunyakarn [12].
Lemma 10 
([12]). For each i = 1 , 2 , , N , let H i : D × D × D R satisfy Assumption 2, and suppose that
i = 1 N Sol ( CGEP ( H i ) ) .
Then, the solution set of the combined problem satisfies
Sol ( CGEP ( i = 1 N a i H i ) ) = i = 1 N Sol ( CGEP ( H i ) ) ,
where the coefficients a i belong to the interval ( 0 , 1 ) for all i = 1 , 2 , , N , and they sum to 1, i.e., i = 1 N a i = 1 .
For a fixed r 0 , and for each i { 1 , 2 , , N } , we define the mapping T r H i : X D as follows:
T r H i ( d ) = { z D : H i ( z , q ) + 1 r q z , J z J d 0 , q D } , d X .
Lemma 11 
([12]). For each i { 1 , 2 , , N } , consider a function H i : D × D × D R that satisfies Assumption 2. Let the operator J r H i : X D be given as defined in (12). Then, the following properties hold:
(a)
The set T r H i ( d ) is nonempty for every d X .
(b)
The mapping T r H i is uniquely defined.
(c)
The operator J r H i is firmly nonexpansive, satisfying the inequality
T r d T r q , J T r d J T r q T r d T r q , J d J q .
(d)
The set of fixed points of T r H i coincides with the solution set of the CGEP ( H i ) , i.e.,
Fix ( T r H i ) = Sol ( CGEP ( H i ) ) .
(e)
The solution set Sol ( CGEP ( H i ) ) is both closed and convex.
Remark 3. 
It is straightforward to verify that i = 1 N a i H i satisfies Assumption 2. Additionally, we observe that Lemma 11 remains valid for H : = i = 1 N a i H i . Moreover, applying Lemmas 10 and 11, we obtain the following result:
Fix ( J r H ) = Sol ( GVLIP ( H ) ) = i = 1 N Sol ( GVLIP ( H i ) ) , a i ( 0 , 1 ) .

3. Main Result

Now, we introduce an iterative scheme, referred to as Algorithm 1, designed to address the combined problem of generalized equilibrium and fixed point formulations involving a pair of relatively nonexpansive mappings. Furthermore, it is shown that the sequence produced by this algorithm converges strongly to a shared solution in a real Banach space that is both two-uniformly convex and uniformly smooth.
Algorithm 1: Iterative algorithm for combined equilibrium problem
Initialization: Let d 0 = d D , and n = 0 .
Iterative Steps:
Step 1. Calculate:
d 0 D , D 0 : = D , g n = Π D J 1 ( J d n ζ n A d n ) , q n = J 1 ( σ n J S d n + ( 1 σ n ) J g n ) , v n = J 1 ( ( 1 ξ n ) J d n + ξ n J T q n ) , ϱ n = T r n v n , such that i = 1 N a i H i ( ϱ n , q ) + 1 r n q ϱ n , J ϱ n J v n + b ( q , ϱ n ) b ( ϱ n , ϱ n ) 0 , q D , D n = { z D : ϕ ( z , ϱ n ) ϕ ( z , d n ) } , B n = { z D : d n z , J d n J d 0 0 } , d n + 1 = Π D n B n d 0 ,
where { r n } [ a , ) , a > 0 . Assume that { ζ n } , { ξ n } , and { σ n } are positive real sequences satisfying:
(i)
{ ζ n } ( 0 , ) , 0 < lim inf n ζ n lim sup n ζ n < c 2 γ 2 , c be two-uniformly constant;
(ii)
{ σ n } ( 0 , 1 ) , and lim n σ n = σ [ c , d ] .
Step 2. For n : = n + 1 and return to Step 1.
Theorem 1. 
Let D be a closed convex subset of a Banach space X , that is, both two-uniformly convex and uniformly smooth, with X * denoting its dual space. Suppose that H i : D × D R , i { 1 , 2 , , N } , and b : D × D R to be maps meet Assumptions 2 and 1, respectively. Let A : D X * be a γ-ism, γ ( 0 , 1 ) , and let T , S : D D be two relatively nonexpansive mappings. Suppose Γ = Ω Fix ( T ) Fix ( S ) A 1 ( 0 ) . Then, the sequences { d n } and { ϱ n } initiated by the iterative scheme (1) converge strongly to an element t Π Γ d 0 .
Proof. 
The proof is structured into multiple steps.
  • Step 1. By applying Lemmas 3, 4, and 11, it follows that Γ is a closed convex set. Consequently, the projection Π Γ d 0 is well defined.
  • Step 2. We establish that D n B n is a closed and convex set. According to its concept, B n is clearly both closed and convex. For all n 0 , we verify that D n maintains these properties. Initially, D 0 = D is closed and convex. The closedness of D n follows naturally, so it remains to demonstrate its convexity. From the concept of D n ,
D n = { z D : ϕ ( z , ϱ n ) ϕ ( z , d n ) } = { z D : 2 z , J d n J ϱ n d n 2 ϱ n 2 } .
Utilizing (14), along with the continuity of J d n J ϱ n , D n is indeed closed and convex. Therefore, D n B n is closed and convex.
  • Step 3. We demonstrate that Γ is contained within D n B n for all n 0 . Suppose that for p Γ ,
ϕ ( p , ϱ n ) = ϕ ( p , T r n v n ) ϕ ( p , v n ) = ϕ ( p , J 1 ( ( 1 ξ n ) J d n + ξ n J T q n ) ) ( 1 ξ n ) ϕ ( p , d n ) + ξ n ϕ ( p , T q n ) ξ n ( 1 ξ n ) g ( J d n J T q n )
  ( 1 ξ n ) ϕ ( p , d n ) + ξ n ( ϕ ( p , q n ) ξ n ( 1 ξ n ) g ( J d n J T q n )
( 1 ξ n ) ϕ ( p , d n ) + ξ n ( ϕ ( p , q n ) .
Furthermore, applying Lemmas 2, 5, and 6, we obtain
ϕ ( p , g n ) = ϕ ( p , Π C J 1 ( J d n ζ n D d n ) ) ϕ ( p , J 1 ( J d n ζ n D d n ) ) = V ( p , J d n ζ n D d n ) V ( p , ( J d n ζ n D d n ) + ζ n D d n ) 2 J 1 ( J d n ζ n D d n ) p , ζ n D d n = V ( p , J d n ) 2 ζ n J 1 ( J d n ζ n D d n ) p , D d n = ϕ ( p , d n ) 2 d n p , D d n 2 ζ n J 1 ( J d n ζ n D d n ) d n , D d n = ϕ ( p , d n ) 2 d n p , D d n D p 2 ζ n J 1 ( J d n ζ n D d n ) d n , D d n ϕ ( p , d n ) 2 ζ n γ D d n 2 + 2 ζ n J 1 ( J d n D d n ) J 1 J d n D d n 2 ϕ ( p , d n ) 2 ζ n γ D d n 2 + 4 ζ n 2 c 2 D d n 2 = ϕ ( p , d n ) + 2 ζ n ( 2 ζ n c 2 γ ) D d n 2
which, together with the condition ζ n < c 2 γ 2 , yields that
ϕ ( p , g n ) ϕ ( p , d n ) .
Subsequently, applying (19), we derive the following estimate:
ϕ ( p , q n ) = ϕ ( p , J 1 ( σ n J S d n + ( 1 σ n ) J g n ) ) σ n ϕ ( p , S d n ) + ( 1 σ n ) ϕ ( p , g n ) σ n ( 1 σ n ) g ( J S d n J g n ) σ n ϕ ( p , d n ) + ( 1 σ n ) ϕ ( p , g n ) σ n ( 1 σ n ) g ( J S d n J g n )
ϕ ( p , d n ) σ n ( 1 σ n ) g ( J S d n J g n )
ϕ ( p , d n ) .
As a consequence of (17) and (22), we obtain
ϕ ( p , ϱ n ) ϕ ( p , d n )
This indicates that p D n , and hence, Γ D n . We now proceed by induction to show that Γ D n B n for all n 0 .
As B 0 = D , therefore Γ D 0 B 0 . For some k > 0 , consider Γ D k B k . Then, there exists d k + 1 D k B k such that d k + 1 = Π D k B k d 0 . By the concept of d k + 1 , we obtain, for z D k B k ,
d k + 1 z , J d 0 J d k + 1 0 .
As Γ D k B k , it follows that
d k + 1 p , J d 0 J d k + 1 0 , p Γ ,
implies that p B k + 1 . Therefore, Γ D k + 1 B k + 1 , as Γ D n for all n. Hence, Γ D n B n for all n 0 , and thus, d n + 1 = Π D n B n d 0 is well defined. Therefore, { d n } is well defined.
  • Step 4. Next, prove that { d n } , { g n } , { q n } , { v n } , and { ϱ n } are bounded. Additionally, we prove that lim n ϕ ( d n , d 0 ) exists, and lim n ϕ ( d n + 1 , d n ) = 0 .
By the definition of B n , d n = Π B n d 0 . Using this and applying Lemma 8, we obtain
ϕ ( d n , d 0 ) = ϕ ( Π B n d 0 , d 0 ) ϕ ( u , d 0 ) ϕ ( u , Π B n d 0 ) ϕ ( u , d 0 ) , u Γ B n .
This indicates that the sequence { ϕ ( d n , d 0 ) } is bounded, which implies, by (9), that { d n } is bounded.
Next, from Equations (15), (19), (22), and (23), we conclude that the sequences { g n } , { q n } , { ϱ n } , and { v n } are bounded. Therefore, the sequences { D d n } , { S d n } , and { T q n } are also bounded.
Since d n + 1 = Π D n B n d 0 B n and d n Π B n d 0 , we have
ϕ ( d n , d 0 ) ϕ ( d n + 1 , d 0 ) , n 0 ,
which yields that { ϕ ( d n , d 0 ) } is nondecreasing. As the sequence is bounded, therefore lim n ϕ ( d n , d 0 ) exists.
Using Lemma 8 and m > n ,
ϕ ( d m , d n ) = ϕ ( d m , Π B n d 0 ) ϕ ( d m , d 0 ) ϕ ( Π B n d 0 , d 0 ) = ϕ ( d m , d 0 ) ϕ ( d n , d 0 ) 0 , as m , n .
Thus, by Lemma 1, d m d n 0 as m , n . This shows that { d n } is a Cauchy sequence in D . As D is a nonempty closed subset of X , it is complete. Hence, ∃ t D , with
lim n d n = t .
Furthermore, from (25), we obtain
ϕ ( d n + 1 , d n ) ϕ ( d n + 1 , d 0 ) ϕ ( d n , d 0 ) ,
which implies that
lim n ϕ ( d n + 1 , d n ) = 0 .
By Lemma 1, we obtain
lim n d n + 1 d n = 0 .
  • Step 5. We now demonstrate that as n , the sequences { d n } t , { q n } t , { v n } t , and { ϱ n } t , where t is a point in D .
Since d n + 1 = Π D n B n d 0 D n , we can write the following inequality:
ϕ ( d n + 1 , ϱ n ) ϕ ( d n + 1 , d n ) .
From (27), we obtain
ϕ ( d n + 1 , ϱ n ) = 0 ,
and therefore, applying Lemma 1, we have
lim n d n + 1 ϱ n = 0 .
Next,
d n ϱ n d n d n + 1 + d n + 1 ϱ n .
From (27), (29), and (30),
lim n d n ϱ n = 0 ,
which implies that
lim n ϱ n = t .
On a bounded subset of X , J is norm-to-norm uniformly continuous; therefore,
lim n J d n J ϱ n = 0 .
By (16) and (21), we obtain
ξ n ( 1 ξ n ) g ( J d n J T q n ) ϕ ( p , ϱ n ) ϕ ( p , d n ) d n ϱ n ( d n + ϱ n ) + 2 p J d n J ϱ n ,
which yields that from (31), (33), and (34),
lim n g ( J d n J T q n ) = 0 .
Using the property of g and J, we obtain
lim n J d n J T q n = 0 .
Similarly, from (17) and (21), we obtain
σ n ( 1 σ n ) g ( J S d n J g n ) ϕ ( p , d n ) ϕ ( p , ϱ n ) d n ϱ n ( d n + ϱ n ) + 2 p J d n J ϱ n ,
Applying (31), (33), (37), and condition (ii),
lim n g ( J S d n J g n ) = 0 .
Again, applying the property of g and J,
lim n S d n g n = 0 .
From (17), (18), and (20), we deduce that
ϕ ( p , ϱ n ) ( 1 ξ n ) ϕ ( p , d n ) + ξ n ϕ ( p , q n ) ( 1 ξ n ) ϕ ( p , d n ) + ξ n [ σ n ϕ ( p , d n ) + ( 1 σ n ) ϕ ( p , g n ) ] ( 1 ξ n ) ϕ ( p , d n ) + ξ n σ n ϕ ( p , d n ) + ( 1 σ n ) ϕ ( p , d n ) + 2 ( 1 σ n ) ζ n 2 ζ n c 2 γ A d n 2 ,
which implies that
ξ n ( 1 σ n ) 2 ζ n γ 2 ζ n c 2 A d n 2 ϕ ( p , d n ) ϕ ( p , ϱ n ) d n ϱ n ( d n + ϱ n ) + 2 p J d n J ϱ n ,
Using (31), (33), and (40), we have the given conditions
lim n A d n = 0 .
Using the concept of A , (26), and (41), we immediately have t A 1 ( 0 ) .
Furthermore, combining (13) with (41), we obtain
lim n g n t = lim n Π D J 1 ( J d n ζ n A d n ) Π D t lim n J 1 ( J d n ζ n A d n ) t = 0
From (13), we have
J q n J g n = σ n J S d n J g n ,
which, from (33) and (38), implies that
lim n J q n J g n = 0 .
This leads to
lim n q n g n = 0 .
By Lemmas 6 and 3,
ϕ ( d n , g n ) = ϕ ( d n , Π D J 1 ( J d n ζ n A d n ) ) ϕ ( d n , J 1 ( J d n ζ n A d n ) ) V ( d n , ( J d n ζ n A d n ) ) V ( d n , ( J d n ζ n A d n ) + ζ n A d n ) 2 J 1 ( J d n ζ n A d n ) d n , ζ n A d n = ϕ ( d n , d n ) + 2 J 1 ( J d n ζ n A d n ) d n , ζ n A d n = 2 ζ n J 1 ( J d n ζ n A d n ) d n , A d n J 1 ( J d n ζ n A d n ) J 1 J d n 4 c 2 ζ n 2 A d n 2 ,
Thus, from (41), we conclude that
lim n ϕ ( d n , g n ) = 0 ,
and with Lemma 1, it yields that
lim n d n g n = 0 .
Since
T q n q n q n g n + g n d n + d n T q n ,
this implies with (36), (45), (48), and (49) that
lim n T q n q n = 0 ,
which implies that t Fix ( T ) .
Moreover, since
T d n d n S d n g n + g n d n ,
which implies with (39), (48), and (51) that
lim n S d n d n = 0 ,
this implies that t Fix ( S ) . Therefore, t Fix ( T ) Fix ( S ) .
  • Step 6. We now demonstrate that t Γ . It remains to be shown that t also belongs to Sol ( CGEP ( i = 1 N a i H i ) ) .
Therefore, let p Γ D n , and by (16),
ϕ ( p , v n ) ϕ ( p , J 1 ( ( 1 ξ n ) J d n + ξ n J T q n ) ) ϕ ( p , d n ) .
Applying Lemma 11 and ϱ n = T r n v n , we have
ϕ ( ϱ n , v n ) = ϕ ( T r n v n , v n ) ϕ ( p , v n ) ϕ ( p , T r n v n ) ϕ ( p , d n ) ϕ ( p , ϱ n ) . d n ϱ n ( d n + ϱ n ) + 2 p J d n J ϱ n
By (31), (33), and (54)
lim n ϕ ( ϱ n , v n ) = 0 .
Therefore, by Lemma 1,
lim n ϱ n v n = 0 .
Using the property of J,
lim n J ϱ n J v n = 0 .
Given r n a and (55), therefore
lim n J ϱ n J v n r n = 0 .
Let ϱ n = T r n H v n , where H = i = 1 N a i H i ; then, we have
i = 1 N a i H i ( ϱ n , q ) + 1 r n q ϱ n , J ϱ n J v n + b ( q , ϱ n ) b ( ϱ n , ϱ n ) 0 , q D .
Utilizing Assumption 2(ii), we obtain
1 r n q ϱ n , J ϱ n J v n b ( q , ϱ n ) + b ( ϱ n , ϱ n ) i = 1 N a i H i ( ϱ n , q ) i = 1 N a i H i ( q , ϱ n ) b ( q , ϱ n ) + b ( ϱ n , ϱ n ) .
Taking the limit as n , by (56) and the lower semicontinuity of q i = 1 N a i H i ( q , · ) , we obtain
i = 1 N a i H i ( q , t ) b ( y , t ) + b ( t , t ) 0 , q D .
Let q κ : = κ q + ( 1 κ ) t for all κ ( 0 , 1 ] and q D . Then, it follows that q κ D , and hence, we have
i = 1 N a i H i ( q κ , t ) b ( q κ , t ) + b ( t , t ) 0 .
Therefore, by Assumption 2(i)–(iv), we deduce
0 = i = 1 N a i H i ( q κ , q κ ) κ i = 1 N a i H i ( q κ , q ) + ( 1 κ ) i = 1 N a i H i ( q κ , t ) κ i = 1 N a i H i ( q κ , q ) + ( 1 κ ) [ b ( q κ , t ) b ( t , t ) ] t i = 1 N a i H i ( q κ , q ) + κ ( 1 κ ) [ b ( q , t ) b ( t , t ) ]
Since κ > 0 , we obtain
i = 1 N a i H i ( q κ , q ) + ( 1 κ ) [ b ( q , t ) b ( t , t ) ] 0 , q D .
Letting κ 0 + , we obtain from Assumption 2(iii) that
i = 1 N a i H i ( t , q ) + b ( q , t ) b ( t , t ) 0 , q D .
Thus, t Sol ( CGEP ( i = 1 N a i H i ) ) . Therefore, t Sol ( CGEP ( i = 1 N a i H i ) ) = i = 1 N Sol ( CGEP ( H i ) ) . Hence, t Γ = Ω Fix ( T ) Fix ( S ) A 1 ( 0 ) .
  • Step 7. Finally, we demonstrate that t = Π Γ d 0 . Let k in (24), and we have
t p , J d 0 J t 0 , p Γ .
Now, by Lemma 9, it follows that t = Π Γ d 0 . □
We now present a consequence of Algorithm 1 by formulating a second iterative Algorithm 2, which focuses specifically on the equilibrium problem.
Algorithm 2: Iterative algorithm for equilibrium problem
Initialization: Choose { ξ n } , { β n } ( 0 , 1 ) . Let d 0 = d D and n = 0 .
Iterative Steps:
Step 1. Calculate
d 0 D , D 0 : = D , g n = Π D J 1 ( J d n ζ n A d n ) , q n = J 1 ( σ n J S d n + ( 1 σ n ) J g n ) , v n = J 1 ( ( 1 ξ n ) J d n + ξ n J T q n ) , ϱ n = T r n v n , such that H ( ϱ n , q ) + 1 r n q ϱ n , J ϱ n J v n + b ( q , ϱ n ) b ( ϱ n , ϱ n ) 0 , q D , D n = { z D : ϕ ( z , ϱ n ) ϕ ( z , d n ) } , B n = { z D : d n z , J d n J d 0 0 } , d n + 1 = Π D n B n d 0 ,
where { r n } [ a , ) , a > 0 . Assume that { ζ n } , { ξ n } , and { σ n } are satisfying the below:
(i)
{ ζ n } ( 0 , ) , 0 < lim inf n ζ n lim sup n ζ n < c 2 γ 2 , where c is the two-uniformly constant;
(ii)
{ σ n } ( 0 , 1 ) , lim n σ n = σ [ c , d ] .
Step 2. Let n : = n + 1 and return Step 1.
We establish a strong convergence result for determining the common solution of the CGEP as presented in (1). To do so, we focus on the specific case where N = 1 .
Corollary 1. 
Let D be closed convex subset of a Banach space X , that is, both two-uniformly convex and uniformly smooth, with X * denoting its dual space. Suppose that H : D × D R and b : D × D R are maps that meet Assumptions 2 and 1, respectively. Let A : D X * be a γ-ism, γ ( 0 , 1 ) , and let T , S : D D be two relatively nonexpansive mappings. Suppose that Γ 1 : = Ω Fix ( T ) Fix ( S ) A 1 ( 0 ) . Then, the sequences { d n } and { ϱ n } initiated by the iterative scheme (2) converge strongly to an element t Π Γ 1 d 0 .

Numerical Example

We now provide examples to illustrate the main theorem.
Example 1. 
Let X = R and D = [ 0 , + ) . For i = 1 , 2 , 3 , , consider H i ( d , q ) = ( 1 + i ) d ( q d ) , d , q D and b ( d , q ) = d q , d , q D . It is straightforward to verify that the functions H i , for each i = 1 , 2 , 3 , , satisfy Assumption 2, and b : D × D R satisfies Assumption 1. Let A d = 2 d , d D and T d = S d = 1 3 d , d D . These mappings can also be easily checked to satisfy the requirements of Theorem 1. The execution of the algorithms involves specific parameter settings. Let r n = 1 , a i = 1 3 , for each i = 1 , 2 , 3 . Under these configurations, the sequence produced by Algorithm 1 converges to { 0 } Γ .
The computations and graphical visualizations for this algorithm were carried out using MATLAB R2015a. The stopping criterion was set as d n + 1 d n < 10 10 . Various initial points d 0 were tested, and the results are summarized in Table 1 and Table 2, where we also compare our findings with those in [31,32]. Additionally, the convergence behavior is illustrated in Figure 1 and Figure 2. We observe that by taking distinct initial points, we found our result more quickly than others.
Example 2. 
Let X = l 2 , where l 2 consists of square-summable infinite sequences of real numbers. Define D = { q l 2 : q 3 } . For i = 1 , 2 , 3 , , consider H i ( d , q ) = ( 1 + i ) ( 4 q + 5 d ) ( q d ) , d , q D and b ( d , q ) = d ( 5 q 4 d ) , d , q D , where d = { d 1 , d 2 , , d n , } , q = { q 1 , q 2 , , q n , } . The norm and inner product on l 2 are defined by d = ( j = 1 | d j | 2 ) 1 2 , d , q = j = 1 d j q j . It is straightforward to verify that the functions H i , for each i = 1 , 2 , 3 , , satisfy Assumption 2, and b : D × D R satisfies Assumption 1. Let A d = 10 d , d D and T d = S d = 1 100 d , d D . These mappings can also be easily checked to satisfy the requirements of Theorem 1. The execution of the algorithms involves specific parameter settings. Let r n = 1 , a i = 1 3 , for each i = 1 , 2 , 3 . Under these configurations, the sequence produced by Algorithm 1 converges to { 0 } Γ .
The computations and graphical visualizations for this algorithm were carried out using MATLAB R2015a. The stopping criterion was set to d n + 1 d n < 10 10 . Several initial points d 0 were tested, and the convergence behavior is illustrated in Figure 3 and Figure 4.
Application in optimization problem: We explore the application of our algorithms to optimization problems. Let G : D R be a mapping. Define H i ( d , q ) = G q G d , d , q D . The objective is to determine v D such that
G v G v * , v * D .
Assume that Ω is the solution set of (59) and Ω . It is straightforward to verify that Assumption 2 holds. Consequently, we have Γ = Ω .

4. Conclusions

In this work, we establish an iterative method to solve the combined generalized equilibrium and fixed point problems involving two relatively nonexpansive mappings. We prove that the generated sequence converges strongly to a shared solution within a two-uniformly convex and uniformly smooth real Banach space. We also highlight some immediate consequences of the main result. To confirm the algorithm’s efficiency, a numerical example is provided. Furthermore, the practical utility of the proposed algorithm is illustrated using comprehensive tables and figures. The practical applicability of the method is further demonstrated through two detailed tables and four illustrative figures, which provide comparisons with existing approaches and an in-depth analysis of convergence behavior. These findings emphasize the effectiveness and computational advantages of our approach. Moreover, this study generalizes and integrates several well-known results from the literature, providing a unified framework for solving various problems in optimization and computational mathematics. Theorem 3.1 presents an enhancement over the findings of [25,31,32] in the following ways:
(i)
In [25], a strong convergence theorem was established for nonexpansive mapping in a real Hilbert spaces. In contrast, our theorem extends this result to a broader context by proving convergence in two uniformly convex and uniformly smooth real Banach space and for two relatively nonexpansive mappings.
(ii)
Iterative Algorithm 1 is a generalization of the method introduced in Theorem 1 of [31,32], offering a more comprehensive approach to solving fixed point problems in the specified Banach spaces.

5. Future Direction

(i)
Our work is useful from a theoretical and applied perspective, as the result of this paper enables the further development of fixed point theory and its application by using the concept of a specific notion of Galois bundles, as has been introduced to describe fixed points [7].
(ii)
A direction for future research is also to extend the method proposed in this paper to an extragradient iterative approach for the considered problems, assuming that A is monotone, within the framework of a uniformly smooth and strictly convex Banach space X , which generalizes the setting of a uniformly smooth and uniformly convex Banach space.

Author Contributions

Methodology, G.A.; Software, M.F.; Writing—original draft, G.A. and R.A.; Writing—review & editing, R.A. and M.F. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project Number (PNURSP2025R45), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The authors declare that they have no competing interests.

References

  1. Browder, F.E. Nonexpansive nonlinear operators in a Banach space. Proc. Natl. Acad. Sci. USA 1965, 54, 1041–1044. [Google Scholar] [CrossRef] [PubMed]
  2. Goebel, K.; Kirk, W.A. A fixed point theorem for asymptotically nonexpansive mappings. Proc. Am. Math. Soc. 1972, 35, 171–174. [Google Scholar] [CrossRef]
  3. Kirk, W.A. A fixed point theorem for mappings which do not increase distances. Am. Math. Mon. 1965, 72, 1004–1006. [Google Scholar] [CrossRef]
  4. Kirk, W.A. Fixed point theorems for non-Lipschitzian mappings of asymptotically non-expansive type. Isr. J. Math. 1974, 17, 339–346. [Google Scholar] [CrossRef]
  5. Byrne, C. A unified treatment for some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 2004, 20, 103–120. [Google Scholar] [CrossRef]
  6. Vanderlugt, A. Optical Signal Processing; John Wiley and Sons: New York, NY, USA, 1992. [Google Scholar]
  7. Sancho, A.A. Fixed points of automorphisms of the vector bundle moduli space over a compact Riemann surface. Mediterr. J. Math. 2024, 21, 20. [Google Scholar] [CrossRef]
  8. Banach, S. Sur les Operations dans les Ensembles Abstraits et Leur Application aux Equations Integrales. Fundam. Math. 1992, 3, 133–181. [Google Scholar] [CrossRef]
  9. Hitchin, N. Stable bundles and integrable systems. Duke Math. J. 1987, 54, 91–114. [Google Scholar] [CrossRef]
  10. Nash, J. Equilibrium points in n-person games. Proc. Natl. Acad. Sci. USA 1950, 36, 48–49. [Google Scholar] [CrossRef]
  11. Younis, M.; Chen, L.; Singh, D. Recent Developments in Fixed Point Theory: Theoretical Foundations and Real-World Applications; Springer: Singapore, 2024. [Google Scholar] [CrossRef]
  12. Suwannaut, S.; Kangtunyakarn, A. The Combination of the set of solutions of equilibrium problem for convergence theorem of the set of fixed points of strictly pseudo-contractive mappings and variational inequalities problem. Fixed Point Theory Appl. 2013, 2013, 291. [Google Scholar] [CrossRef]
  13. Bnouhachem, A. A hybrid iterative method for a combination of equilibria problem, a combination of variational inequality problems and a hierarchical fixed point problem. Fixed Point Theory Appl. 2014, 2014, 163. [Google Scholar] [CrossRef]
  14. Kazmi, K.R.; Ali, R.; Rizvi, S.H. Common solution of a combination of split general variational-like inequality problems and a family of generalized asymptotically nonexpansive mappings. J. Adv. Math. Stud. 2017, 10, 200–215. [Google Scholar]
  15. Khan, S.A.; Kazmi, K.R.; Cholamjiak, W.; Dutta, H. Convergence analysis for combination of equilibrium problem k-nonspreading set-valued mappings. Proyecciones J. Math. 2020, 39, 599–619. [Google Scholar] [CrossRef]
  16. Zuhovickii, S.I.; Poljak, R.A.; Primak, M.E. Two methods of search for equilibrium points of n-person concave games. Sov. Math. Dokl. 1969, 10, 279–282. [Google Scholar]
  17. Fan, K. Minimax Inequalities and Applications. In Inequality III; Shisha, O., Ed.; Academic Press: New York, NY, USA, 1972; pp. 103–113. [Google Scholar]
  18. Brézis, H.; Nirenberg, L.; Stampacchia, G. A remark on Ky Fan’s minimax principle. Boll. Dell’Unione Mat. Ital. 1972, 6, 293–300. [Google Scholar]
  19. Blum, E.; Oettli, W. From optimization and variational inequalities to equilibrium problems. Math. Stud. 1994, 63, 123–145. [Google Scholar]
  20. Marino, G.; Colao, V.; Muglia, L.; Yao, Y. Krasnoselski-Mann iteration for hierarchical fixed-points and equilibrium problem. Bull. Aust. Math. Soc. 2009, 79, 187–200. [Google Scholar] [CrossRef]
  21. 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]
  22. Moudafi, A. Second order differential proximal methods for equilibrium problems. J. Inequalities Pure Appl. Math. 2003, 4, 18. [Google Scholar]
  23. Hartman, P.; Stampacchia, G. On some non-linear elliptic differential-functional equation. Acta Math. 1966, 115, 271–310. [Google Scholar] [CrossRef]
  24. Korpelevich, G.M. The extragradient method for finding saddle points and other problems. Matecon 1976, 12, 747–756. [Google Scholar]
  25. Nadezhkina, N.; Takahashi, W. Strong convergence theorem by a hybrid method for nonexpansive mappings and Lipschitz continuous monotone mapping. SIAM J. Optim. 2006, 16, 1230–1241. [Google Scholar] [CrossRef]
  26. Ceng, L.C.; Hadjisavvas, N.; Wong, N.C. Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point problems. J. Glob. Optim. 2010, 46, 635–646. [Google Scholar] [CrossRef]
  27. Ceng, L.C.; Guu, S.M.; Yao, J.C. Finding common solution of variational inequality, a general system of variational inequalities and fixed point problem via a hybrid extragradient method. Fixed Point Theory Appl. 2011, 2011, 1–22. [Google Scholar] [CrossRef]
  28. Ceng, L.C.; Wang, C.Y.; Yao, J.C. Strong convergence theorems by a relaxed extragradient method for a general system of variational inequalities. Math. Methods Oper. Res. 2008, 67, 375–390. [Google Scholar] [CrossRef]
  29. Farid, M.; Ali, R.; Cholamjiak, W. An inertial iterative algorithm to find common solution of a split generalized equilibrium and a variational inequality problem in Hilbert spaces. J. Math. 2021, 2021, 3653807. [Google Scholar] [CrossRef]
  30. Rouhani, B.D.; Kazmi, K.R.; Farid, M. Common solutions to some systems of variational inequalities and fixed point problems. Fixed Point Theory 2017, 18, 167–190. [Google Scholar] [CrossRef]
  31. Matsushita, S.; Takahashi, W. Weak and strong convergence theorems for relatively nonexpansive mappings in Banach spaces. Fixed Point Theory Appl. 2004, 2004, 37–47. [Google Scholar] [CrossRef]
  32. Takahashi, W.; Zembayashi, K. Strong and weak convergence theorem for equilibrium problems and relatively nonexpansive mmapings in Banach spaces. Nonlinear Anal. 2009, 70, 45–57. [Google Scholar] [CrossRef]
  33. 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]
  34. Xu, H.K. Inequalities in Banach spaces with applications. Nonlinear Anal. 1991, 16, 1127–1138. [Google Scholar] [CrossRef]
  35. 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]
  36. Zhang, S. Generalized mixed equilibrium problem in Banach spaces. Appl. Math. Mech. 2009, 30, 1105–1112. [Google Scholar] [CrossRef]
  37. Alber, Y.I. Metric and generalized projection operators in Banach spaces: Properties and applications. In Theory and Applications of Nonlinear Operators of Accretive and Monotone Type; Dekker: New York, NY, USA, 1996; pp. 15–50. [Google Scholar]
Figure 1. Convergence of { d n } at d 0 = 0.7 [31,32].
Figure 1. Convergence of { d n } at d 0 = 0.7 [31,32].
Axioms 14 00428 g001
Figure 2. Convergence of { d n } at d 0 = 0.001 [31,32].
Figure 2. Convergence of { d n } at d 0 = 0.001 [31,32].
Axioms 14 00428 g002
Figure 3. Convergence of { d n } at initial point d 0 = { 0.01 , 0.01 , , 0.01 , } [31,32].
Figure 3. Convergence of { d n } at initial point d 0 = { 0.01 , 0.01 , , 0.01 , } [31,32].
Axioms 14 00428 g003
Figure 4. Convergence of { d n } at initial point d 0 = { 0.6 , 0.6 , , 0.6 , } [31,32].
Figure 4. Convergence of { d n } at initial point d 0 = { 0.6 , 0.6 , , 0.6 , } [31,32].
Axioms 14 00428 g004
Table 1. Comparison of our main results for initial point d 0 = 0.7 .
Table 1. Comparison of our main results for initial point d 0 = 0.7 .
No. of IterationsMain TheoremTakahashi et al. [32]Matsushita [31]
cpu Time (in seconds) cpu Time (in seconds) cpu Time (in seconds)
10.2250820.3033330.606667
20.0753190.1415560.566222
30.0255350.0676320.541057
40.0087130.0326890.523022
50.0029840.0159090.509074
60.0010250.0077780.497762
70.0003530.0038150.488280
80.0001210.0018760.480142
90.0000420.0009240.473029
100.0000140.0004560.466722
110.0000050.0002250.461065
120.0000020.0001110.455942
130.0000010.0000550.451266
140.0000000.0000270.446968
150.0000000.0000140.442995
Table 2. Comparison of our main results for initial point d 0 = 0.001 .
Table 2. Comparison of our main results for initial point d 0 = 0.001 .
No. of IterationsMain TheoremTakahashi et al. [32]Matsushita [31]
cpu Time (in seconds) cpu Time (in seconds) cpu Time (in seconds)
10.0003220.0004330.000867
20.0001080.0002020.000809
30.0000360.0000970.000773
40.0000120.0000470.000747
50.0000040.0000230.000727
60.0000010.0000110.000711
70.0000010.0000050.000698
80.0000000.0000030.000686
90.0000000.0000010.000676
100.0000000.0000010.000667
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

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. https://doi.org/10.3390/axioms14060428

AMA Style

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(6):428. https://doi.org/10.3390/axioms14060428

Chicago/Turabian Style

AlNemer, Ghada, Rehan Ali, and Mohammad Farid. 2025. "On the Strong Convergence of Combined Generalized Equilibrium and Fixed Point Problems in a Banach Space" Axioms 14, no. 6: 428. https://doi.org/10.3390/axioms14060428

APA Style

AlNemer, G., Ali, R., & Farid, M. (2025). On the Strong Convergence of Combined Generalized Equilibrium and Fixed Point Problems in a Banach Space. Axioms, 14(6), 428. https://doi.org/10.3390/axioms14060428

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