Next Article in Journal
Volume of Interest-Based Fractal Analysis of Huffaz’s Brain
Next Article in Special Issue
On the Application of Multi-Dimensional Laplace Decomposition Method for Solving Singular Fractional Pseudo-Hyperbolic Equations
Previous Article in Journal
Forecasting the Volatility of the Stock Index with Deep Learning Using Asymmetric Hurst Exponents
Previous Article in Special Issue
Financial Applications on Fractional Lévy Stochastic Processes
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Unified Inertial Iterative Approach for General Quasi Variational Inequality with Application

1
Department of Mathematics, Faculty of Science, Islamic University of Madinah, P.O. Box 170, Madinah 42351, Saudi Arabia
2
Department of Mathematics, Faculty of Science, University of Tabuk, P.O. Box 741, Tabuk 71491, Saudi Arabia
*
Author to whom correspondence should be addressed.
Fractal Fract. 2022, 6(7), 395; https://doi.org/10.3390/fractalfract6070395
Submission received: 11 March 2022 / Revised: 6 July 2022 / Accepted: 14 July 2022 / Published: 18 July 2022

Abstract

:
In this paper, we design two inertial iterative methods involving one and two inertial steps for investigating a general quasi-variational inequality in a real Hilbert space. We establish an existence result and a non-trivial example is furnished to substantiate our theoretical findings. We discuss the convergence of the inertial iterative algorithms to approximate the solution of a general quasi-variational inequality. Finally, we apply an inertial iterative scheme with two inertial steps to investigate a delay differential equation. The results presented herein can be seen as substantial generalizations of some known results.

1. Introduction

Let K be a non-empty closed convex set in a real Hilbert space H and θ : H H be a non-linear mapping in H . The variational inequality problem is to find a point p K , such that:
θ ( p ) , q p 0 , q K .
It is well documented that the study of variational inequality, which was initiated by Stampacchia [1] becomes a very productive and fruitful tool to examine several problems arising in the natural sciences. Due to an application oriented nature, this field of research has been expanded and generalized in several directions, see [2,3,4,5,6,7,8]. One of the pronounced generalizations of variational inequality is quasi-variational inequality (QVI) which is to find p K ( p ) , such that:
θ ( p ) , q p 0 , q K ( p ) ,
where K ( p ) is a closed convex-valued set in H . The QVI (2) was coined for the first time by Bensoussan and Lions [9] to deal with impulse control problems. The quasi-variational inequalities are variational inequalities in which the admissible space or the involved potentials depend on the solution of the problem. Quasi-variational inequalities bring forth a consolidated platform for variation inequalities, as well as integrated modelling of various physical problems of significance. The resulting applications of quasi-variational inequalities include game theory [10], continuum and solid mechanics [11,12,13], transportation [14,15], superconductivity, thermoplasticity, or electrostatics [16,17,18].
It is well known that numerous physical problems occurring in non-linear analysis and related fields can be represented in the template of fixed point problem. Let T : H H be a non-linear mapping. The fixed point of T is to locate a point p H , such that T ( p ) = p . The set of fixed points is denoted as F i x ( T ) = { p H : T ( p ) = p } . One of the most abundantly studied techniques for figuring out fixed points of non-expansive mappings in Banach and Hilbert spaces is known as Mann iterative technique, proposed by Mann [19] as follows:
x n + 1 = ( 1 α n ) x n + α n T x n , n N ,
where α n [ 0 , 1 ] and T : K K is a nonexpansive mapping on a closed convex subset K of a given Banach space. For some recently developed iterative methods, we refer [20,21,22,23,24,25,26,27]. Recently, Ali et al. [28] have constructed a new scheme. For initial p 0 D and { a n } in ( 0 , 1 ) , the sequence { p n } generated by this scheme is defined as:
r n = T [ ( 1 a n ) p n + a n T p n ] , q n = T r n , p n + 1 = T q n .
The authors demonstrated that their scheme converges faster than some noted iterative methods, such as S, Picard-S, Gursoy and Karakaya, and M-iteration schemes. To achieve augmented convergence rate of iterative methods for non-linear problems is fascinating for researchers. So far, numerous iterative techniques have been explored and examined for obtaining an incremental convergence rate. In this progression, many multi-step iterative algorithms are studied by adding initial term, see [29,30,31,32]. The inertial term is derived from the heavy ball with friction method due to Polyak [33] to examine optimization problems which were obtained by the discretizing of second order dynamical system for an oscillator with damping and conservative restoring force:
u ( t ) + ζ u ( t ) + ω ( u ( t ) ) = 0 ,
where u ( t ) , ω ( u ( t ) ) and ζ > 0 represent time continuous trajectory, external gravitational field and friction, respectively, and ω : H R is differentiable. In fact, inertial type iterative methods are generalization of proximal point algorithm as they are produced by discretization of a second-order-in-time dissipative dynamical system. Alvarez [34] have shown that ω : H R is a smooth convex function then each trajectory t u ( t ) converges weakly to a minimizer of ω . The relaxation method introduced by Richardson [35] for solving linear systems is also a technique for augmentation of convergence rate. Eckstein and Bertsekas [36] designed a relaxed proximal point scheme to accelerate the proximal point algorithm. They reported that the rate of convergence is enhanced by adding relaxation parameter. Alvarez [37] proposed an iterative scheme by combining relaxation techniques and inertial term to examine monotone inclusion and convex optimization problems. Maigne [38] added an inertial term to Krasnoselskii–Mann iteration and designed the inertial Mann iterative method for calculating fixed points of a non-expansive mapping in Hilbert spaces as following:
y n = x n + θ n ( x n + x n 1 ) , x n + 1 = ( 1 α n ) y n + α n T y n , n N ,
where θ n is a damping type term and α n is a relaxation factor.
Inspired and persuaded by the acknowledged facts in the above-mentioned references, we introduce two inertial iterative methods. The first is based on (4) which includes one inertial step and is defined as:
ω n = p n Θ n ( p n p n 1 ) , r n = T [ ( 1 a n ) ω n + a n T ω n ] , q n = T r n , p n + 1 = T q n ,
where { a n } is a sequence in ( 0 , 1 ) . The second inertial scheme contains two inertial steps which is to define the sequence { p n } with initial points p 0 , p 1 H as below:
ω n = p n + μ n ( p n p n 1 ) , q n = p n + ν n ( p n p n 1 ) , p n + 1 = ( 1 a n b n ) q n + a n T ( q n ) + b n ω n ,
where ϱ > 0 is a constant and { a n } , { b n } are sequences in ( 0 , 1 ) . We deal with a class of general quasi-variational inequalities (GQVI) by implementing newly established inertial iterative methods. We prove an existence result and theoretical claims are verified by a non-trivial example. Additionally, we establish the convergence of inertial iterative algorithms involving one and two inertial steps. Finally, as an application of our proposed inertial method, we investigate a delay differential equation.

2. Preliminaries

Let H be a Hilbert space over the real numbers with norm · and inner-product · , · , and let C ( H ) denote the collection of non-empty closed convex subsets of H . In addition, let θ , ϕ : H H be not necessarily linear mappings in H , and suppose that the set-valued mapping K : H C ( H ) assigns to every p H a closed convex subset K ( p ) of H .
We consider the problem of finding p H : ϕ ( p ) K ( p ) , such that:
θ ( p ) , ϕ ( q ) ϕ ( p ) 0 , q H , ϕ ( q ) K ( p ) ,
called the general quasi-variational inequality (GQVI). It is chronicle that quasi-variational inequalities are desperately applications oriented field of research. Several problems of practical applications, such as modeling of stochastic impulsive control problems, free boundary problems, mechanics, and economy, have been framed as a model of quasi-variational inequalities, see [10,39,40,41]. We take into account the following third order implicit obstacle boundary value problem ( O B V P ) of finding p, such that:
p ( x ) g ( x ) , on D = [ a 1 , a 2 ] p ( x ) C ( p ) , on D = [ a 1 , a 2 ] [ p ( x ) g ( x ) ] [ p C ( p ) ] = 0 , on D = [ a 1 , a 2 ] p ( a 1 ) = 0 , p ( a 1 ) = 0 , p ( a 2 ) = 0 ,
where g ( x ) is a continuous function and C ( p ) stands for the cost (obstacle) function. A typical form of this function in (10) is:
C ( p ) = s + inf i { p i } ,
where s represents switching cost and the cost function C provides the coupling between unknowns p = ( p 1 , p 2 , , p i ) . It is positive or zero, if the unit is turned on or off, respectively. To exhibit O B V P (10) as a quasi-variational inequality, we define:
K ( p ) = { q : q H 0 2 ( D ) , q C ( p ) , on D } ,
where H 0 2 ( D ) is a Sobolev space, see [42] and K is a closed convex set in H 0 2 ( D ) . The O B V P (10) can be imitated as the following energy functional:
E ( q ) = a 1 a 2 d 2 q d x 2 d q d x d x 2 a 1 a 2 g ( x ) d q d x d x , = a 1 a 2 d q d x 2 d x 2 a 1 a 2 g ( x ) d q d x d x = θ ( q ) , d q d x 2 g , d q d x , d q d x K ( p ) ,
where:
θ ( p ) , q = a 1 a 2 d 3 p d x 3 d q d x d x = a 1 a 2 d p d x d q d x d x g , d q d x = a 1 a 2 g ( x ) d q d x d x .
Note that θ specified in (13) is linear, nonsymmetric, and g-positive. By implementing the approach as in [43], we see that the minimum of energy functional E ( q ) on K ( p ) can be represented as:
θ ( p ) , ϕ ( q ) ϕ ( p ) g , ϕ ( q ) ϕ ( p ) , q K ( p ) ,
which is indeed GQVI (9), for more detail see [44]. The problem described in (9) is a unification of several others. Some special cases of GQVI (9) are listed below.
1.
For K ( p ) = K , GQVI (9) reduces to the general variational inequality introduced by Noor [45] which is to find p H : ϕ ( p ) K ( p ) , such that:
θ ( p ) , ϕ ( q ) ϕ ( p ) 0 , q H , ϕ ( q ) K .
2.
Let for p 0 H , the dual cone of K ( p 0 ) H be represented by
K ¯ ( p 0 ) = { p H : p , q 0 , q K ( p 0 ) } .
Then problem (15) becomes a general complementarity problem, that is, to find p H , such that:
θ ( p ) , ϕ ( p ) 0 , ϕ ( p ) K ( p ) and θ ( p ) K ¯ ( p ) .
3.
For ϕ = I , GQVI (9) reduces to the classical quasi-variational inequality (2) introduced in [9].
4.
For ϕ = I and K ( p ) = K , GQVI (9) reduces to the classical variational inequality (1) introduced by Stampacchia [1].
Next, we list some handy tools to accomplish our results.
Definition 1.
A single-valued mapping θ : H H is called:
(i) 
η-strongly monotone if for some η 0 ,
θ ( p ) θ ( q ) , p q η p q 2 , p , q H ;
(ii) 
relaxed ( ς , τ ) -cocoercive if for some ς , τ > 0 ,
θ ( p ) θ ( q ) , p q ς θ ( p ) θ ( q ) 2 + τ p q 2 , p , q H ;
(iii) 
σ-Lipschitz continuous if for some σ > 0 ,
θ ( p ) θ ( q ) σ p q , p , q H ;
(iv) 
g-positive if, and only if,
θ ( p ) , g ( p ) 0 , p H .
Lemma 1
([46]). Let { p n } and { q n } be sequences of non-negative real numbers, such that there exists some r [ 0 , 1 ) with the property that for each n N the inequality p n + 1 r p n + q n is satisfied. If lim n q n = 0 , then lim n p n = 0 .
Lemma 2
([47]). Let { p n } be a sequence of non-negative real numbers, such that
p n + 1 ( 1 τ n ) p n + τ n q n + r n , for all n N ,
where the sequences { τ n } , { q n } and { r n } accomplish the following conditions:
(i) 
the sequence { τ n } is in [ 0 , 1 ] such that n = 1 τ n = ;
(ii) 
lim sup n q n 0 ;
(iii) 
r n 0 for all n N , such that n r n < .
Then, lim n p n = 0 .
Let K be a closed convex subset of H . It is known that for each p H there exists a unique point Π K ( p ) in K , such that
p Π K ( p ) = min { p q : q K } .
Then, by definition, the surjective mapping p Π K ( p ) , p H , is the metric projection Π K from H onto K .
The following lemma is essential and plays a central role in achieving our goal.
Lemma 3.
For any given r H , p K ( p ) and implicit projection Π K ( p ) of H onto K ( p ) H , we have p r , q p 0 , q K ( p ) if p = Π K ( p ) ( r ) .
Note that the implicit projection mapping Π K ( p ) is non-expansive, that is,
Π K ( p ) ( q ) Π K ( p ) ( r ) q r , q , r H .
Assumption 1
([48]). For any p , q , r H , the implicit projection mapping Π K ( p ) satisfies following characteristic condition
Π K ( p ) ( r ) Π K ( q ) ( r ) κ p q ,
where κ > 0 is a constant.
Next, we remodel GQVI (9) into a fixed point problem by using the projection.
Lemma 4.
The function p H : ϕ ( p ) K ( p ) is a solution of GQVI (9) if, and only if, p is a fixed point of I ϕ + Π K ( p ) [ ϕ ϱ θ ] , i.e.,
p = p ϕ ( p ) + Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] ,
where Π K ( p ) is the projection of H onto K ( p ) and ϱ > 0 is a constant.
Based on (17), we rewrite the algorithm (7) as under:
ω n = p n Θ n ( p n p n 1 ) , q n = ψ [ ( 1 a n ) ω n + a n ψ ( ω n ) ] , r n = ψ q n , p n + 1 = ψ r n ,
where { a n } is a sequence in ( 0 , 1 ) and ψ : H H is an operator defined as
ψ : = I ϕ + Π K ( p ) [ ϕ ϱ θ ] .

3. Existence Result

Following theorem ensures the existence of unique solution of GQVI (9) which is followed by a demonstrative numerical example to verify our theoretical claims.
Theorem 1.
Let Π K ( p ) : H K ( p ) be a projection and θ , ϕ : H H be non-linear mappings, such that θ is relaxed ( σ , τ ) -cocoercive and ς-Lipschiz continuous and ϕ is γ-Lipschitz continuous and η-strongly monotone. Suppose that assumption C holds and there exists ϱ > 0 complying with the following condition
ϱ ς 2 < 2 ϱ τ + φ ( φ 2 ) ϱ + 2 σ ,
where φ = 2 1 2 η + γ 2 + κ . Then, GQVI (9) admits a unique solution.
Proof. 
From (19), assumption C and the non-expansiveness of Π K ( p ) , we acquire:
ψ ( p ) ψ ( q ) = p ϕ ( p ) + Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] { q ϕ ( q ) + Π K ( p ) [ ϕ ( q ) ϱ θ ( q ) ] } p q [ ϕ ( p ) ϕ ( q ) ] + Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] Π K ( q ) [ ϕ ( q ) ϱ θ ( q ) ] p q [ ϕ ( p ) ϕ ( q ) ] + Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] Π K ( p ) [ ϕ ( q ) ϱ θ ( q ) ] + Π K ( p ) [ ϕ ( q ) ϱ θ ( q ) ] Π K ( q ) [ ϕ ( q ) ϱ θ ( q ) ] p q [ ϕ ( p ) ϕ ( q ) ] + ϕ ( p ) ϕ ( q ) ϱ [ θ ( p ) θ ( q ) ] + κ p q 2 p q [ ϕ ( p ) ϕ ( q ) ] + p q ϱ [ θ ( p ) θ ( q ) ] + κ p q .
Using the γ -Lipschitz continuity and the η -strongly monotone property of ϕ , we obtain
p q [ ϕ ( p ) ϕ ( q ) ] 2 = p q 2 + ϕ ( p ) ϕ ( q ) 2 2 p q , ϕ ( p ) ϕ ( q ) p q 2 + γ 2 p q 2 2 η p q 2 = [ 1 2 η + γ 2 ] p q 2 ,
which turns into
p q [ ϕ ( p ) ϕ ( q ) ] 1 2 η + γ 2 p q .
Additionally, from the relaxed ( σ , τ ) -cocoercivity and ς -Lipschiz continuity of θ , we obtain:
p q ϱ [ θ ( p ) θ ( q ) ] 2 = p q 2 + ϱ 2 θ ( p ) θ ( q ) 2 2 ϱ p q , θ ( p ) θ ( q ) p q 2 + ϱ 2 ς 2 p q 2 + 2 ϱ σ θ ( p ) θ ( q ) 2 2 ϱ τ p q 2 p q 2 + ϱ 2 ς 2 p q 2 + 2 ϱ σ ς 2 p q 2 2 ϱ τ p q 2 = [ 1 2 ϱ ( τ σ ς 2 ) + ϱ 2 ς 2 ] p q 2 ,
which leads to:
p q ϱ [ θ ( p ) θ ( q ) ] 1 2 ϱ ( τ σ ς 2 ) + ϱ 2 ς 2 p q .
Thus, from (22)–(23), (21) turns into
ψ ( p ) ψ ( q ) Φ p q ,
where Φ = φ + Δ ( ϱ ) , φ = 2 1 2 η + γ 2 + κ and Δ ( ϱ ) = 1 2 ϱ ( τ σ ς 2 ) + ϱ 2 ς 2 . From (20), it follows that Φ < 1 and, hence, ψ : H H is a contraction mapping. Therefore, ψ ( p ) = p and hence p H : ϕ ( p ) K ( p ) is a unique solution of GQVI (9). □

4. Convergence Results

Now, we inspect the convergence of inertial iterative methods to figure out the approximate solution of GQVI (9). By means of (19), we can redesign (18) as below:
Next, we prove the following lemma, which plays a deciding role in establishing the convergence.
Lemma 5.
Under the assumptions of the Theorem 1, the sequence { ζ n p n p n 1 } norm convergence in the Hilbert space H to 0. Here, the sequence { ζ n } n = 1 is given by:
ζ n = min n 1 n 1 + c , ϵ n p n p n 1 , i f p n p n 1 , n 1 n 1 + c , i f p n = p n 1 ,
for all n N , c 3 and ϵ n ( 0 , ) , such that lim n ϵ n = 0 .
Proof. 
We give a proof of Lemma 5 by considering four different cases.
Case ( 1 ) . If p n = p n 1 , then there is nothing to show because ζ n p n p n 1 is zero.
Next, we consider the cases, when p n p n 1 .
Case ( 2 ) . Suppose that for all n N , ζ n = n 1 n 1 + c , then from (25), we acquire 0 ζ n = n 1 n 1 + c ϵ n p n p n 1 and hence 0 ζ n p n p n 1 ϵ n .
Case ( 3 ) . Suppose that for all n N , ζ n = ϵ n p n p n 1 , then from (25), we obtain: 0 ζ n = ϵ n p n p n 1 n 1 n 1 + c and hence 0 ζ n p n p n 1 = ϵ n .
Case ( 4 ) . Suppose that for some n N , ζ n = n 1 n 1 + c = ϵ n p n p n 1 , then from (25), we obtain 0 ζ n p n p n 1 = ϵ n .
Thus, for all n N , we have 0 ζ n p n p n 1 ϵ n . Since lim n ϵ n = 0 and, hence, { ζ n p n p n 1 } converges to 0. □
Theorem 2.
Suppose that mappings Π K ( p ) , θ and ϕ : H H are the same and comply with all the assumptions of Theorem 1. Suppose the sequence { p n } initiated by Algorithm 1 with the updating parameter ζ n represented by (25) with | Θ n | ζ n , for all n N and { a n } is in ( 0 , 1 ) . Let { ϵ n } be a sequence given in (25), such that lim n ϵ n = 0 . Then { p n } converges strongly to the unique solution p of GQVI (9).
Algorithm1. 
Define the sequence { p n } with arbitrary initial point p 0 as below:
ω n = p n Θ n ( p n p n 1 ) ,
z n = ( 1 a n ) ω n + a n ψ ( ω n ) ,
q n = z n ϕ ( z n ) + Π K ( z n ) [ ϕ ( z n ) ϱ θ ( z n ) ] ,
r n = q n ϕ ( q n ) + Π K ( q n ) [ ϕ ( q n ) ϱ θ ( q n ) ] ,
p n + 1 = r n ϕ ( r n ) + Π K ( r n ) [ ϕ ( r n ) ϱ θ ( r n ) ] ,
where { a n } is a sequence in ( 0 , 1 ) .
Proof. 
It follows from (30), (17), assumption C and the non-expansiveness of Π K ( p ) that:
p n + 1 p = r n ϕ ( r n ) + Π K ( r n ) [ ϕ ( r n ) ϱ θ ( r n ) ] { p ϕ ( p ) + Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] } r n p [ ϕ ( r n ) ϕ ( p ) ] + Π K ( r n ) [ ϕ ( r n ) ϱ θ ( r n ) ] Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] r n p [ ϕ ( r n ) ϕ ( p ) ] + Π K ( r n ) [ ϕ ( r n ) ϱ θ ( r n ) ] Π K ( r n ) [ ϕ ( p ) ϱ θ ( p ) ] + Π K ( r n ) [ ϕ ( p ) ϱ θ ( p ) ] Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] r n p [ ϕ ( r n ) ϕ ( p ) ] + ϕ ( r n ) ϕ ( p ) ϱ [ θ ( r n ) θ ( p ) ] + κ r n p 2 r n p [ ϕ ( r n ) ϕ ( p ) ] + r n p ϱ [ θ ( r n ) θ ( p ) ] + κ r n p .
Utilizing the γ -Lipschitz continuity and η -strongly monotone property of ϕ , we obtain:
r n p [ ϕ ( r n ) ϕ ( p ) ] 2 = r n p 2 + ϕ ( r n ) ϕ ( p ) 2 2 r n p , ϕ ( r n ) ϕ ( p ) r n p 2 + γ 2 r n p 2 2 η r n p 2 = [ 1 2 η + γ 2 ] r n p 2 .
It follows from the relaxed ( σ , τ ) -cocoercivity and ς -Lipschitz continuity of θ that:
r n p ϱ [ θ ( r n ) θ ( p ) ] 2 = r n p 2 + ϱ 2 θ ( r n ) θ ( p ) 2 2 ϱ r n p , θ ( r n ) θ ( p ) r n p 2 + ϱ 2 ς 2 r n p 2 + 2 ϱ σ θ ( r n ) θ ( p ) 2 2 ϱ τ r n p 2 r n p 2 + ϱ 2 ς 2 r n p 2 + 2 ϱ σ ς 2 r n p 2 2 ϱ τ r n p 2 = [ 1 2 ϱ ( τ σ ς 2 ) + ϱ 2 ς 2 ] r n p 2 .
Thus, from (31)–(33), we obtain
p n + 1 p Φ r n p ,
where Φ = [ φ + Δ ( ϱ ) ] , φ = 2 1 2 η + γ 2 + κ and Δ ( ϱ ) = 1 2 ϱ ( τ σ ς 2 ) + ϱ 2 ς 2 .
In a similar fashion to (29) and (17), we can obtain:
r n p = q n ϕ ( q n ) + Π K ( q n ) [ ϕ ( q n ) ϱ θ ( q n ) ] { p ϕ ( p ) + Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] } Φ q n p .
In the same way as in (28) and (17), we obtain:
q n p = z n ϕ ( z n ) + Π K ( z n ) [ ϕ ( z n ) ϱ θ ( z n ) ] { p ϕ ( p ) + Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] } Φ z n p .
Similarly, from (27) and (17), we have
z n p = ω n ϕ ( ω n ) + Π K ( ω n ) [ ϕ ( ω n ) ϱ θ ( ω n ) ] { p ϕ ( p ) + Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] } Φ ω n p .
Now from (26) and (17), we obtain:
ω n p = p n Θ n ( p n p n 1 ) p ) p n p + Θ n p n p n 1 .
By using (38) and (37), we deduce that:
z n p Φ ω n p Φ [ p n p + Θ n p n p n 1 ] .
Taking (39) and (36) into account, we have:
q n p Φ z n p Φ 2 [ p n p + Θ n p n p n 1 ] .
By using (40) and (35) we can write:
r n p Φ q n p Φ 3 [ p n p + Θ n p n p n 1 ] .
Additionally, from (41) and (34), we obtain:
p n + 1 p Φ r n p Φ 4 [ p n p + Θ n p n p n 1 ] Φ 4 p n p + ζ n p n p n 1
From (20), we know that Φ < 1 and from Lemma 5, ζ n p n p n 1 0 as n . Hence, from Lemma 1, we obtain that lim n p n = p . □
Next, we put forward a more prevalent inertial iterative algorithm for approximating GQVI (9), which contains two inertial terms. By making use of (19), (8) can be redesigned as follows:
Theorem 3.
Suppose that the mappings Π K ( p ) , θ and ϕ : H H are the same and comply with all the assumptions of Theorem 1. Suppose that the sequence { p n } initiated by Algorithm 2 with the updating parameter ζ n represented by (24) with | ν n | + | μ n | ζ n , for all n N and the sequences { a n } , { b n } are in ( 0 , 1 ) , such that 0 < a n + b n < 1 , for all n N . Let { ϵ n } be a sequence given in (25), such that lim n ϵ n = 0 . Then { p n } converges strongly to the unique solution p of GQVI (9).
Algorithm 2.
Define the sequence { p n } with initial points p 0 , p 1 H as below:
ω n = p n + μ n ( p n p n 1 ) ,
q n = p n + ν n ( p n p n 1 ) ,
p n + 1 = ( 1 a n b n ) q n + a n q n ϕ ( q n ) + Π K ( q n ) [ ϕ ( q n ) ϱ θ ( q n ) ] + b n ω n ,
where ϱ > 0 is a constant and { a n } , { b n } are sequences in ( 0 , 1 ) .
Proof. 
It is proved in Theorem 1 that GQVI (9) has a unique solution p . Next, it remains to substantiate that the sequence { p n } converges to p under the assumption of Algorithm 2. It follows from (17) that:
p = p ϕ ( p ) + Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] .
By utilizing assumption C, the non-expansiveness of the mapping Π K ( p ) and following the steps as in (21), we obtain:
q n ϕ ( q n ) + Π K ( q n ) ( ϕ ( q n ) ϱ θ ( q n ) ) p = q n ϕ ( q n ) + Π K ( q n ) ( ϕ ( q n ) ϱ θ ( q n ) ) { p ϕ ( p ) + Π K ( p ) [ ϕ ( p ) ϱ θ ( p ) ] } 2 q n p [ ϕ ( q n ) ϕ ( p ) ] + q n p ϱ [ θ ( q n ) θ ( p ) ] + κ q n p .
Since ϕ is γ -Lipschitz continuous, η -strongly monotone and θ is relaxed ( σ , τ ) -cocoercive, ς -Lipschitz continuous, then adopting the approach as in (22)–(24), we can write:
q n ϕ ( q n ) + Π K ( q n ) ( ϕ ( q n ) ϱ θ ( q n ) ) p Φ q n p .
From (45) and (47), we can conclude that:
p n + 1 p = ( 1 a n b n ) q n + a n [ q n ϕ ( q n ) + Π K ( q n ) ( ϕ ( q n ) ϱ θ ( q n ) ) ] + b n ω n p ( 1 a n b n ) q n p + a n q n ϕ ( q n ) + Π K ( q n ) ( ϕ ( q n ) ϱ θ ( q n ) ) p + b n ω n p ( 1 a n b n + a n Φ ) q n p + b n ω n p .
Since { a n } is in ( 0 , 1 ) , then for all n N , one can find a constant a R , such that a a n . It follows from (20) that Φ < 1 and utilizing (43), (44), we can write:
p n + 1 p ( 1 a n b n + a n Φ ) q n p + b n ω n p ( 1 a n b n + a n Φ ) [ p n p + | ν n | p n p n 1 ] + b n p n p + | μ n | p n p n 1 ] ( 1 a n b n + a n Φ + b n ) p n p + [ ( 1 a n b n + a n Φ ) | ν n | + b n | μ n | ] p n p n 1 ( 1 a n ( 1 Φ ) ) p n p + [ ( 1 a n b n + a n Φ ) | ν n | + b n | μ n | ] p n p n 1 ( 1 a n ( 1 Φ ) ) p n p + [ ( 1 a n b n + a n ) | ν n | + b n | μ n | ] p n p n 1 ( 1 a ( 1 Φ ) ) p n p + ( | ν n | + | μ n | ) p n p n 1 ( 1 a ( 1 Φ ) ) p n p + ζ n p n p n 1 .
From (20), we know that Φ < 1 and, hence, 1 a ( 1 Φ ) < 1 and from Lemma 5, ζ n p n p n 1 0 as n . Hence, from Lemma 1, we conclude that lim n p n = p . □
Remark 1.
It can be perceived that under the assumptions of Theorem 3, by following the approach as in Lemma 5, n = 1 ζ n p n p n 1 is convergent.
Corollary 1.
Suppose that the mappings Π K ( p ) , θ and ϕ : H H are the same and comply with all the assumptions of Theorem 1. Suppose that the sequence { p n } initiated by Algorithm 2 with the updating parameter ζ n represented by (25) with | μ n | + | ν n | ζ n , for all n N and the sequences { a n } , { b n } are in ( 0 , 1 ) , such that 0 < a n + b n < 1 , for all n N and n = 1 a n = . Let { ϵ n } be a sequence given in (25) such that lim n ϵ n = 0 . Then, the sequence { p n } converges strongly to the unique solution p of GQVI (9).
Proof. 
From (48) and (49), we have:
p n + 1 p ( 1 a n ( 1 Φ ) ) p n p + ζ n p n p n 1 .
It emanates from Remark 1 that n = 1 ζ n p n p n 1 < and 1 a n ( 1 Φ ) < 1 . From the assumption, we can write n = 1 a n ( 1 Φ ) = . Hence, from Lemma 2, we have lim n p n = p . □
Example 1.
Let l 2 = p = ( p 0 , p 1 , p 2 , ) : n = 0 | p n | 2 < , p n R , n N { 0 } be a real Hilbert space equipped with norm p 2 = n = 0 | p n | 2 1 / 2 . Define the mappings θ , ϕ : H H by
θ ( p ) = p 2 , ϕ ( p ) = 2 3 p , p H .
Then, for all p , q H , one can observe that:
p q , ϕ ( p ) ϕ ( q ) = p q , 2 3 p 2 3 q = 2 3 p q 2 2 ,
ϕ ( p ) ϕ ( q ) 2 = 2 3 p 2 3 q 2 = 2 3 p q 2 .
Thus, the mapping ϕ is 2 3 -strongly monotone and 2 3 -Lipschitz continuous. Additionally,
p q , θ ( p ) θ ( q ) = p q , p 2 q 2 1 4 θ ( p ) θ ( q ) 2 2 + 1 4 p q 2 2 ,
θ ( p ) θ ( q ) 2 = p 2 p 2 2 = 1 2 p q 2 .
Thus, the mapping θ is relaxed 1 4 , 1 4 -cocoercive and 1 2 -Lipschitz continuous. Next, we define a set-valued mapping K : H H by
K ( p ) = K ( { p n } ) = u = { u n } : u 0 p 0 15 , u n = 0 , for all n N .
We claim that K ( p ) is a closed convex set. Indeed, for any arbitrary α [ 0 , 1 ] and u 0 , v 0 K ( p ) , we have α u 0 + ( 1 α ) v 0 p 0 15 and, hence, K ( p ) is a convex set. Now, we define g : [ p 0 15 , ) K ( p ) by g ( r ) = ( r , 0 , 0 , ) . Evidently, g is well defined. In point of fact, for distinct u , v [ p 0 15 , ) , we have ( u , 0 , 0 , ) ( v , 0 , 0 , ) , i.e., g is injective. It is easy to see that there exists an u 0 [ p 0 15 , ) so that g ( u 0 ) = ( u 0 , 0 , 0 , ) for each u = ( u 0 , 0 , 0 , ) K ( p ) , i.e., g is surjective. Let ( l 2 , d 2 ) and ( R , d ) be usual metric spaces, then for each u , v [ p 0 15 , ) , we obtain:
d 2 ( g ( u ) , g ( v ) ) = d 2 ( ( u , 0 , 0 , ) , ( v , 0 , 0 , ) ) = | u v | = d ( u , v ) .
Thus g is continuous. Moreover, g 1 is also continuous and bijective and hence g is a homeomorphism. Being homeomorphic to a closed set [ p 0 15 , ) , K ( p ) is also closed. Define metric projection Π K ( p ) : H K ( p ) by:
Π K ( p ) ( l 0 , l 1 , l 2 , ) = ( l 0 , l 1 , l 2 , ) , i f ( l 0 , l 1 , l 2 , ) K ( p ) ( p 0 15 , 0 , 0 , ) , i f ( l 0 , l 1 , l 2 , ) K ( p ) , l 0 < p 0 15 ( l 0 , 0 , 0 , ) , i f ( l 0 , l 1 , l 2 , ) K ( p ) , l 0 p 0 15 .
To show that the projection Π K ( p ) satisfies the assumption C, we discuss the following cases.
Case ( a ) . For arbitrary p = { p n } , q = { q n } , l = { l n } H , suppose that p 0 q 0 .
1. 
If l = { l n } K ( q ) , then l = { l n } K ( p ) and, hence:
Π K ( p ) ( l ) Π K ( q ) ( l ) 2 = ( l 0 , l 1 , l 2 , ) ( l 0 , l 1 , l 2 , ) 2 = 0 1 15 p q 2 .
2. 
If l = ( l 0 , l 1 , l 2 , ) K ( q ) and l = ( l 0 , l 1 , l 2 , ) K ( p ) , then either l 0 < q 0 15 or l 0 q 0 15 . For l 0 < q 0 15 , we have:
Π K ( p ) ( l ) Π K ( q ) ( l ) 2 = ( l 0 , l 1 , l 2 , ) p 0 15 , 0 , 0 , 2 = ( l 0 , 0 , 0 , ) p 0 15 , 0 , 0 , 2 = | l 0 p 0 15 | = l 0 p 0 15 1 15 p q 2 .
For l 0 q 0 15 , we have:
Π K ( p ) ( l ) Π K ( q ) ( l ) 2 = ( l 0 , l 1 , l 2 , ) ( l 0 , 0 , 0 , ) 2 = ( l 0 , 0 , 0 , ) ( l 0 , 0 , 0 , ) 2 = 0 1 15 p q 2 .
3. 
If l = ( l 0 , l 1 , l 2 , ) K ( q ) and l = ( l 0 , l 1 , l 2 , ) K ( p ) , then either l 0 < q 0 15 or l 0 q 0 15 and l 0 < p 0 15 or l 0 p 0 15 . For l 0 < p 0 15 , we have l 0 < q 0 15 . Therefore, we can conclude that
Π K ( p ) ( l ) Π K ( q ) ( l ) 2 = p 0 15 , 0 , 0 , q 0 15 , 0 , 0 , 2 = | p 0 15 q 0 15 | 1 15 p q 2 .
For l 0 p 0 15 and l 0 q 0 15 , we have
Π K ( p ) ( l ) Π K ( q ) ( l ) 2 = ( l 0 , 0 , 0 , ) ( l 0 , 0 , 0 , ) 2 = 0 1 15 p q 2 .
For l 0 p 0 15 and l 0 < q 0 15 , we have
Π K ( p ) ( l ) Π K ( q ) ( l ) 2 = ( l 0 , 0 , 0 , ) ( q 0 10 , 0 , 0 , ) 2 = | l 0 q 0 15 | = q 0 15 l 0 q 0 15 p 0 15 1 15 p q 2 .
Case ( b ) . Similarly, for arbitrary p = { p n } , q = { q n } , r = { l n } H with p 0 > q 0 , we can verify that
Π K ( p ) ( l ) Π K ( q ) ( l ) 2 1 15 p q 2 .
Thus, we conclude that the projection Π K ( p ) satisfies the assumption C with constant κ = 1 15 . Additionally, the condition (20) is satisfied for η = γ = 2 3 , σ = τ = 1 4 , ς = 1 2 , and ϱ = 1 . Finally, we shall find a unique point p K ( p ) which solves GQVI (9). Consider p = ( p 0 , 0 , 0 , ) : p 0 0 , then for p > 0 , we have:
θ ( p ) , ϕ ( q ) ϕ ( p ) = p 2 , 2 3 ( q ) 2 3 ( p ) = 1 3 ( p 0 , 0 , 0 , ) , ( q 0 p 0 , 0 , 0 , ) < 0 , q = ( q 0 , 0 , 0 , ) K ( p ) .
However, for p = ( 0 , 0 , 0 , ) , we have:
θ ( p ) , ϕ ( q ) ϕ ( p ) = ( 0 , 0 , 0 , ) , ( q 0 p 0 , 0 , 0 , ) = 0 , q = ( q 0 , 0 , 0 , ) K ( p ) .
Hence, p = ( 0 , 0 , 0 , ) K ( p ) is a unique solution of GQVI (9). Consider a sequence { p ( n ) } l 2 and for all n N , take μ n = n 6 ( n + 2 ) , ν n = n 5 ( n + 1 ) , a n = n + 7 2 ( n + 5 ) , b n = n 1 4 ( n + 6 ) with initial points p ( 0 ) = ( 1 2 , 1 6 , 0 , 0 , ) , p ( 1 ) = ( 1 , 1 3 , 0 , 0 , ) in Algorithm 2. Table 1 shows that the scheme 2 converges faster with initial terms than that of with μ n = ν n = 0 .

5. Application to Delay Differential Equation

In this section, we make use of the inertial iterative Algorithm 2 to find an approximate solution of the delay differential equation stated as under:
ω ( s ) = h ( s , ω ( s ) , ω ( s τ ) ) , s [ s 0 , a 1 ] , ω ( s ) = ϑ ( s ) , s [ s 0 τ , s 0 ] .
Let C [ a 0 , a 1 ] denotes the space of all continuous real-valued functions defined on [ a 0 , a 1 ] equipped with the Chebyshev norm p = max s [ a 0 , a 1 ] | p ( s ) | . From classical analysis, observe that ( C [ a 0 , a 1 ] , · ) is a Banach space. Suppose the following assumptions are fulfilled.
(C1)
s 0 , a 1 R , τ > 0 ;
(C2)
h C ( [ s 0 , a 1 ] × R 2 , R ) ;
(C3)
ϑ C ( [ s 0 τ , a 1 ] , R ) ;
(C4)
there exists L h > 0 so that
| h ( s , m 1 , m 2 ) h ( s , n 1 , n 2 ) | L h i = 1 2 | m i n i | , for all m i , n i R , s [ s 0 , a 1 ] ;
(C5)
2 L h ( a 1 s 0 ) < 1 .
Suppose that the solution p C ( [ s 0 τ , a 1 ] , R ) C 1 ( [ s 0 , a 1 ] , R ) of the problem (51) exists. Then it can be modelled as being a solution of the following integral equation.
ω ( s ) = ϑ ( s ) , s [ s 0 τ , s 0 ] , ϑ ( s 0 ) + s 0 s h ( r , ω ( r ) , ω ( r τ ) ) d r , s [ s 0 , a 1 ] .
Next, we present convergence of our inertial iterative algorithm to look over the solution of Problem (51).
Theorem 4.
Suppose the assumptions ( C 1 ) ( C 5 ) are fulfilled. Let { ϵ n } be a sequence given in (25), such that lim n ϵ n = 0 . Let { p n } be a sequence initiated by (43)–(45) with the updating parameter ζ n represented by (25) with | μ n | + | ν n | ζ n , for all n N and { a n } , { b n } ( 0 , 1 ) , such that 0 < a n + b n < 1 , for all n N . Then, { p n } converges to the unique solution p C ( [ s 0 τ , a 1 ] , R ) C 1 ( [ s 0 , a 1 ] , R ) of Problem (50).
Proof. 
Define the operator ψ ( ω ( s ) ) = ϑ ( s ) , s [ s 0 τ , s 0 ] , ϑ ( s 0 ) + s 0 s h ( r , ω ( r ) , ω ( r τ ) ) d r , s [ s 0 , a 1 ] , where { a n } and { b n } are sequences in (0,1), such that k = 0 a k b k = . From (17) and (19), it follows that p is a fixed point of ψ . In addition, let { p n } be a sequence generated by (45). Then, for s [ s 0 , a 1 ] , we have:
p n + 1 p = ( 1 a n b n ) q n + a n ψ ( q n ) + b n ω n p ( 1 a n b n ) q n p + a n ψ ( q n ) ψ ( p ) + b n ω n p = ( 1 a n b n ) q n p + a n max s [ s 0 τ , a 1 ] | ψ q n ( s ) ψ p ( s ) | + b n ω n p ( 1 a n b n ) q n p + a n max s [ s 0 τ , a 1 ] | ϑ ( s 0 ) + s 0 s h ( r , q n ( r ) , q n ( r τ ) ) d r ϑ ( s 0 ) s 0 s h ( r , p ( r ) , p ( r τ ) ) d r | + b n ω n p ( 1 a n b n ) q n p + a n max s [ s 0 τ , a 1 ] s 0 s | h ( r , q n ( r ) , q n ( r τ ) ) h ( r , p ( r ) , p ( r τ ) ) | d r + b n ω n p ( 1 a n b n ) q n p + a n s 0 s L h ( max s [ s 0 τ , a 1 ] | q n ( r ) p ( r ) | + max s [ s 0 τ , a 1 ] | q n ( r τ ) p ( r τ ) | ) d r + b n ω n p
( 1 a n b n ) q n p + a n L h ( max s [ s 0 τ , a 1 ] | q n ( r ) p ( r ) | + max s [ s 0 τ , a 1 ] | q n ( r τ ) p ( r τ ) | ) s 0 s d r + b n ω n p ( 1 a n b n ) q n p + 2 a n L h ( a 1 s 0 ) q n p + b n ω n p = ( 1 a n b n + 2 a n L h ( a 1 s 0 ) ) q n p + b n ω n p .
Since { a n } , { b n } are sequences in ( 0 , 1 ) and from assumption ( C 5 ), we know that 2 L h ( a 1 s 0 ) < 1 . Then, by utilizing (43) and (44), (53) becomes:
p n + 1 p ( 1 a n b n + 2 a n L h ( a 1 s 0 ) ) q n p + b n ω n p ( 1 a n b n + 2 a n L h ( a 1 s 0 ) ) [ p n p + | ν n | p n p n 1 ] + b n p n p + | μ n | p n p n 1 ] ( 1 a n b n + 2 a n L h ( a 1 s 0 ) + b n ) p n p + [ ( 1 a n b n + 2 a n L h ( a 1 s 0 ) ) | ν n | + b n | μ n | ] p n p n 1 ( 1 a n + 2 a n L h ( a 1 s 0 ) ) p n p + [ ( 1 a n b n + a n ) | ν n | + b n | μ n | ] p n p n 1 ( 1 a n ( 1 2 L h ( a 1 s 0 ) ) ) p n p + ( | ν n | + | μ n | ) p n p n 1 ( 1 a n ( 1 2 L h ( a 1 s 0 ) ) ) p n p + ζ n p n p n 1 .
From ( C 5 ), we know that 2 L h ( a 1 s 0 ) < 1 and hence 1 a n ( 1 2 L h ( a 1 s 0 ) ) < 1 and from Lemma 5, ζ n p n p n 1 0 as n . Hence, from Lemma 1, we conclude that lim n p n = p . □

6. Concluding Remarks

In this paper, new inertial iterative algorithms have been constructed and their convergence analysis is considered in order to approximate solutions of general quasi-variational inequalities. The existence result of vectors satisfying a general quasi-variational inequality is proved and verified by illustrative example. Finally, as an application of the two steps inertial iterative algorithm, we examined a delay differential equation.

Author Contributions

Conceptualization, M.A.; methodology, M.A.; validation, M.D.; formal analysis, M.D.; investigation, M.A. and M.D.; writing—original draft preparation, M.A.; writing—review and editing, M.D. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors thank to the referees for their valuable suggestions and comments which bring the manuscript in the present form. The researchers wish to extend their sincere gratitude to the Deanship of Scientific Research at the Islamic University of Madinah for the support provided to the Post-Publishing Program 1.

Conflicts of Interest

Regarding the publication of this article, no conflicts of interest are reported by the authors.

References

  1. Stampacchia, G. Formes bilineaires coercivites sur les ensembles convexes. Comptes Rendus L’Academie Des Sci. 1964, 258, 4413–4416. [Google Scholar]
  2. Chang, S.S.; Ahmadini, A.A.H.; Salahuddin; Liu, M.; Tang, J. The optimal control problems for generalized elliptic quasi variational inequalities. Symmetry 2022, 14, 199. [Google Scholar] [CrossRef]
  3. Cholamjiak, P.; Suantai, S. Iterative methods for solving equilibrium problems, variational inequalities and fixed points of nonexpansive semigroups. J. Glob. Optim. 2013, 57, 1277–1297. [Google Scholar] [CrossRef]
  4. Dafermos, S.C.; McKelvey, S.C. Partitionable variational inequalities with applications to network and economic equilibria. J. Optim. Theory Appl. 1992, 73, 243–268. [Google Scholar] [CrossRef]
  5. Kan, Z.; Li, F.; Peng, H.; Chen, B.; Song, X.G. Sliding cable modeling: A nonlinear complementarity function based framework. Mech. Syst. Signal Process. 2021, 146, 1–20. [Google Scholar] [CrossRef]
  6. Luo, X.P.; Xiao, Y.B.; Li, W. Strict feasibility of variational inclusion problems in reflexive Banach spaces. J. Ind. Manag. Optim. 2020, 16, 2495–2502. [Google Scholar] [CrossRef]
  7. Noor, M.A.; Noor, K.I.; Rassias, T.M. Iterative methods for variational inequalities. In Differential and Integral Inequalities; Springer: Berlin/Heidelberg, Germany, 2019; pp. 603–618. [Google Scholar]
  8. Song, N.; Peng, H.; Xu, X.; Wang, G. Modeling and simulation of a planar rigid multibody system with multiple revolute clearance joints based on variational inequality. Mech. Mach. Theory 2020, 154, 104053. [Google Scholar] [CrossRef]
  9. Bensoussan, A.; Lions, J.-L. Application des Inequalities Variationnelles en Control Eten Stochastique; Dunod: Paris, France, 1978. [Google Scholar]
  10. Harker, P.T. Generalized Nash games and quasi-variational inequalities. Eur. J. Oper. Res. 1991, 54, 81–94. [Google Scholar] [CrossRef]
  11. Beremlijski, P.; Haslinger, J.; Kocvara, M.; Outrata, J. Shape optimization in contact problems with Coulomb friction. SIAM J. Optim. 2002, 13, 561–587. [Google Scholar] [CrossRef] [Green Version]
  12. Kravchuk, A.S.; Neittaanmäki, P.J. Variational and Quasi-Variational Inequalities in Mechanics, Volume 147 of Solid Mechanics and Its Applications; Springer: Dordrecht, The Netherlands, 2007. [Google Scholar]
  13. Outrata, J.; Kocvara, M.; Zowe, J. Nonsmooth Approach to Optimization Problems with Equilibrium Constraints, Theory, Applications and Numerical Results, Volume 28 of Nonconvex Optimization and Its Applications; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1998. [Google Scholar]
  14. Bliemer, M.C.; Bovy, P.H. Quasi-variational inequality formulation of the multiclass dynamic traffic assignment problem. Transp. Res. Part B 2003, 37, 501–519. [Google Scholar] [CrossRef]
  15. Scrimali, L. Quasi-variational inequalities in transportation networks. Math. Model. Methods Appl. Sci. 2004, 14, 1541–1560. [Google Scholar] [CrossRef]
  16. Hintermüller, M.; Rautenberg, C.N. Parabolic quasi-variational inequalities with gradient-type constraints. SIAM J. Optim. 2013, 23, 2090–2123. [Google Scholar] [CrossRef] [Green Version]
  17. Hintermüller, M.; Rautenberg, C.N. A sequential minimization technique for elliptic quasi-variational inequalities with gradient constraints. SIAM J. Optim. 2012, 22, 1224–1257. [Google Scholar] [CrossRef]
  18. Kunze, M.; Rodrigues, J.F. An elliptic quasi-variational inequality with gradient constraints and some of its applications. Math. Methods Appl. Sci. 2000, 23, 897–908. [Google Scholar] [CrossRef]
  19. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  20. Agarwal, R.P.; Regan, D.O.; Sahu, D.R. Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 2007, 8, 61–79. [Google Scholar]
  21. Akram, M.; Khan, A.; Dilshad, M. Convergence of some iterative algorithms for system of generalized set-valued variational inequalities. J. Funct. Spaces 2021, 2021, 6674349. [Google Scholar] [CrossRef]
  22. Dilshad, M.; Aljohani, A.F.; Akram, M. Iterative scheme for split variational inclusion and a fixed-Point problem of a finite collection of nonexpansive mappings. J. Funct. Spaces 2020, 2020, 3567648. [Google Scholar] [CrossRef]
  23. Fan, J.; Liu, L.; Qin, X. A subgradient extragradient algorithm with inertial effects for solving strongly pseudomonotone variational inequalities. Optimization 2020, 69, 2199–2215. [Google Scholar] [CrossRef]
  24. Gürsoy, F.; Karakaya, V. A Picard-S hybrid type iteration method for solving a differential equation with retarded argument. arXiv 2014, arXiv:1403.2546. [Google Scholar]
  25. Shehu, Y.; Gibali, A. Inertial Krasnoselskii-Mann method in Banach spaces. Mathematics 2020, 8, 638. [Google Scholar] [CrossRef] [Green Version]
  26. Ullah, K.; Arshad, M. Numerical reckoning fixed points for Suzuki’s generalized nonexpansive mappings via new iteration process. Filomat 2018, 32, 187–196. [Google Scholar] [CrossRef] [Green Version]
  27. Zhou, H.; Qin, X. Fixed Points of Nonlinear Operators Iterative Methods; De Gruyter: Berlin, Germany, 2020. [Google Scholar]
  28. Ali, J.; Jubair, M.; Ali, F. Stability and convergence of F iterative scheme with an application to the fractional differetial equation. Eng. Comput. 2020, 38, 693–702. [Google Scholar] [CrossRef]
  29. Guo, Y.; Wang, W. Strong convergence of a relaxed inertial three-operator splitting algorithm for the minimization problem of the sum of three or more functions. J. Nonlinear Funct. Anal. 2021, 41, 1–19. [Google Scholar]
  30. Liu, L.; Cho, S.Y.; Yao, J.C. Convergence analysis of an inertial Tseng’s extragradient algorithm for solving pseudomonotone variational inequalities and applications. J. Nonlinear Var. Anal. 2021, 5, 627–644. [Google Scholar]
  31. Sahu, D.R. Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems. Soft Comput. 2020, 24, 17887–17911. [Google Scholar] [CrossRef]
  32. Wang, Y.; Xu, T.; Yao, J.C.; Jiang, B. Sef-adaptive method and inertial modification for solving the split feasibility problem and fixed point problem of quasi-nonexpansive mapping. Mathematics 2022, 10, 1612. [Google Scholar] [CrossRef]
  33. Polyak, B.T. Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 1964, 4, 1–17. [Google Scholar] [CrossRef]
  34. Alvarez, F. On the minimizing property of a second order dissipative system in Hilbert space. SIAM J. Control Optim. 2000, 38, 1102–1119. [Google Scholar] [CrossRef] [Green Version]
  35. Richardson, L.F. The approximate arithmetical solution by finite differences of physical problems involving differiential equations with an application to the stresses in a masonry dam. Philos. Trans. R. Soc. Lond. 1911, 201, 307–357. [Google Scholar]
  36. Eckstein, J.; Bertsekas, D.P. On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 1992, 55, 293–318. [Google Scholar] [CrossRef] [Green Version]
  37. Alvarez, F. Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert space. SIAM J. Optim. 2004, 14, 773–782. [Google Scholar] [CrossRef]
  38. Maingé, P.E. Convergence theorems for inertial KM-type algorithms. J. Comput. Appl. Math. 2008, 219, 223–236. [Google Scholar] [CrossRef] [Green Version]
  39. Baiocchi, C.; Capelo, A. Variational and Quasi Variational Inequalities: Applications to Free Boundary Problems; Wiley: New York, NY, USA, 1984. [Google Scholar]
  40. Bensoussan, A.; Lions, J. Impulse Control and Quasi-variational Inequalities; Gauthier-Villars: Paris, France, 1984. [Google Scholar]
  41. Kalker, J.J. Contact mechanical algorithms. Commu. Appl. Numer. Meth. 1988, 4, 25–32. [Google Scholar] [CrossRef]
  42. Glowinski, R.; Lions, J.L.; Tremolieres, R. Numerical Analysis of Variational Inequalities; North-Holland Publishing Company: New York, NY, USA, 1981. [Google Scholar]
  43. Noor, M.A. Some developments in general variational inequalities. Appl. Math. Comput. 2004, 152, 199–277. [Google Scholar]
  44. Tonti, E. Variational foraulation of every nonlinear problem. Int. J. Eng. Sci. 1984, 22, 1343–1371. [Google Scholar] [CrossRef]
  45. Noor, M.A. General variational inequalities. Appl. Math. Lett. 1988, 1, 119–122. [Google Scholar] [CrossRef]
  46. Liu, Q. A convergence theorem of the sequence of Ishikawa iterates for quasi-contractive mappings. J. Math. Anal. Appl. 1990, 146, 301–305. [Google Scholar]
  47. Xu, H.K. Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002, 66, 240–256. [Google Scholar] [CrossRef]
  48. Noor, M.A. Implicit dynamical systems and quasi variational inequalities. Appl. Math. Comput. 2003, 110, 463–468. [Google Scholar] [CrossRef]
Table 1. Numerical comparison of iterative Algorithm 2 with inertial and non-inertial terms.
Table 1. Numerical comparison of iterative Algorithm 2 with inertial and non-inertial terms.
No. Iter. x n ( with μ n = n 6 ( n + 2 ) , v n = n 5 ( n + n ) ) x n 2 x n ( with μ n = v n = 0 ) x n 2
   0( 1 2 , 1 6 , 0, 0, …)0.527046268( 1 2 , 1 6 , 0, 0, …)0.52704268
   1(1,  1 3 , 0, 0, …)1.054092481(1,  1 3 , 0, 0, …)1.054092481
   2(0.411111101, 0.114197529, 0, 0, …)0.426676275(0.411111221, 0.114199632, 0, 0, …)0.586937317
   ⋮
   25(1.56798  × 10 11 , 2.80294  × 10 16 , 0, 0, …)3.53429  × 10 12 (9.40659  × 10 11 , 1.99635  × 10 14 , 0, 0, …)9.40267  × 10 11
   ⋮
   110(5.23109  × 10 91 , 6.59583  × 10 118 , 0, 0, …)2.40527  × 10 47 (2.14532  × 10 43 , 1.40867  × 10 57 , 0, 0, …)2.10462  × 10 43
   ⋮
   220(3.1594  × 10 147 , 2.0037  × 10 192 , 0, 0, …)8.19276  × 10 92 (1.08984  × 10 84 , 1.10363  × 10 86 , 0, 0, …)1.09486  × 10 84
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Akram, M.; Dilshad, M. A Unified Inertial Iterative Approach for General Quasi Variational Inequality with Application. Fractal Fract. 2022, 6, 395. https://doi.org/10.3390/fractalfract6070395

AMA Style

Akram M, Dilshad M. A Unified Inertial Iterative Approach for General Quasi Variational Inequality with Application. Fractal and Fractional. 2022; 6(7):395. https://doi.org/10.3390/fractalfract6070395

Chicago/Turabian Style

Akram, Mohammad, and Mohammad Dilshad. 2022. "A Unified Inertial Iterative Approach for General Quasi Variational Inequality with Application" Fractal and Fractional 6, no. 7: 395. https://doi.org/10.3390/fractalfract6070395

Article Metrics

Back to TopTop