Next Article in Journal
On the Breaking of the U(1) Peccei–Quinn Symmetry and Its Implications for Neutrino and Dark Matter Physics
Previous Article in Journal
Pseudo-Finsler Radially Symmetric Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Modified Tseng Method for Solving Pseudomonotone Variational Inequality Problem in Banach Spaces

1
Department of Mathematics and Applied Mathematics, Sefako Makgatho Health Sciences University, Medunsa, P.O. Box 94, Pretoria 0204, South Africa
2
Department of Mathematics, Faculty of Science and Engineering, University of Eswatini, Private Bag 4, Kwaluseni M201, Eswatini
3
Department of Mathematics and Statistics, Institute of Southern Punjab, Multan 60800, Pakistan
*
Author to whom correspondence should be addressed.
Symmetry 2024, 16(3), 363; https://doi.org/10.3390/sym16030363
Submission received: 4 September 2023 / Revised: 21 October 2023 / Accepted: 3 November 2023 / Published: 18 March 2024
(This article belongs to the Section Mathematics)

Abstract

:
This article examines the process for solving the fixed-point problem of Bregman strongly nonexpansive mapping as well as the variational inequality problem of the pseudomonotone operator. Within the context of p-uniformly convex real Banach spaces that are also uniformly smooth, we introduce a modified Halpern iterative technique combined with an inertial approach and Tseng methods for finding a common solution of the fixed-point problem of Bregman strongly nonexpansive mapping and the pseudomonotone variational inequality problem. Using our iterative approach, we develop a strong convergence result for approximating the solution of the aforementioned problems. We also discuss some consequences of our major finding. The results presented in this paper complement and build upon many relevant discoveries in the literature.

1. Introduction

Let E be a real Banach space with its dual E * . Let C be a nonempty closed convex subset of E and · , · denote the duality pairing between E and E * . The variational inequality problem (VIP) with respect to A is a problem of finding u C such that
A u , v u 0 , v C ,
in which the operator A maps C to E * . We write V I ( C , A ) to represent the set of (1) solutions. Variational inequality theory, independently developed in the mechanics and potential theory by Stampacchia and Fichera in the early 1960s (see [1,2]), can be used broadly to treat a wide class of unrelated linear and nonlinear problems in elasticity, economics, transportation, optimization, control theory, and engineering sciences. The development of variational inequality theory can be understood as the simultaneous pursuit of two different fields of research. Basic facts on the qualitative behavior of solutions to important kinds of issues are disclosed in the first aspect. However, it also makes it possible for us to develop highly efficient and powerful numerical techniques to deal with boundary value problems, including unilateral, moving, free, and obstacle problems (see [3]). It is commonly known that V I ( C , A ) is equivalent to the fixed-point problem:
find u * C such that u * = P C ( u * τ A u * ) ,
where a metric projection onto C is denoted by P C and τ is any positive real number. Solving V I ( C , A ) has been approached in a variety of ways recently (see [4,5,6,7,8,9,10,11,12,13]). The gradient projection method (GPM) is the most basic projection method. The general concept of expanding the GPM to solve the F ( u ) minimization issue pertaining to u C is provided by
u n + 1 = P C ( u n α n F ( u n ) ) , n 0 ,
where the gradient function is F ( u n ) and the positive real sequence { α n } satisfies a given condition. The GPM is a direct expansion of the procedure in (2). It involves replacing operator F with the gradient function in order to produce a sequence { u n } in the way that follows:
u n + 1 = P C ( u n α n F u n ) , n 0 .
Nevertheless, this method’s convergence necessitates a somewhat strong assumption that the operators are either strongly monotone or inversely monotonous. To loosen this constraint, the extragradient method (EM) for a monotone and L-Lipschitz continuous mapping A was suggested by Korpelvich [14] and Antipin [15] in finite-dimensional Euclidean spaces.
u 0 C , τ > 0 , v n = P C ( u n τ A u n ) , u n + 1 = P C ( u n τ A v n ) , n 1 ,
where τ ( 0 , 1 L ) . The sequence u n produced by the EM (3) converges to an element of V I ( C , A ) if V I ( C , A ) is not empty. Note that each iteration in the EM requires the computation of two projections into the feasible set C . Should the set C not be simple, implementing the EM becomes exceedingly complex and costly. Additionally, we stress that the stepsize defined by the process is excessively small and lowers the technique’s convergence rate. Moreover, the method (3) requires a prior estimate of the Lipschitz constant, which is frequently difficult to estimate. To the best of our knowledge, these shortcomings can be addressed in certain ways. The first is the subgradient extragradient method (SEGM) [9], which was proposed by Censor et al. In this approach, a projection onto a certain constructible half-space is used in place of the second projection onto C . Their approach takes this form:
v n = P C ( u n τ A u n ) , T n = { w H : u n τ A u n v n , w v n 0 } , u n + 1 = P T n ( u n τ A v n ) , n 0 ,
where τ ( 0 , 1 L ) .
The second approach is Tseng’s method from [16]. Their approach takes this form:
v n = P C ( u n τ A u n ) , u n + 1 = v n λ ( A v n A u n ) , n 0 ,
where τ ( 0 , 1 L ) .
It is important to mention that the SEGM and TM algorithms explained earlier merely require the computation of a single projection onto C in each iteration, which has the potential to enhance the performance of these algorithms. Numerous researchers have made enhancements to the SEGM and TM through various approaches (refer to [4,7,9,16,17,18] and the related references). We want to emphasize that both methods (SEGM and TM) have been extensively studied by authors in the context of real Hilbert and Banach spaces. One of the most effective strategies to accelerate the rate of convergence for iterative algorithms is to incorporate the inertial term into the iterative scheme. This term, denoted by θ n ( u n u n 1 ) , serves as a remarkable tool for enhancing the performance of the algorithm and is known for its favorable convergence properties. Consequently, there is a growing interest among researchers working in this field (see [4,19,20,21,22,23]). The concept of the inertial extrapolation method was initially introduced by Polyak [24] and was inspired by an implicit discretization of a second-order-in-time dissipative dynamical system, commonly referred to as the “heavy ball with friction”.
( t ) + γ ( t ) + g ( ( t ) ) = 0 ,
when g : R n R and γ > 0 are differentiable. The discretization of the system (6) allows for the determination of the following term using u n + 1 :
u n + 1 2 u n + u n 1 j 2 + γ u n u n 1 j + g ( u n ) = 0 , n 1 ,
where the step-size is denoted by j. The following iterative algorithm is produced by Equation (7):
u n + 1 = u n + β ( u n u n 1 ) α g ( u n ) , n 1 ,
where the inertial approach β ( u n u n 1 ) and β = 1 γ j , α = j 2 are used to accelerate the convergence of the sequence produced by (8). Using the proximal point algorithm (PPA), also known as the inertial PPA, Alvarez and Attouch used the inertial extrapolation method to set a general maximal monotone operator.
v n = u n + θ n ( u n u n 1 ) , u n + 1 = ( I + r n B ) 1 v n , n > 1 .
Their demonstration showed that if { r n } is non-decreasing and { θ n } [ 0 , 1 ) , then
n = 1 θ n | | u n u n 1 | | 2 < ,
Afterward, a weak convergence of Algorithm (9) to a zero of B is achieved. For θ n < 1 3 , more specifically, condition (10) holds true. An initial factor is denoted by θ n .
The inertial extrapolation approach in Banach space has been updated by a number of writers by leaving out the calculation of the difference between the norms of the two neighboring iterates, u n and u n 1 . Because of the geometry of the space, the inertial term must be modified when approximating solutions of various optimization problems using the inertial extrapolation method in Banach space using either the viscosity or Halpern method (see [7,20,25] and the references therein). The hybrid and shrinking procedures used in the Banach space setting is the only scenario in which the inertial terms remain unchanged (see [4,22,23]). As far as we are aware, there is not a result for the inertial extrapolation method in Banach space without utilizing the Halpern method modification.
Question 1: Without computing the difference between the norms of the two adjacent iterates, u n and u n 1 , can we introduce an inertial Halpern method combined with the Tseng procedure for approximating the outcome of VIP in the context of p-uniformly convex real Banach spaces that are also uniformly smooth?
We propose a modified Halpern inertial iterative method, inspired by the work of [15,16,17,18] and others, combined with a Tseng-type technique to find a common solution of the pseudomonotone variational inequality problem and the fixed-point problem of Bregman strongly nonexpansive mapping in the context of uniformly smooth, p-uniformly real Banach space. We provide a strong convergence result for approximating the solution of the aforementioned problems using our iterative method. We stress that our iterative approach does not require any prior knowledge about the operator standard because of its architecture. To demonstrate the effectiveness of our solution, we provide a few numerical examples. Numerous relevant results in the literature are extended and enhanced by the results reported in this work.

2. Preliminaries

We state some known and useful results which will be needed in the proof of our main theorem. In the sequel, we denote strong and weak convergence by “→” and “⇀”, respectively.
Given a Banach space E , let its dual be E * . It is argued that an operator A : E E * is p L -Lipschitz if for all u , v E ,
| | A u A v | | L | | u v | | p ,
where two constants are L 0 and p [ 1 , + ) . The operator A is called L-Lipschitz if p = 1 .
Suppose there is a nonempty set C E . Next, let A : C E * be a mapping. Then, for every u , v C , A is
(a)
monotone on C if A u A v , u v 0 ;
(b)
pseudomonotone on C if A u , v u 0 A v , v u 0 ;
(c)
Lipschitz continuous on C if there is a number L > 0 such that | | A u A v | | L | | u v | | ;
(d)
weakly sequentially continuous if A u n A u is implied for all { u n } E such that u n u .
Given a real Banach space E and a function g : E R , the function g is defined as follows:
(i)
Gâteaux differentiable at u E , denoted by g ( u ) or g ( u ) , if there exists an element v of E such that
lim t 0 g ( u + t v ) g ( u ) t = v , g ( u ) , v E ,
where g is Gâteaux differentiable on E if g is Gâteaux differentiable at each u E ;
(ii)
weakly lower semicontinuous at u E if u r u implies g ( u ) lim inf r g ( u r ) . g is weakly lower semicontinuous on E if g is weakly lower semicontinuous at each u E .
Denote the unit sphere of E as K ( E ) : = { u E : u = 1 } . The function δ E : ( 0 , 2 ] [ 0 , 1 ] indicates the modulus of convexity described by
δ E ( ϵ ) = inf 1 u + v 2 : u , v K ( E ) , u v ϵ .
If, for every ϵ ( 0 , 2 ] , δ E ( ϵ ) > 0 , then E is considered uniformly convex. When p > 1 , E is said to have a modulus of convexity of power type p, meaning that it is p-uniformly convex. If c p > 0 , for any ϵ ( 0 , 2 ] , δ E ( ϵ ) c p ϵ p . Keep in mind that any spaces that are p-uniformly convex are uniformly convex. For E , the function ρ E : R + : = [ 0 , ) R + is the modulus of smoothness. It is defined by
ρ E ( τ ) = sup u + τ v + u τ v 2 1 : u , v K ( E ) .
Uniform smoothness of the space E is defined as ρ E ( τ ) τ 0 as τ 0 . Assume q > 1 . If, for every τ > 0 , there exists κ q > 0 such that ρ E ( τ ) κ q τ q , then a Banach space E is q-uniformly smooth. According to [26], E is p-uniformly convex if and only if E * is q-uniformly smooth, where p and q satisfy 1 p + 1 q = 1 .
Considering a real number p > 1 , the generalized duality mapping J p E : E 2 E * can be defined as follows:   
J p E ( u ) = { u ¯ E * : u , u ¯ = u p , u ¯ = u p 1 } ,
where . , . represents the duality pairing between E and E * elements. Specifically, the normalized duality mapping is denoted by J 2 E if p = 2 . Assuming that E is uniformly smooth and p-uniformly convex, E * is both uniformly smooth and q-uniformly convex. Here, J p E is a one-to-one, single-valued generalized duality mapping that satisfies the generalized duality mapping of E * is J q E * , and J p E = ( J q E * ) 1 . Moreover, the duality mapping J p E is norm-to-norm uniformly continuous on bounded subsets of E if E is uniformly smooth (see [27] for more information).
The Frenchel conjugate of g, denoted by g * : E * ( , + ] , is defined as follows if g : E ( , + ] is a proper, lower semicontinuous, and convex function:
g * ( u * ) = sup { u * , u g ( u ) : u E , u * E * } .
To represent the domain of g, wewrite d o m g = { u E : g ( x ) < + } . Since v E and u i n t ( d o m g ) , we may define and express the right-hand derivative of g at u in the direction of v as follows:
g 0 ( u , v ) = lim t 0 + g ( u + t v ) g ( u ) t .
Definition 1
([28]). Given a convex function g : E ( , + ] , let g be Gâteaux differentiable. Δ g : E × E [ 0 , + ) is a function defined by
Δ g ( u , v ) : = g ( v ) g ( u ) g ( u ) , v u ,
known as the Bregman distance with respect to g, where g ( u ) , v = g 0 ( u , v ) .
It is commonly known that because Δ g does not satisfy the symmetric and triangular inequality properties, and the Bregman distance Δ g does not satisfy the properties of a metric. Furthermore, it is commonly known that, for p > 1 , the sub-differential of the functional g p ( . ) = 1 p | | . | | p is the duality mapping J p E (see [29]). It is possible to demonstrate that the three-point identity, or the following equality, is satisfied by using (11):
Δ p ( u , v ) + Δ p ( v , w ) Δ p ( u , w ) = J E p ( w ) J E p ( v ) , u v , for all u , v , w E .
Δ p ( u , v ) = Δ p ( v , u ) + v u , J E p v J E p u , u , v E .
Moreover, if g ( u ) = 1 p | | u | | p , where 1 p + 1 q = 1 , we obtain
Δ g ( u , v ) = Δ p ( u , v ) = 1 p y p 1 p u p v u , J E p ( u ) = 1 p v p + 1 q u p v , J E p ( u ) .
Suppose there is a nonlinear mapping T : C C . Then, we have the following: Please check that intended meaning has been retained.
(i)
An asymptotic fixed point of T is defined as p C if C contains a sequence { u n } that converges weakly to p, with the result that lim n T u n u n = 0 . By F ^ ( T ) , we represent the set of T asymptotic fixed points;
(ii)
It is stated that T is Bregman relatively nonexpansive if
F ^ ( T ) = F ( T ) and Δ p ( x , T u ) Δ p ( x , u ) , u C , x F ( T ) ;
(iii)
Bregman relatively nonexpansive T is stated to exist if for all u , v C ,
J E p ( T u ) J E p ( T v ) , T u T v J E p ( u ) J E p ( v ) , T u T v ;
(iv)
When F ^ ( T ) , then T is a Bregman strongly nonexpansive mapping (BSNE) if, for all v F ^ ( T ) ,
Δ p ( v , T u ) Δ p ( v , u ) ,
and for every bounded sequence { u n } n 1 C ,
lim n ( Δ p ( v , u n ) Δ p ( v , T u n ) ) = 0
implies
lim n Δ p ( T u n , u n ) = 0 .
Assume that C is a closed, nonempty, convex subset of E . The projection metric P C : E C is defined as
P C u : = a r g min v E | | u v | | , u E ,
the one and only minimizer of the norm distance, which has the following variational inequality:
J E p ( u P C u ) , w P C u 0 , w C .
Additionally, the Bregman projection represented by Π C from E onto C satisfies the following property:
Δ p ( x , Π C ( u ) ) = inf v C Δ p ( u , v ) , for all u E .
Assume that u E and C are nonempty, closed, convex subsets of a p-uniformly convex and uniformly smooth Banach space E . Then, the following claims are true [26]:
  w = Π C u if and only if
J E p ( u ) J E p ( w ) , v w 0 , y C ;
Δ p ( Π C u , v ) + Δ p ( u , Π C u ) Δ p ( u , v ) , v C .
We now present a few findings that support our main result.
Lemma 1
([29]). Consider a Banach space E with u , v E . There exists C q > 0 such that, if E is q-uniformly smooth,
u v q u q q J E q ( u ) , v + C q v q .
Let u, v, and w be in E . With 1 p + 1 q = 1 , we therefore have
Δ p ( u , v ) = Δ p ( u , z ) + Δ p ( z , v ) + u z , J E p ( z ) J E p ( v ) ,
Δ p ( u , v ) = Δ p ( v , u ) + v u , J E p ( v ) J E p ( u ) ,
and
Δ p ( u , v ) = u p p + v q p u , J E p v .
Lemma 2
([30]). Consider a p-uniformly convex Banach space, E . For any u , v E , the relationship between the metric and the Bregman distance is as follows:
π p u v p Δ p ( u , v ) u v , J E p ( u ) J E p ( v ) .
For any q > 1 , if 1 p + 1 q = 1 , we have Young’s inequality, where π p > 0 is a fixed number.
J E p ( u ) , v | | J E p ( u ) | | | | v | | 1 q | | J E p ( u ) | | q + 1 p | | v | | p = 1 q | | u | | p + 1 p | | v | | p .
Lemma 3
([31]). Consider a real p-uniformly smooth and convex Banach space, E . Let us define V p : E * × E [ 0 , + ) as
V p ( u * , u ) = 1 q u * q u * , u + 1 p u p , u E , u * E * .
The following claims hold:
(i) 
In the first variable, V p is nonnegative and convex.
(ii) 
Δ p ( J q E * ( u * ) , u ) = V p ( u * , u ) , u E , u * E * .
(iii) 
V p ( u * , u ) + v * , J q E * ( u * ) u V p ( u * + v * , u ) , u E , u * , v * E * .
Lemma 4
([26]). Let E be a real p-uniformly convex and uniformly smooth Banach space. Suppose that { u n } and { v n } are bounded sequences in E . Then   lim n Δ p ( u n , v n ) = 0 implies   lim n | | u n v n | | = 0 .
Lemma 5
([32]). Assume that E is a real reflexive Banach space and that C is a nonempty, closed, convex subset of E . We also define A as a continuous pseudomonotone mapping from C into E * . In such a case, V I ( C , A ) is convex and closed. Moreover, for any u C , u * V I ( C , A ) if and only if A u , u u * 0 .
Lemma 6
([33]). Define { t n } as a nonnegative real number and { α n } as a real number sequence in ( 0 , 1 ) with the following condition: n = 1 α n = , and { f n } as a real number sequence. Suppose that
t n + 1 ( 1 α n ) t n + α n f n , n 1 .
If, for each subsequence { t n k } of { t n } satisfying the condition, lim sup k f n k 0
lim inf k ( t n k + 1 t n k ) 0 ,
then lim n t n = 0 .

3. Main Result

Assumption 1.
(L1) 
A nonempty, closed, and convex subset of E is C . E is a p-uniformly convex real Banach space that is also uniformly smooth. Afterward, the definition of C is as below:
C : = i = 1 m C i ,
where C i : = { v E : g i ( v ) 0 } .
(L2) 
On E , F : C E * is pseudomonotone and L-Lipschitz continuous.
(L3) 
Given any { a n } E , a n a * implies F a n F a * . This indicates that F is weakly sequentially continuous.
(L4) 
In 0 , p π p 2 p 1 , { μ n } is a positive sequence. π p is defined in (22), and  μ n = ( ϱ n ) , where ϱ n is a sequence in ( 0 , 1 ) such that lim n ϱ n = 0 . Both n = 1 ϱ n = and ϱ n + η n + σ n = 1 is the relationship between { η n } and { σ n } sequences in ( 0 , 1 ) . ϱ n ( a , b ) ( 0 , 1 ) , and σ n ( c , d ) ( 0 , 1 ) since n = 1 δ n < + for all n 1 , and { δ n } are nonnegative real numbers sequences.
(L5) 
We indicate T : E E , a Bregman strongly nonexpansive mapping, by Ψ : = S O l ( F , C ) F ( T ) , where Ω .
In this section, we present Algorithm 1 for finding a common solution to the pseudomonotone variational inequality problem and the fixed-point problem of Bregman strongly nonexpansive mapping by combining the Tseng and Halpern-type methods with inertial extrapolation:
Algorithm 1: Inertial Tseng-type method for pseudomonotone VIP.
Initialization: Assume the following: θ ( 0 , π p ) , 0 < ε < 1 , and u , a 0 , a 1 E , λ 0 > 0 . Create the family of half spaces for i = 1 , 2 , , m using the current iteration u n .
C n i : = { v E : g i ( u n ) + g i ( u n ) , v u n 0 } ,
and set
C n : = i = 1 m C n i .

Iterative Steps: Calculate a n + 1 as follows:
Step 1.
Assuming that n 1 and θ > 0 for each iterate a n 1 and a n , determine θ n such that 0 θ n θ ¯ n .
θ ¯ n = min { θ , μ n J E p ( a n ) J E p ( a n 1 ) } , i f a n a n 1 , θ , o t h e r w i s e .
Step 2.
Compute
u n = J E * q [ J E p ( a n ) + θ n ( J E p ( a n ) J E p ( a n 1 ) ) ] , z n = Π C n ( J E * q [ J E p ( u n ) λ n F ( u n ) ] ) .
λ n + 1 = min { λ n + δ n , ε z n u n F ( z n ) F ( u n ) } , i f F ( z n ) F ( u n ) , λ n + δ n , o t h e r w i s e .
When z n = u n for a given n 1 , the problem VIP has been addressed. If not, proceed to step 3.
Step 3.
Compute
w n = J E * q [ J E p ( z n ) λ n ( F ( z n ) F ( u n ) ) ] , a n + 1 = J E * q ( ϱ n J E p ( u ) + η n J E p ( w n ) + σ n J E p ( T w n ) ) ,
Stopping Criterion: For any n 1 , if a n + 1 = u n = z n and w n = T w n , then end the process. Alternatively, assign n : = n + 1 and go back to Step 1.
Remark 1.
Note that z n is a VIP solution if (1) stops in a finite step of iterations. Therefore, we assume for the remainder of our demonstration that (1) generates an infinite sequence and continues without stopping in any finite number of iterations.
Remark 2.
Suppose δ n = 0 , then the stepsize in (1) is like the ones in [4,34,35]. Additionally, the stepsize used in (1) increases from iteration to iteration, reducing the reliance on the starting step size l a m b d a 0 . As δ n is a summable sequence, lim n δ n = 0 . For big n, the stepsize λ n may not be growing.
Remark 3.
Unlike the inertial methods used in [4,19,20,22], the inertial method used in this article does not impose any tight conditions on θ n . Furthermore, we stress that the inertial approach in (1) is original, as defined by Polyak [24], and is neither relaxed nor modified. To the best of our knowledge, no one has used a Halpern approach to accomplish this in the framework of p-uniformly convex real Banach space that is also uniformly smooth.
Remark 4.
Based on the description of C and C n , the fact that C C n is apparent. Specifically, the subdifferential inequality yields, for each i = 1 , 2 , , m and v C ,
g i ( u n ) + g i ( u n ) , v u n g i ( v ) 0 .
The notion of C n implies that v C n . We may then conclude that C C n for all n 1 since C i C n i for all i.
Lemma 7.
If we assume that { λ n } is the sequence defined in (26), then lim n λ n = λ as well as λ min { ε L , λ 0 } , λ 0 + δ . In this case, δ = n = 0 δ n .
Proof. 
For any bounded subset of E with constant L > 0 , F is Lipschitz-continuous. Consequently, in the case of F z n F u n 0 , we obtain
ε z n u n F z n F u n ε z n u n L z n u n = ε L .
The sequence { λ n } has an upper bound of λ 0 + δ and a lower bound of min { ε L , λ 0 } since λ n + 1 is defined and mathematical induction is used. Similar to Lemma 3.1 in [35], the remainder of the argument is presented. □
Lemma 8.
Assume that (L1) through (L5) are true. Then, the sequences produced by (1), { a n } , { u n } , { z n } , and { w n } , are bounded.
Proof. 
If a * Ψ , then (1) implies that
Δ p ( a * , w n ) = Δ p ( a * , J E * q [ J E p ( z n ) λ n ( F ( z n ) F ( u n ) ) ] ) = 1 p a * p a * , J E p ( z n ) λ n ( F ( z n ) F ( u n ) ) + 1 q J E p ( z n ) λ n ( F ( z n ) F ( u n ) ) q .
On applying Lemma 1, we obtain
J E p ( z n ) λ n ( F ( z n ) F ( u n ) ) q J E p ( z n ) q q λ n z n , F ( z n ) F ( u n ) + C q λ n q F ( z n ) F ( u n ) q .
By substituting (29) into (28), we obtain
Δ p ( a * , w n ) = 1 p a * p a * , J E p ( z n ) λ n ( F ( z n ) F ( u n ) ) + 1 q z n q λ n z n , F ( z n ) F ( u n ) + C q λ n q q F ( z n ) F ( u n ) q = Δ p ( a * , z n ) + λ n a * z n , F ( z n ) F ( u n ) + C q λ n q q F ( z n ) F ( u n ) q .
By applying (12), we obtain
Δ p ( a * , w n ) = Δ p ( a * , u n ) + Δ p ( u n , z n ) + a * u n , J E p u n J E p z n + λ n a * z n , F ( z n ) F ( u n ) + C q λ n q q F ( z n ) F ( u n ) q .
Thus, we obtain from (13) that
Δ p ( a * , w n ) = Δ p ( a * , u n ) Δ p ( z n , u n ) + a * u n , J E p u n J E p z n + z n u n , J E p z n J E p u n + λ n a * z n , F ( z n ) F ( u n ) + C q λ n q q F ( z n ) F ( u n ) q = Δ p ( a * , u n ) Δ p ( z n , u n ) + a * z n , J E p u n J E p z n + λ n a * z n , F ( z n ) F ( u n ) + C q λ n q q F ( z n ) F ( u n ) q .
As a result of (17) and the definition of z n , it can be concluded that
a * z n , J E p u n λ n F ( u n ) J E p z n 0 ,
which implies that
a * z n , J E p u n J E p z n λ n a * z n , F ( u n ) .
We obtain (31) after substituting the previous inequality.
Δ p ( a * , w n ) Δ p ( a * , u n ) Δ p ( z n , u n ) + λ n a * z n , F ( u n ) + λ n a * z n , F ( z n ) F ( u n ) + C q λ n q q F ( z n ) F ( u n ) q = Δ p ( a * , u n ) Δ p ( z n , u n ) + λ n a * z n , F ( z n ) + C q λ n q q F ( z n ) F ( u n ) q .
Given that a * V I P ( C , F ) , F ( a * ) , z n a * 0 ; F ’s pseudomonotonicity property implies that F ( a * ) , z n a * 0 . Therefore, (32) generates
Δ p ( a * , w n ) Δ p ( a * , u n ) Δ ( z n , u n ) + C q λ n q q F ( z n ) F ( u n ) q .
By applying (26), we have
Δ p ( a * , w n ) Δ p ( a * , u n ) Δ p ( z n , u n ) + λ n q C q ε q q λ n + 1 q z n u n q .
Using Lemma 2, we obtain
Δ p ( a * , w n ) Δ p ( a * , u n ) Δ p ( z n , u n ) + λ n q C q ε q q λ n + 1 q z n u n q Δ p ( a * , u n ) 1 λ n q C q ε q q λ n + 1 q Δ p ( z n , u n ) .
Given that lim n 1 λ n q C q ε q q λ n + 1 q = 1 μ q > 0 , there is a N 0 n N such that 1 λ n q C q ε q q λ n + 1 q > 0 . As a result, we obtain from (33) that
Δ p ( a * , w n ) Δ p ( a * , u n ) .
From (12), then
Δ p ( a * , u n ) = Δ p ( a * , a n ) Δ p ( u n , a n ) + a * u n , J E p u n J E p a n .
Since we have u n = J E * q ( J E p a n + θ n ( J E p a n J E p a n 1 ) ) , it follows from (22), (23), and (1) that
u n a * , J E p u n J E p a n u n a * J E p u n J E p a n = θ n J E p a n J E p a n 1 u n a * θ n J E p a n J E p a n 1 [ 1 p u n a * p + 1 q ] θ n p J E p a n J E p a n 1 2 p 1 ( a n u n p + a n a * p ) + θ n q J E p a n J E p a n 1 2 p 1 μ n p π p Δ p ( a n , u n ) + Δ p ( a n , a * ) + μ n q .
By combining (35) and (36), we can determine that
Δ p ( a * , u n ) ( 1 + 2 p 1 μ n p π p ) Δ p ( a * , a n ) ( 1 2 p 1 μ n p π p ) Δ p ( a n , u n ) + μ n q .
We can see from (32) and (37) that
Δ p ( a * , w n ) ( 1 + 2 p 1 μ n p π p ) Δ p ( a * , a n ) ( 1 2 p 1 μ n p π p ) Δ p ( a n , u n ) + μ n q ( 1 λ n q C q ε q q λ n + 1 q ) Δ p ( z n , u n ) .
Let ξ ( 0 , p π p 2 p 1 ) . Based on (L4), there exists n N such that, for any n N ,
μ n 2 p 1 p π p < ϱ n ξ .
Therefore, for some constant M = μ n q > 0 , we obtain from (38) that
Δ p ( a * , w n ) ( 1 + ϱ n ξ ) Δ p ( a * , a n ) ( 1 ϱ n ξ ) Δ p ( a n , u n ) + ϱ n M
( 1 λ n q C q ε q q λ n + 1 q ) Δ p ( z n , u n ) .
( 1 + ϱ n ξ ) Δ p ( a * , a n ) + ϱ n M .
Thus, using (1) and (39), we arrive at
Δ p ( a * , a n + 1 ) = Δ p ( a * , J E * q ( ϱ n J E p ( u ) + η n J E p ( w n ) + σ n J E p ( T w n ) ) ) ϱ n Δ p ( a * , u ) + η n Δ p ( a * , w n ) + σ n Δ p ( a * , T w n ) ϱ n Δ p ( a * , u ) + η n Δ p ( a * , w n ) + σ n Δ p ( a * , w n ) = ϱ n Δ p ( a * , u ) + ( 1 ϱ n ) Δ p ( a * , w n ) ϱ n Δ p ( a * , u ) + ( 1 ϱ n ) ( 1 + ϱ n ξ ) Δ p ( a * , a n ) + ϱ n M ϱ n Δ p ( a * , u ) + ( 1 ϱ n ( 1 ξ ) ) Δ p ( a * , a n ) + ϱ n M = ( 1 ϱ n ( 1 ξ ) ) Δ p ( a * , a n ) + ϱ n ( 1 ξ ) Δ p ( a * , u ) + M 1 ξ max Δ p ( a * , a n ) , Δ p ( a * , u ) + M 1 ξ max Δ p ( a * , a N ) , Δ p ( a * , u ) + M 1 ξ .
By induction, we obtain
Δ p ( a * , a n ) max { Δ p ( a * , a N ) , Δ p ( a * , u ) + M 1 ξ } , n N .
As a result, { Δ p ( a * , a n ) } has a limit. Δ p ( a * , u n ) , Δ p ( a * , z n ) , and Δ p ( a * , w n ) are therefore restricted by C . We conclude that { a n } , { u n } , { z n } , and { w n } are bounded in light of Lemma 4. □
Lemma 9.
Assume that Algorithm 1 produces the sequence { u n k j } , whose subsequence { u n k j } converges weakly to y E , and that Assumption A1 holds. Therefore, y V I ( C , F ) if lim n u n k j z n k j = 0 .
Proof. 
Using (17) and the concept of { z n k } , we obtain
J E p u n k λ n k F ( u n k ) J E p z n k , v z n k 0 v C n k
or, equivalently,
J E p u n k J E p z n k , v z n k λ n k F ( u n k ) , v z n k v C n k .
Therefore, we obtain
1 λ n k J E p u n k J E p z n k , v z n k + F ( u n k ) , z n k u n k F ( u n k ) , v u n k , v C n k .
Using the facts that lim n u n k z n k = 0 and J E p is norm-to-norm uniformly continuous on bounded subsets of E and fixing v C n k , permitting k , we obtain that
J E p u n k J E p z n k 0 , k .
By considering the limit in (41) as k , we obtain
lim inf k F ( u n k ) , v u n k 0 , v C n k .
Now, using the facts that u n k C n k and C C n k , we see that
lim inf k F ( u n k ) , v u n k 0 , v C .
Then, we demonstrate that v C . Moreover, z n k C n k implies that
g i ( u n k ) + g i ( u n k ) , z n k u n k 0 ,
and then
g i ( u n k ) g i ( u n k ) , u n k z n k g i ( u n k ) · u n k z n k .
It follows that { g i ( u n k ) } is bounded since g i is Lipschitz continuous and { u n k } is bounded. Consequently, for any i, there exists N i > 0 such that g i ( u n k ) N i . Thus, we obtain
g i ( u n k ) N · u n k z n k ,
where N = max 1 i m { N i } . Thus, using the weak continuity of g i , we obtain that
g i ( v ) lim inf k g i ( u n k ) lim k u n k z n k = 0 .
Therefore, v C .
Assuming that { φ k } of positive numbers is such that { φ k } is declining and φ k 0 as k , we indicate N n k is the lowest positive integer, such that, for each k 1 ,
F ( u n k ) , v u n k + φ k 0 k N n k .
Observe that { N n k } rises as { φ k } falls. Select a point in E , H N n k such that H n k , F ( u n k ) = 1. Consequently, (43) becomes
F ( u N n k ) , v + φ k H N n k u N n k 0 .
By utilizing the pseudomonotone nature of F , we obtain
F ( v + φ k H N n k ) , v + φ k H N n k u N n k 0 .
Therefore,
F ( v ) , v u N n k F ( v ) F ( v + φ k H N n k ) , v + φ k H N n k u N n k φ k F ( v ) , H N n k .
Following that, we demonstrate that lim k φ k N N k . Since { u N k } y E and F are weakly sequentially continuous on C , { F ( u N n k ) } F ( y ) follows. If y V I ( C , F ) , then F ( y ) 0 , else, given the progressively weakly lower semicontinuous nature of . , we obtain
F ( y ) lim inf k F ( u n k ) .
Since u N n k u n k , φ k 0 , and k , we have
0 lim sup k φ k H N n k = lim sup k φ k F ( u n k ) lim sup k φ k lim inf k F ( u n k ) = 0 ,
and lim k φ k H N k = 0 . Hence, it follows from (44) that
lim inf j F ( v ) , v u N n k 0 .
Thus, for all v C , we obtain that
F ( v ) , v y = lim k F ( v ) , v u N n k = lim inf k F ( v ) , v u N n k 0 .
Therefore, applying Lemma 5, we conclude that y V I ( C , F ) .
Theorem 1.
If { a n } is a sequence produced by (1), then { a n } converges strongly to x ¯ Ψ , where x ¯ = Π Ψ u .
Proof. 
Using Lemma 3 (iii), (1), and (39), we derive
Δ p ( a * , a n + 1 ) = Δ p ( a * , ϱ n J E p ( u ) + η n J E p ( w n ) + σ n J E p ( T w n ) ) = V p ( a * , ϱ n J E p ( u ) + η n J E p ( w n ) + σ n J E p ( T w n ) ) V p ( a * , ϱ n J E p ( u ) + η n J E p ( w n ) + σ n J E p ( T w n ) ) ϱ n ( J E p ( u ) J E p ( a * ) ) ϱ n ( J E p ( u ) J E p ( a * ) ) , J E * q ( ϱ n J E p ( a * ) + η n J E p ( w n ) + σ n J E p ( T w n ) ) a * = V p ( a * , ϱ n J E p ( a * ) + η n J E p ( w n ) + σ n J E p ( T w n ) ) + ϱ n J E p ( u ) J E p ( a * ) , a n + 1 a * = Δ p ( a * , ϱ n J E p ( a * ) + η n J E p ( w n ) + σ n J E p ( T w n ) ) + ϱ n J E p ( u ) J E p ( a * ) , a n + 1 a * ϱ n Δ p ( a * , a * ) + η n Δ p ( a * , w n ) + σ n Δ p ( a * , T w n ) + ϱ n J E p ( u ) J E p ( a * ) , a n + 1 a * ( 1 ϱ n ) Δ p ( a * , w n ) + ϱ n J E p ( u ) J E p ( a * ) , a n + 1 a * ( 1 ϱ n ( 1 ξ ) ) Δ p ( a * , a n ) + ϱ n ( 1 ξ ) ( ( 1 ξ ) 1 ( J E p ( u ) J E p ( a * ) , a n + 1 a * + μ n ϱ n ) ) .
Likewise, we can determine from (1) and (39) that
Δ p ( a * , a n + 1 ) ϱ n Δ p ( a * , u ) + ( 1 + ϱ n ξ ) Δ p ( a * , a n ) + ϱ n M ( 1 ϱ n ξ ) Δ p ( a n , u n ) ( 1 λ n q C q ε q q λ n + 1 q ) Δ p ( z n , u n ) .
Let us now assume that there exists a subsequence { Δ p ( a * , a n k ) } such that
lim inf k { Δ p ( a * , a n k + 1 ) Δ p ( a * , a n k ) } 0 .
Afterward, we obtain from (46) that
lim sup k { ( 1 ϱ n k ξ ) Δ p ( a n k , u n k ) + ( 1 λ n k q C q ε q q λ n k q ) Δ p ( z n k , u n k j ) } lim sup k ( 1 + ϱ n k ξ ) Δ p ( a * , a n k ) Δ p ( a * , a n k ) + ϱ n k Δ p ( a * , u ) + ϱ n k M lim sup k { Δ p ( a * , a n k ) Δ p ( a * , a n k + 1 ) } + lim sup k ϱ n k M . lim inf k Δ p ( a * , a n k + 1 ) Δ p ( a * , a n k ) 0 .
That is,
lim k Δ p ( z n k , u n k ) = 0 = lim k Δ p ( a n k , u n k ) .
With Lemma 4, we obtain
lim k z n k u n k = 0 = lim k a n k u n k .
It is clear that (48) yields
lim k z n k a n k = 0 .
More so, using (1) it follows that
J E p w n k J E p z n k = J E p z n k λ n k ( F ( z n k ) F ( u n k ) ) J E p z n k λ n k F ( z n k ) F ( u n k ) ε λ n k λ n k + 1 z n k u n k .
Thus, it follows from (48) that
lim k J E p w n k J E p z n k = 0 .
This uniform continuity from norm to norm of J E * q on bounded subsets of E * now gives
lim k w n k z n k = 0 .
Let b n : = J E * q η n 1 ϱ n J E p ( w n ) + σ n 1 ϱ n J E p ( T w n ) , then
Δ p ( a * , b n ) = Δ p ( a * , J E * q η n 1 ϱ n J E p ( w n ) + σ n 1 ϱ n J E p ( T w n ) ) η n 1 ϱ n Δ p ( a * , w n ) + σ n 1 ϱ n Δ p ( a * , T w n ) η n 1 ϱ n Δ p ( a * , w n ) + σ n 1 ϱ n Δ p ( a * , w n ) = η n + σ n 1 ϱ n Δ p ( a * , w n ) = Δ p ( a * , w n ) .
Hence,
0 Δ p ( a * , w n k ) Δ p ( a * , b n k ) = Δ p ( a * , w n k ) Δ p ( a * , a n k + 1 ) + Δ p ( a * , x n k + 1 ) Δ p ( a * , b n k ) ( 1 + ϱ n k ξ ) Δ p ( a * , a n k ) + ϱ n k M Δ p ( a * , a n k + 1 ) + ϱ n k Δ p ( a * , u ) ( 1 ϱ n k ) Δ p ( a * , b n k ) Δ p ( a * , b n k ) = Δ p ( a * , a n k ) Δ p ( a * , a n k + 1 ) + ϱ n k ( Δ p ( a * , u ) Δ p ( a * , b n k ) + M ) 0 as k .
More so,
Δ p ( a * , b n ) η n 1 ϱ n Δ p ( a * , w n ) + σ n 1 ϱ n Δ p ( a * , T w n ) = ( 1 σ n 1 ϱ n ) Δ p ( a * , w n ) + σ n 1 ϱ n Δ p ( a * , T w n ) Δ p ( a * , w n ) + σ n 1 ϱ n Δ p ( a * , T w n ) Δ p ( a * , w n )
Thus,
Δ p ( a * , w n k ) Δ p ( a * , T w n k ) < σ n k 1 ϱ n k Δ p ( a * , w n k ) Δ p ( a * , T w n k ) Δ p ( a * , w n k ) Δ p ( a * , b n k ) 0 , k .
Consequently, by applying the knowledge that T is BSNE, we derive that
Δ p ( w n k , T w n k ) = 0 ,
which implies from Lemma 4 that
lim k w n k T w n k = 0 .
From (49) and (51), we obtain
lim k w n k a n k = 0 .
Using (1) and (53), we obtain
Δ p ( w n k , a n k + 1 ) ϱ n k Δ p ( w n k , u ) + η n k Δ p ( w n k , w n k ) + σ n k Δ p ( w n k , T w n k ) 0 , n .
By applying Lemma 4, we obtain
lim k w n k a n k + 1 = 0 .
Hence, we conclude from (55) and (57) that
lim k a n k + 1 a n k = 0 .
Given that { a n k } is bounded, { a n k j } has a subsequence that converges weakly to a * . There exist subsequences { u n k j } of { u n k } and { z n k j } of { z n k } that converge weakly to a * , respectively, by applying (48) and (49). In light of this, a * F ( T ) = F ^ ( T ) can be obtained by applying (54). Additionally, a * V I ( C , F ) may be obtained by applying (48) and Lemma 9. Thus, we deduce that a * Ψ .
In the event that x ¯ = Π Ψ u , we have from (45) that
Δ p ( x ¯ , a n + 1 ) ( 1 ϱ n ( 1 ξ ) ) Δ p ( x ¯ , a n ) + ϱ n ( 1 ξ ) ( 1 ξ ) 1 J E p ( u ) J E p ( x ¯ ) , a n + 1 x ¯ + μ n ϱ n .
Since { a n k j } is a subsequence of { a n k } , then we have from (17) that
lim sup k J E p ( u ) J E p ( x ¯ ) , a n k x ¯ = lim j J E p ( u ) J E p ( x ¯ ) , a n k j x ¯ = J E p ( u ) J E p ( x ¯ ) , a * x ¯ 0 .
Hence, since (58) holds, then
lim sup j J E p ( u ) J E p ( x ¯ ) , a n k j + 1 x ¯ = lim j J E p ( u ) J E p ( x ¯ ) , a n k j x ¯ 0 .
Therefore, using Lemma 6 and (60) in (59), we obtain that Δ p ( x ¯ , a n ) 0 as n , and from Lemma 2, we know that π p a n x ¯ p Δ p ( x ¯ , a n ) 0 . Hence, { a n } x ¯ , where x ¯ = Π Ψ u . □

4. Numerical Example

In this section, we give some numerical illustrations of our main result in the sequel.
Example 1.
We consider the following fractional minimization problem, which was first given in [9].
min h ( x ) = x T B x + c T x + d b T x + e , s u b j e c t t o { x R 4 : b T x + e > 0 } ,
where
B = 5 1 2 0 1 5 1 3 2 1 3 0 0 3 0 5 , c = 1 2 2 1 , b = 2 1 1 0 , d = 2 and e = 4 .
As observed in [36], h is pseudoconvex on E since B is symmetric and positive definite. Therefore,
F ( x ) = h ( x ) = ( b T x + e ) ( 2 B x + c ) b ( x T B x + c T x + d ) ( b T x + e ) 2
is pseudomonotone. We also define T : R 4 R 4 by T = P C , where P C is the projection of E onto C : = { x R 4 : 1 x i 10 , i = 1 , , 4 } and g i ( x ) = x 2 for all i . For this example, we choose the sequence ϱ n = 1 10 n + 1 ,   η n = 1 2 n + 5 ,   σ n = 1 ϱ n η n , λ = 2.97 , θ = 0.5 , ϵ n = 1 n 1.02 , and δ = n 3 n + 1 . We make a comparison of our method with the method in [37], where the inertial method was altered. The result of this experiment with the stopping criterion chosen as E n = x n + 1 x n = 10 4 is reported below for different initial values if x 0 and x 1 .
Case 1: 
x 0 = [ 1 , 1 , 2 , 1 ] and x 1 = [ 1 , 3 , 1 , 0 ] ;
Case 2: 
x 0 = [ 2 , 1 , 2 , 3 ] and x 1 = [ 0 , 2 , 2 , 0 ] ;
Case 3: 
x 0 = [ 0 , 0 , 2 , 2 ] and x 1 = [ 1 , 1 , 2 , 2 ] ;
Case 4: 
x 0 = [ 3 , 1 , 2 , 3 ] and x 1 = [ 1 , 1 , 1 , 2 ] .
It can be seen from Figure 1 that our iterative method converges faster than the un-accelerated algorithm since the main advantage of introducing the inertial extrapolation method is to fasten the rate of convergence of our iterative method.

5. Conclusions

In this article, we propose a modified Halpern iterative method with combined inertial and Tseng techniques for finding a common solution to the fixed-point problem of Bregman strongly nonexpansive mapping and the pseudomonotone variational inequality problem in the settings of p-uniformly convex real Banach spaces that are uniformly smooth. To fasten the rate of convergence of our method, we introduce an inertial extrapolation method, as defined by Polyak, together with our proposed method. We present a numerical example to illustrate the performance of our proposed method. We will extend the result discussed in this article to the framework of a Hadamard manifold in our future research.

Author Contributions

Methodology, R.M.; Formal analysis, G.C.U., M.A. and A.R.K.; Investigation, H.A.A. All authors contributed equally to the writing of this paper. All authors read and approved the final manuscript.

Funding

This research received no external funding.

Data Availability Statement

The raw data supporting the conclusions of this article will be made available by the authors on request.

Acknowledgments

The authors are grateful to Department of Mathematics and Applied Mathematics, Sefako Makgato Health Science University South Africa, for supporting this research work.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

  1. Fichera, G. Problemi elasstostatici con vincoli unilaterali: II problema di signorini ambigue condizione al contorno. Atti Accad. Naz. Lincei. Mem. Cl. Sci. Nat. Sez. Ia 1963, 7, 91–140. [Google Scholar]
  2. Stampacchia, G. Formes bilinearieres coercitivities sur les ensembles convexes. C. R. Acad. Sci. Paris 1964, 258, 4413–4416. [Google Scholar]
  3. Pang, J.S. Asymmetric variational inequalities over product of sets: Applications and iterative methods. Math. Program 1985, 31, 206–219. [Google Scholar] [CrossRef]
  4. Abass, H.A.; Ugwunnadi, G.C.; Narain, O.K.; Darvish, V. Inertial extrapolation method for solving variational inequality and fixed point problems of a Bregman demigeneralized mapping in a reflexive Banach space. Numer. Funct. Anal. Optim. 2022, 43, 933–960. [Google Scholar] [CrossRef]
  5. Abuchu, J.A.; Ugwunnadi, G.C.; Narain, O.K. An inertial projection and contraction method for solving bilevel quasimonotone variational inequality problems. J. Anal. 2023, 31, 2915–2942. [Google Scholar] [CrossRef]
  6. 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. Inequal. Appl. 2020, 2020, 42. [Google Scholar] [CrossRef]
  7. Ali, B.; Ugwunnadi, G.C.; Lawan, M.S.; Khan, A.R. Modified inertial subgradient extragradient method in reflexive Banach spaces. Bol. Soc. Mat. Mex. 2021, 27, 1–26. [Google Scholar] [CrossRef]
  8. Censor, Y.; Gibali, A.; Reich, S. Algorithms for the split variational inequality problem. Numer. Algor. 2012, 59, 301–323. [Google Scholar] [CrossRef]
  9. Censor, Y.; Gibali, A.; Reich, S. The subgradient extragradient method for solving variational inequalities in Hilbert space. J. Optim. Theory Appl. 2011, 148, 318–335. [Google Scholar] [CrossRef]
  10. Cholamjiak, P.; Shehu, Y. Inertial forward-backward splitting method in Banach spaces with application to compressed sensing. Appl. Math. 2019, 64, 409–435. [Google Scholar] [CrossRef]
  11. Shehu, Y.; Vuong, P.T.; Cholamjiak, P. A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems. J. Fixed Point Theory Appl. 2019, 21, 1–24. [Google Scholar] [CrossRef]
  12. Suantai, S.; Cho, Y.J.; Cholamjiak, P. Halpern’s iteration for Bregman strongly nonexpansive mappings in reflexive Banach spaces. Comput. Math. Appl. 2012, 64, 489–499. [Google Scholar] [CrossRef]
  13. Suantai, S.; Pholasa, N.; Cholamjiak, P. The modified inertial relaxed CQ algorithm for solving the split feasibility problems. J. Ind. Manag. Optim. 2018, 14, 1595–1615. [Google Scholar] [CrossRef]
  14. Korpelevich, G.M. The extragradient method for finding saddle points and other problems. Matecon 1976, 12, 747–756. [Google Scholar]
  15. Antipin, A.S. On a method for convex programs using a symmetrical modification of Lagrange function. Ekonom. I Mate. Metod. 1976, 12, 1164–1173. [Google Scholar]
  16. Tseng, P. A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control. Optim. 2000, 38, 431–446. [Google Scholar] [CrossRef]
  17. Censor, Y.; Gibali, A.; Reich, S. Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space. Optim. Methods Softw. 2011, 26, 827–845. [Google Scholar] [CrossRef]
  18. Dong, Q.L.; Jiang, D.; Gibali, A. A modified subgradient extragradient method for solving the variational inequality problem. Numer. Algor. 2018, 9, 927–940. [Google Scholar] [CrossRef]
  19. Abass, H.A.; Izuchukwu, C.; Mewomo, O.T.; Dong, Q.L. Strong convergence of an inertial forward-backward splitting method for accretive operators in real Banach spaces. Fixed Point Theory 2020, 21, 397–412. [Google Scholar] [CrossRef]
  20. Abass, H.A.; Ugwunnadi, G.C.; Narain, O.K. A modified inertial Halpern method for solving split monotone variational inclusion problems in Banach spaces. Rend. Circ. Mat. Palermo II Ser. 2 2022, 72, 2287–2310. [Google Scholar] [CrossRef]
  21. Abass, H.A.; Aremu, K.O.; Jolaosom, L.O.; Mewomo, O.T. An inertial forward-backward splitting method for approximating solutions of certain optimization problem. J. Nonlinear Funct. Anal. 2020, 2020, 6. [Google Scholar]
  22. Chidume, C.E.; Ikechukwu, S.I.; Adamu, A. Inertial algorithm for approximating a common fixed point for a countable family of relatively nonexpansive maps. Fixed Point Theory Appl. 2018, 2018, 9. [Google Scholar] [CrossRef]
  23. Jia, H.; Liu, S.; Dang, Y. An inertial iterative algorithm with strong convergence for solving modified split feasibility problem in Banach spaces. J. Math. 2021, 2021, 9974351. [Google Scholar] [CrossRef]
  24. Polyak, B.T. Some methods of speeding up the convergence of iterates methods. USSR Comput. Math. Phys. 1964, 4, 1–17. [Google Scholar] [CrossRef]
  25. Taiwo, A.; Jolaoso, L.O.; Mewomo, O.T. A modified Halpern algorithm for approximating a common solution of split equality convex minimization problem and fixed point problem in Uniformly convex Banach spaces. Comput. Appl. Math. 2019, 38, 77. [Google Scholar] [CrossRef]
  26. Cholamjiak, P.; Sunthrayuth, P. A Halpern-type iteration for solving the split feasibility problem and fixed point problem of Bregman relatively nonexpansive semigroup in Banach spaces. Filomat 2018, 32, 3211–3227. [Google Scholar] [CrossRef]
  27. Cioranescu, I. Geometry of Banach Spaces, Duality Mappings and Nonlineqar Problems; Kluwer Academic: Dordrecht, The Netherlands, 1990. [Google Scholar]
  28. Bregman, L.M. The relaxation method for finding the common point of convex sets and its application to solution of problems in convex programming. USSR Comput. Math. Phys. 1967, 7, 200–217. [Google Scholar] [CrossRef]
  29. Chidume, C.E. Geometric Properties of Banach Spaces and Nonlinear Iterations; Lecture Notes in Mathematics; Springer: London, UK, 2009; ISBN 978-1-84882-189-7. [Google Scholar]
  30. 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]
  31. Shehu, Y.; Ogbuisi, F.U.; Iyiola, O.S. Convergence analysis of an iterative algorithm for fixed point problems and split feasibility problems in certain Banach spaces. Optimization 2016, 65, 299–323. [Google Scholar] [CrossRef]
  32. Mashreghi, J.; Nasri, M. Forcing strong convergence of Korpelevich’s method in Banach spaces with its applications in game theory. Nonlinear Anal. 2010, 72, 2086–2099. [Google Scholar] [CrossRef]
  33. Saejung, S.; Yotkaew, P. Approximation of zeroes of inverse strongly monotone operators in Banach spaces. Nonlinear Anal. 2012, 75, 742–750. [Google Scholar] [CrossRef]
  34. Hieu, D.V.; Anh, P.K.; Muu, L.D. Modified extragradient like algorithms with new stepsizes for variational inequalities. Comput. Optim. Appl. 2019, 73, 913–932. [Google Scholar] [CrossRef]
  35. Liu, H.; Yang, J. Weak convergence of iterative methods for solving quasimonotone variational inequalities. Comput. Optim. Appl. 2020, 77, 491–508. [Google Scholar] [CrossRef]
  36. Hu, X.; Wang, J. Solving pseudo-monotone variational inequalities and pseudo-convex optimization problems using the projection neural network. IEEE Trans. Neural Netw. 2006, 17, 1487–1499. [Google Scholar] [PubMed]
  37. Oyewole, O.K.; Reich, S. A totally relaxed self-adaptive algorithm for solving a variational inequality and fixed point problems in Banach spaces. Appl. Set-Valued Anal. Optim. 2022, 4, 349–366. [Google Scholar]
Figure 1. Example 1, (Top left): Case 1; (Top right): Case 2; (Bottom left): Case 3; (Bottom right): Case 4.
Figure 1. Example 1, (Top left): Case 1; (Top right): Case 2; (Bottom left): Case 3; (Bottom right): Case 4.
Symmetry 16 00363 g001
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

Maluleka, R.; Ugwunnadi, G.C.; Aphane, M.; Abass, H.A.; Khan, A.R. Modified Tseng Method for Solving Pseudomonotone Variational Inequality Problem in Banach Spaces. Symmetry 2024, 16, 363. https://doi.org/10.3390/sym16030363

AMA Style

Maluleka R, Ugwunnadi GC, Aphane M, Abass HA, Khan AR. Modified Tseng Method for Solving Pseudomonotone Variational Inequality Problem in Banach Spaces. Symmetry. 2024; 16(3):363. https://doi.org/10.3390/sym16030363

Chicago/Turabian Style

Maluleka, Rose, Godwin Chidi Ugwunnadi, Maggie Aphane, Hammed A. Abass, and Abdul Rahim Khan. 2024. "Modified Tseng Method for Solving Pseudomonotone Variational Inequality Problem in Banach Spaces" Symmetry 16, no. 3: 363. https://doi.org/10.3390/sym16030363

APA Style

Maluleka, R., Ugwunnadi, G. C., Aphane, M., Abass, H. A., & Khan, A. R. (2024). Modified Tseng Method for Solving Pseudomonotone Variational Inequality Problem in Banach Spaces. Symmetry, 16(3), 363. https://doi.org/10.3390/sym16030363

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