Next Article in Journal
A Review of Many-Body Interactions in Linear and Nonlinear Plasmonic Nanohybrids
Next Article in Special Issue
Relaxed Modulus-Based Matrix Splitting Methods for the Linear Complementarity Problem
Previous Article in Journal
Financial Information Asymmetry: Using Deep Learning Algorithms to Predict Financial Distress
Previous Article in Special Issue
Coefficient Bounds for Certain Classes of Analytic Functions Associated with Faber Polynomial
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Convergence Analysis of a Three-Step Iterative Algorithm for Generalized Set-Valued Mixed-Ordered Variational Inclusion Problem

1
Department of Mathematics, Anand International College of Engineering, Jaipur 303012, India
2
Nonlinear Dynamics Research Center (NDRC), Ajman University, Ajman AE 346, United Arab Emirates
3
International Center for Basic and Applied Sciences, Jaipur 302029, India
4
Department of Mathematical Science, College of Sciences, Princess Nourah Bint Abdulrahman University, Riyadh 84428, Saudi Arabia
5
Department of Mathematics, Faculty of Science, Islamic University of Madinah, Madinah 170, Saudi Arabia
6
Department of Mathematics, Faculty of Science, University of Tabuk, Tabuk 71491, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2021, 13(3), 444; https://doi.org/10.3390/sym13030444
Submission received: 9 February 2021 / Revised: 28 February 2021 / Accepted: 2 March 2021 / Published: 9 March 2021
(This article belongs to the Special Issue Advanced Calculus in Problems with Symmetry)

Abstract

:
This manuscript aims to study a generalized, set-valued, mixed-ordered, variational inclusion problem involving H ( · , · ) -compression XOR- α M -non-ordinary difference mapping and relaxed cocoercive mapping in real-ordered Hilbert spaces. The resolvent operator associated with H ( · , · ) -compression XOR- α M -non-ordinary difference mapping is defined, and some of its characteristics are discussed. We prove existence and uniqueness results for the considered generalized, set-valued, mixed-ordered, variational inclusion problem. Further, we put forward a three-step iterative algorithm using a ⊕ operator, and analyze the convergence of the suggested iterative algorithm under some mild assumptions. Finally, we reconfirm the existence and convergence results by an illustrative numerical example.

1. Introduction

The theory of variational inequalities was studied in the early 1960s to solve a problem which appeared in a mechanical system. In 1964, Stampacchia [1] solved the variational inequality problem, where it was found that x ¯ K such that
T ( x ¯ ) , x ˜ x ¯ 0 , for all x ˜ K ,
where K ( ϕ ) is a closed convex subset of a real Hilbert space H and T : H H is a single-valued mapping. The author studied the existence and uniqueness of the solution for this proposed problem. This theory is one of the most powerful tools for studying problems arising in nonlinear analysis, including differential equations, mechanics, control problems, equilibrium problems, transportation, and so forth, which has proven to be quite application-oriented and fruitful.
Since its inception, the variational inequalities are being appealed to investigate problems appearing in miscellaneous areas of basic and applied sciences, such as [2,3,4,5,6,7,8]. These unusual utilizations motivated researchers to drive and expand the variational inequalities and related optimization problems in different format using advanced and innovatory techniques, such as [9,10,11,12,13,14] and the references cited therein. One of the most important generalizations of variational inequality due to Verma [15] is the system of variational inequalities, because a number of equilibrium problems, such as the traffic equilibrium, the spatial equilibrium, the Nash equilibrium, and the general equilibrium programming problems can be designed as a system of variational inequalities. The birth of this theory can be observed as the simultaneous acquirement of two different lines of research—namely, it affirms the qualitative aspects of the solution to important classes of problems, and also empowers us to establish influential and fruitful new techniques for the solving of problems.
In 1994, Hassouni and Moudafi [16] evolved a class of mixed-type variational inequalities with single-valued mappings using the technique of a resolvent operator for monotone mapping, namely- variational inclusion problem. They developed a perturbed algorithm to estimate the solution of mixed variational inequalities. Recently, the fixed-point theory is widely applied to study problems appearing in real ordered Banach spaces, see [17,18,19,20,21]. Li [22] studied the nonlinear ordered variational inequalities and developed an iterative algorithm to estimate its solution in real ordered Banach spaces. In 2012, Li [23] planted a new class of variational inclusions for ( α , λ ) -NODM set-valued mappings in an ordered Hilbert space. Using the technique of resolvent operator, the existence result was proven and the convergence of sequence obtained from iterative algorithm was discussed. In [24], Li et al. investigated the solution of a general nonlinear ordered variational inclusion with ( γ G , λ ) -weak-GRD mappings. Recently, Li et al. [25] presented the convergence of an Ishikawa-type iterative method for the general nonlinear ordered variational inclusion with ( γ G , λ ) -weak-GRD set-valued mappings, and exhibited the stability of the algorithm. Very recently, ordered variational inclusions with XOR operator are considered in diverse direction—see, for example, [26,27].
Following the facts mentioned above and encouraged by recent investigations in this order, we introduce H ( · , · ) -compression XOR- α M -non-ordinary difference mapping. A resolvent operator associated to this mapping is defined, and we discuss some of its characteristics. We examine a generalized, set-valued, mixed-ordered, variational inclusion with H ( · , · ) -compression XOR- α M -non-ordinary difference mapping and relaxed cocoercive mapping in real ordered Hilbert spaces. We validate the existence and uniqueness of the solution for the considered ordered variational inclusion. In addition, we present a three-step iterative algorithm using a ⊕ operator and analyze the convergence of the proposed iterative algorithm under suitable assumptions. At last, a numerical example is given to show that the considered three-step iterative algorithm converges to the unique solution of a generalized, set-valued, mixed-ordered, variational inclusion.

2. Preliminaries and Auxiliary Results

We remind some necessary definitions, notions, and auxiliary results which are constructive tools and will be used throughout this paper.
Let H p be a real Hilbert space equipped with the norm | | · | | , and inner product · , · where d is the metric induced by the norm | | · | | . Let C be a normal cone in H p with normal constant λ C , and “≤” denotes the partial ordering defined by C . The Hilbert space H p equipped with partial ordering ≤ defined by C is called an ordered Hilbert space. Let C B ( H p ) (respectively, 2 H p ) be the family of all non-empty closed and bounded subsets (respectively, all non-empty subsets) of H p . For any arbitrary μ , ν H p , glb { μ , ν } and lub { μ , ν } represent the greatest lower bound and least upper bound, respectively, for the set { μ , ν } with partial ordering ≤. The operators , , , and ⊙ are called AND, OR, XOR, and XNOR operators, respectively, and defined as follows:
(i)
μ ν = inf { μ , ν } ,
(ii)
μ ν = sup { μ , ν } ,
(iii)
μ ν = ( μ ν ) ( ν μ ) ,
(iv)
μ ν = ( μ ν ) ( ν μ ) .
Throughout this paper, unless otherwise stated, we denote positive, real ordered Hilbert space by H p .
Definition 1
([28]). A non-empty closed convex subset C of H p is called a cone:
(i) 
If μ C and λ > 0 , then λ μ C ;
(ii) 
If μ C and μ C , then μ = 0 .
Definition 2
([28,29]). Let C be a cone. Then,
(i) 
C is called a normal cone if there exists a normal constant λ C > 0 such that 0 μ ν implies | | μ | | λ C | | ν | | , for all μ , ν H p ;
(ii) 
For arbitrary elements μ , ν H p , μ ν if, and only if μ ν C ;
(iii) 
μ and ν are said to be comparable to each other if, and only if μ ν or ν μ exists, and we denote it by μ ν .
Proposition 1
([29]). Let C be a normal cone with normal constant λ C in H p . Then, for each μ , ν H p , the following relations hold:
(i) 
| | 0 0 | | = | | 0 | | = 0 ;
(ii) 
| | μ ν | | | | μ | | | | ν | | | | μ | | + | | ν | | ;
(iii) 
| | μ ν | | | | μ ν | | λ C | | μ ν | | ;
(iv) 
If μ ν , then | | μ ν | | = | | μ ν | | .
Lemma 1
([30]). Let { ω n } be a nonnegative real sequence satisfying the following inequality
ω n + 1 ( 1 ϑ n ) ω n + ε n , n n 0 ,
where ϑ n [ 0 , 1 ] , n = 0 ϑ n = and ε n = o ( ϑ n ) . Then, lim n ω n = 0 .
Definition 3
([31]). A mapping T : H p H p is said to be relaxed ( μ , γ ) -cocoercive if there exist constants μ , γ > 0 such that
T x T y , x y ( μ ) | | T x T y | | 2 + γ | | x y | | 2 , for all x , y H p .
Remark 1.
Every γ strongly monotone mapping is relaxed ( μ , γ ) -cocoercive mapping, and every γ-cocoercive mapping is 1 γ -Lipschitz-continuous.
Proposition 2
([23,29]). Let C be a cone in H p with partial ordering ≤ induced by C . Let ⊕ be an X O R operation and ⊙ be an X N O R operation. Then, for any ϑ , υ , μ , ν , ω H p , the following relations hold:
(i) 
μ μ = 0 , μ ν = ν μ = ( μ ν ) = ( ν μ ) ;
(ii) 
If μ 0 , then μ 0 μ μ 0 ;
(iii) 
0 μ ν if μ ν ;
(iv) 
( ρ μ ) ( ρ ν ) = | ρ | ( μ ν ) , for any real ρ;
(v) 
If μ ν , then μ ν = 0 if, and only if μ = ν ;
(vi) 
( ϑ + υ ) ( μ + ν ) ( ϑ μ ) + ( υ ν ) ;
(vii) 
( ϑ + υ ) ( μ + ν ) ( ϑ ν ) + ( υ μ ) ;
(viii) 
If μ , ν , ω are comparable to each other, then ( μ ν ) ( μ ω ) + ( ω ν ) ;
(ix) 
α ϑ β ϑ = | α β | ϑ = ( α β ) ϑ if ϑ 0 , for any real α , β .
Definition 4
([22,23]). A single-valued mapping A : H p H p is said to be:
(i) 
Comparison mapping if μ ν for any μ , ν H p , then A ( μ ) A ( ν ) , μ A ( μ ) , ν A ( ν ) ;
(ii) 
strong comparison mapping if A is comparison mapping and A ( μ ) A ( ν ) if, and only if μ ν , for any μ , ν H p ;
(iii) 
π-ordered compression mapping if A is a comparison mapping and if there exists a constant π ( 0 , 1 ) such that
A ( μ ) A ( ν ) π ( μ ν ) , for all μ , ν H p .
Definition 5
([26]). Let A , B : H p H p be the single-valued mappings. Then, the single-valued mapping H : H p × H p H p is called
(i) 
π 1 -ordered compression mapping with respect to A if there exists a constant π 1 ( 0 , 1 ) such that
H ( A ( μ ) , · ) H ( A ( ν ) , · ) π 1 ( μ ν ) , for all μ , ν H p ;
(ii) 
π 2 -ordered compression mapping with respect to B if there exists a constant π 2 ( 0 , 1 ) such that
H ( · , B ( μ ) ) H ( · , B ( ν ) ) π 2 ( μ ν ) , for all μ , ν H p ;
(iii) 
Mixed comparison mapping with respect to A and B if for all μ , ν H p , μ ν then H ( A ( μ ) , B ( μ ) ) H ( A ( ν ) , B ( ν ) ) , μ H ( A ( μ ) , B ( μ ) ) and ν H ( A ( ν ) , B ( ν ) ) ;
(iv) 
Mixed strong comparison mapping with respect to A and B if, for all μ , ν H p , H ( A ( μ ) , B ( μ ) ) H ( A ( ν ) , B ( ν ) ) if, and only if μ ν , for all μ , ν H p .
Definition 6
([26]). Let A , B , F , G : H p H p and H : H p × H p H p be the single-valued mappings. Then,
(i) 
H ( A , · ) is said to be β 1 -ordered compression mapping with respect to F and G if there exists a constant β 1 ( 0 , 1 ) such that
H ( A ( μ ) , B ( μ ) ) H ( A ( ν ) , B ( μ ) ) , ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) β 1 | | ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) | | 2 , for all μ , ν H p ;
(ii) 
H ( · , B ) is called β 2 -ordered compression mapping with respect to F and G if there exists a constant β 2 ( 0 , 1 ) such that
H ( A ( μ ) , B ( μ ) ) H ( A ( μ ) , B ( ν ) ) , ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) β 2 | | ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) | | 2 , for all μ , ν H p .
Definition 7
([23]). Let A : H p H p ; T : H p × H p H p be the single-valued mappings and P : H p C B ( H p ) be a set-valued mapping. Then,
(i) 
A is called Lipschitz-continuous if for any μ , ν H p and μ ν , there exists a constant δ A > 0 such that
| | A ( μ ) A ( ν ) | | δ A | | μ ν | | ;
(ii) 
P is called D -Lipschitz-continuous if for any μ , ν H p and μ ν , there exists a constant ζ P > 0 such that
D ( P ( μ ) , P ( ν ) ) ζ P | | μ ν | | ;
(iii) 
T is scalled Lipschitz-continuous in the first argument if, for any μ , ν H p and μ ν , there exists a constant δ T 1 > 0 such that
| | T ( μ , · ) T ( ν , · ) | | δ T 1 | | μ ν | | .
In the same fashion, the Lipschitz continuity of T can be defined in the second argument.
Definition 8
([18,23]). Let F , G : H p H p be the single-valued mappings and M : H p × H p 2 H p be a set-valued mapping. Then,
(i) 
M is called a comparison mapping with respect to F and G if, for any p μ M ( F ( μ ) , G ( μ ) ) , μ p μ and if μ ν , then for any p μ M ( F ( μ ) , G ( μ ) ) and p ν M ( F ( ν ) , G ( ν ) ) , p μ p ν , for all μ , ν H p ;
(ii) 
A comparison mapping M is called an XOR- α M -non-ordinary difference mapping with respect to A and B if there exists a constant α M > 0 , for each μ , ν H p there exist p μ M ( F ( μ ) , G ( μ ) ) and p ν M ( F ( ν ) , G ( ν ) ) such that
( p μ p ν ) α M ( H ( A ( μ ) , B ( μ ) ) H ( A ( ν ) , B ( ν ) ) ) = 0 ;
(iii) 
a comparison mapping M is called ϑ M -ordered rectangular with respect to F and G if there exists a constant ϑ M > 0 , for each μ , ν H p there exist p μ M ( F ( μ ) , G ( μ ) ) and p ν M ( F ( ν ) , G ( ν ) ) such that
p μ p ν , [ ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) ] ϑ M | | ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) | | 2 , for all μ , ν H p ;
(iv) 
A comparison mapping M is called ϱ- X O R -ordered strongly monotone mapping with respect to F and G if for any μ , ν H p , p μ M ( F ( μ ) , G ( μ ) ) and p ν M ( F ( ν ) , G ( ν ) ) there exists a constant ϱ > 0
ϱ ( p μ p ν ) [ ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) ] .
Definition 9.
Let A , B , F , G : H p H p and H : H p × H p H p be the single-valued mappings. The set-valued mapping M : H p × H p 2 H p is said to be H ( · , · ) -compression XOR- α M -non-ordinary difference mapping, if H is π 1 and π 2 -ordered compression mapping with respect to A and B , respectively, and M is XOR- α M -non-ordinary difference mapping with respect to A and B such that
[ H ( A , B ) ρ M ( F , G ) ] ( H p ) = H p , for every ρ , α M > 0 and 0 < π 1 , π 2 < 1 .
Definition 10.
Let A , B , F , G : H p H p and H : H p × H p H p be the single-valued mappings. Let M : H p × H p 2 H p be a set-valued H ( · , · ) -compression XOR- α M -non-ordinary difference mapping. The resolvent operator R ρ , M ( F , G ) H ( A , B ) : H p H p associated with A , B , F and G is defined by
R ρ , M ( F , G ) H ( A , B ) ( μ ) = [ H ( A , B ) ρ M ( F , G ) ] 1 ( μ ) , for all μ H p , ρ , α M > 0 .
Lemma 2.
Let A , B , F , G : H p H p be the single-valued mappings such that F and G are one–one mappings; H : H p × H p H p be a single-valued mapping such that H ( A , · ) is β 1 and H ( · , B ) is β 2 -ordered compression mapping with respect to F and G . Let M : H p × H p 2 H p be a set-valued θ M -ordered rectangular mapping with respect to F and G such that ρ θ M > β 1 + β 2 and ( μ ν ) 0 . Then the resolvent operator R ρ , M ( F , G ) H ( A , B ) : H p H p associated with A , B , F and G is a single-valued mapping.
Proof. 
For any given ω H p , μ ν and ρ > 0 , let μ , ν [ H ( A , B ) ρ M ( F , G ) ] 1 ( ω ) . Then, we have
p μ = 1 ρ [ ω H ( A ( μ ) , B ( μ ) ) ] M ( F ( μ ) , G ( μ ) ) ,
and
p ν = 1 ρ [ ω H ( A ( ν ) , B ( ν ) ) ] M ( F ( ν ) , G ( ν ) ) .
By utilizing (i) and (ii) of Proposition 2, we have
p μ p ν = 1 ρ [ ω H ( A ( μ ) , B ( μ ) ) ] 1 ρ [ ω H ( A ( ν ) , B ( ν ) ) ] = 1 ρ [ ( ω H ( A ( μ ) , B ( μ ) ) ) ( ω H ( A ( ν ) , B ( ν ) ) ) ] = 1 ρ [ ( ω ω ) ( H ( A ( μ ) , B ( μ ) ) H ( A ( ν ) , B ( ν ) ) ) ] = 1 ρ [ 0 ( H ( A ( μ ) , B ( μ ) ) H ( A ( ν ) , B ( ν ) ) ) ] 1 ρ [ H ( A ( μ ) , B ( μ ) ) H ( A ( ν ) , B ( ν ) ) ] .
Since M is θ M -ordered rectangular mapping with respect to F and G , H ( A , · ) is β 1 and H ( · , B ) is β 2 -ordered compression mapping with respect to F and G . Therefore,
θ M | | ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) | | 2 p μ p ν , ( ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) ) 1 ρ ( H ( A ( μ ) , B ( μ ) ) H ( A ( ν ) , B ( ν ) ) , ( ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) ) = 1 ρ ( H ( A ( μ ) , B ( μ ) ) H ( A ( ν ) , B ( μ ) ) , ( ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) ) + 1 ρ ( H ( A ( ν ) , B ( μ ) ) H ( A ( ν ) , B ( ν ) ) , ( ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) ) β 1 ρ | | ( F ( μ ) , G ( ν ) ) ( F ( ν ) , G ( ν ) ) | | 2 + β 2 ρ | | ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) | | 2 = β 1 + β 2 ρ | | ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) | | 2 ,
which implies that
θ M β 1 + β 2 ρ | | ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) | | 2 0 .
Since ρ θ M > β 1 + β 2 , therefore, | | ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) | | = 0 . Thus, we have
( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) = 0 ,
which in turn becomes
( F ( μ ) , G ( μ ) ) = ( F ( ν ) , G ( ν ) ) .
That is, F ( μ ) = F ( ν ) and G ( μ ) = G ( ν ) . Since the mappings F and G are one–one, therefore, μ = ν . Hence, R ρ , M ( F , G ) H ( A , B ) associated with A , B , F and G is single-valued. □
Lemma 3.
Let A , B , F , G : H p H p and H : H p × H p H p be the single-valued mappings such that H ( · , · ) is a mixed strong comparison mapping with respect to A and B . Let M : H p × H p 2 H p be a set-valued ρ-XOR-ordered strongly monotone mapping with respect to F and G and assume that ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) μ ν . Then, the resolvent operator R ρ , M ( F , G ) H ( A , B ) : H p H p associated with A , B , F and G is a comparison mapping.
Proof. 
For any given μ , ν H p , suppose μ ν ,
p μ = 1 ρ [ μ H ( A ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) ) ] M ( F ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) , G ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) ) ,
and
p ν = 1 ρ [ ν H ( A ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) ) ] M ( F ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) , G ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) ) .
For the sake of simplicity, we take
κ ( μ ) = R ρ , M ( F , G ) H ( A , B ) ( μ ) and κ ( ν ) = R ρ , M ( F , G ) H ( A , B ) ( ν ) .
Since M is a ρ -XOR-ordered strongly monotone mapping with respect to F and G , and using (5) and (6), we have
( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) ρ ( p μ p ν ) = [ μ H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) ) ] [ ν H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) ] = ( μ ν ) [ H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) ) H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) ] .
Thus, we have
0 [ ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) ( μ ν ) ] [ H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) ) H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) ] .
Since ( F ( μ ) , G ( μ ) ) ( F ( ν ) , G ( ν ) ) μ ν , therefore
0 [ ( μ ν ) ( μ ν ) ] [ H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) ) H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) ] ,
which implies that
0 [ H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) ) H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) ] .
The above inequality gives
0 [ H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) ) H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) ] [ H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) ) ] .
Thus, we have
either 0 [ H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) ) H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) ]
or 0 [ H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) ) ] .
That is,
H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) )
or H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) ) H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) .
It follows from (7) and (8) that
H ( A ( κ ( μ ) ) , B ( κ ( μ ) ) ) H ( A ( κ ( ν ) ) , B ( κ ( ν ) ) ) .
That is,
H ( A ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) ) H ( A ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) ) .
Since H is a mixed strong comparison mapping with respect to A and B , then we have R ρ , M ( F , G ) H ( A , B ) ( μ ) R ρ , M ( F , G ) H ( A , B ) ( ν ) , that is, R ρ , M ( F , G ) H ( A , B ) is a comparison mapping. □
Lemma 4.
Let A , B , F , G : H p H p and H : H p × H p H p be the single-valued mappings. Let M : H p × H p 2 H p be a set-valued H ( · , · ) -compression XOR- α M -non-ordinary difference mapping, α M > 0 . Assume that [ H ( A ( ϵ ) , B ( ϵ ) ) H ( A ( ω ) , B ( ω ) ) ] ϵ ω , for all ϵ , ω H p . Then the resolvent operator R ρ , M ( F , G ) H ( A , B ) : H p H p is 1 1 + ρ α M -Lipschitz-continuous—that is,
| | R ρ , M ( F , G ) H ( A , B ) ( μ ) R ρ , M ( F , G ) H ( A , B ) ( ν ) | | 1 1 + ρ α M | | μ ν | | , for all μ , ν H p .
Proof. 
Let p μ and p ν assume the same values as in (5) and (6), respectively. Then,
p μ p ν = 1 ρ [ μ H ( A ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) ) ] 1 ρ [ ν H ( A ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) ) ] 1 ρ [ ( μ ν ) [ H ( A ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) ) H ( A ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) ) ] ] .
Since M is XOR- α M -non-ordinary difference mapping with respect to A and B , we have
α M [ H ( A ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) ) H ( A ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) ) ] = p μ p ν ,
which implies that
α M [ H ( A ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) ) H ( A ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) ) ] 1 ρ [ ( μ ν ) [ H ( A ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) ) H ( A ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) ) ] ] .
Thus, we have
[ 1 + ρ α M ] [ H ( A ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) ) H ( A ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) ) ] ( μ ν ) .
It follows from the assumption that
[ H ( A ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( μ ) ) ) H ( A ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) , B ( R ρ , M ( F , G ) H ( A , B ) ( ν ) ) ) ] R ρ , M ( F , G ) H ( A , B ) ( μ ) R ρ , M ( F , G ) H ( A , B ) ( ν ) ,
which gives us
[ 1 + ρ α M ] [ R ρ , M ( F , G ) H ( A , B ) ( μ ) R ρ , M ( F , G ) H ( A , B ) ( ν ) ] ( μ ν ) .
That is, R ρ , M ( F , G ) H ( A , B ) ( μ ) R ρ , M ( F , G ) H ( A , B ) ( ν ) 1 1 + ρ α M ( μ ν ) . Thus, we have
| | R ρ , M ( F , G ) H ( A , B ) ( μ ) R ρ , M ( F , G ) H ( A , B ) ( ν ) | | 1 1 + ρ α M | | μ ν | | ,
i . e . , R ρ , M ( F , G ) H ( A , B ) is 1 1 + ρ α M -Lipschitz-continuous. □

3. Formulation of the Problem and Existence Result

This section begins with the designing of a generalized ordered variational inclusion problem involving H ( · , · ) -compression XOR- α M -non-ordinary difference mapping and relaxed cocoercive mapping. We discuss the existence of a unique solution for the considered problem.
Let H p be a real ordered Hilbert space and C be a normal cone with normal constant λ C . Let A , B , F , G , P , S : H p H p and H , φ : H p × H p H p be the single-valued mappings. Let R , T : H p C B ( H p ) be the set-valued mappings and M : H p × H p 2 H p be a set-valued H ( · , · ) -compression XOR- α M -non-ordinary difference mapping. We deal with the following generalized ordered variational inclusion problem:
For some a H p and any b R , find x H p , μ R ( x ) , ν T ( x ) such that
a P ( μ ) τ M ( F ( x ) , G ( x ) ) b φ ( x S x , ν ) ,
where τ > 0 is a constant. Problem (10) is termed as generalized, set-valued, mixed-ordered, variational inclusion problem with XOR-operator (in short, GSMOVIP).
Note that GSMOVIP (10) is more general, and for appropriate selection of the mappings comprised in the designing, it includes many problems existing in the literature. Some particular cases of GSMOVIP (10) are reported below:
(i)
If F = I , the identity mapping, G , S = 0 , M ( F ( x ) , G ( x ) ) = M ( x ) and R , T are the single-valued mappings, and then GSMOVIP (10) becomes an equivalent problem of finding x H p , for some a H p and any b R such that
a P ( x ) τ M ( x ) b φ ( x , g ( x ) ) .
Problem (11) was constructed and examined by Ahmad et al. [27], using ( γ R , λ ) -weak-RRD mappings.
(ii)
If τ = 1 and φ ( · , · ) = 0 , then problem (11) coincides with the problem of finding x H p such that
a P ( x ) M ( x ) .
Problem (12) was investigated by Li et al. [18] in the framework of weak-ANODD set-valued mappings.
(iii)
If a = 0 and P = 0 , then problem (11) coincides to the problem of finding x H p such that
0 τ M ( x ) b φ ( x , g ( x ) ) .
Problem (13) was examined by Li et al. [25].
(iv)
If φ ( · , · ) = 0 and P = 0 , then problem (11) becomes an equivalent problem of finding x H p such that
a τ M ( x ) .
Problem (14) was investigated by Li et al. [24] in the framework of ( γ G , λ ) -weak-RRD mappings.
In the following Lemma, we set up an equivalence between ordered fixed-point problem and GSMOVIP (10).
Lemma 5.
Let C be a normal cone with normal constant λ C in H p . Let A , B , F , G , P , S : H p H p and H , φ : H p × H p H p be the single-valued mappings. Let R , T : H p C B ( H p ) be the set-valued mappings, and M : H p × H p 2 H p be a set-valued H ( · , · ) -compression XOR- α M -non-ordinary difference mapping. Then, ( x , μ , ν ) , x H p , μ R ( x ) , ν T ( x ) solves GSMOVIP (10), if and only if
x = R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] . ( )
Proof. 
The proof of the lemma follows immediately by using the definition of a resolvent operator, so we omit the proof. □
Theorem 1.
Let C be a normal cone in H p with normal constant λ C . Let A , B , F , G , P , S : H p H p and H , φ : H p × H p H p be the single-valued mappings such that P is a δ P -Lipschitz-continuous mapping; S is δ S -Lipschitz-continuous and relaxed ( α S , k S ) -cocoercive; H ( · , · ) is π 1 -ordered compression mapping with respect to A in the first argument and π 2 -ordered compression mapping with respect to B in the second argument, and φ ( · , · ) is δ φ 1 and δ φ 2 -Lipschitz-continuous mapping with respect to the first and second argument, respectively. Let R , T : H p C B ( H p ) be D -Lipschitz-continuous mappings with constant ζ R , ζ T , respectively, and M : H p × H p 2 H p be a set-valued H ( · , · ) -compression XOR- α M -non-ordinary difference mapping. If x 1 x 2 and the following condition is satisfied:
( π 1 + π 2 ) τ + ρ λ C [ δ P ζ R | b | ( δ φ 1 ( 1 2 k S ) + ( 1 + 2 α S ) δ S δ φ 2 ζ T ) ] < 1 ; ρ , α M > 0 .
Then, GSMOVIP (10) admits a unique solution.
Proof. 
For the sake of convenience, we assume Q ( x i ) = P ( μ i ) b φ ( x i S x i , ν i ) + a , for i = 1 , 2 . It follows from Lemma 4 and Proposition 2 that
| | ( R ρ , M ( F , G ) H ( A , B ) [ H ( A , B ) + ρ τ Q ] ) ( x 1 ) R ρ , M ( F , G ) H ( A , B ) [ H ( A , B ) + ρ τ Q ] ( x 2 ) | | 1 1 + ρ α M | | [ H ( A ( x 1 ) , B ( x 1 ) ) + ρ τ Q ( x 1 ) ] [ H ( A ( x 2 ) , B ( x 2 ) ) + ρ τ Q ( x 2 ) ] | | 1 1 + ρ α M | | H ( A ( x 1 ) , B ( x 1 ) ) H ( A ( x 2 ) , B ( x 2 ) ) | | + ρ τ | | Q ( x 1 ) Q ( x 2 ) | | .
Since H ( · , · ) is π 1 -ordered compression mapping with respect to A in the first argument and π 2 -ordered compression mapping with respect to B in the second argument,
| | H ( A ( x 1 ) , B ( x 1 ) ) H ( A ( x 2 ) , B ( x 2 ) ) | | ( π 1 + π 2 ) | | x 1 x 2 | | .
Since P is δ P -Lipschitz-continuous mapping and R is D -Lipschitz-continuous mapping with constant ζ R , then we have
0 Q ( x 1 ) Q ( x 2 ) = [ P ( μ 1 ) b φ ( x 1 S x 1 , ν 1 ) + a ] [ P ( μ 2 ) b φ ( x 2 S x 2 , ν 2 ) + a ] = [ ( P ( μ 1 ) P ( μ 2 ) ) ( ( b φ ( x 1 S x 1 , ν 1 ) + a ) ( b φ ( x 2 S x 2 , ν 2 ) + a ) ) ] δ P ( μ 1 μ 2 ) | b | ( φ ( x 1 S x 1 , ν 1 ) φ ( x 2 S x 2 , ν 2 ) ) + ( a a ) δ P ζ R ( x 1 x 2 ) | b | ( φ ( x 1 S x 1 , ν 1 ) φ ( x 2 S x 2 , ν 2 ) ) .
Thus, from the definition of a normal cone, utilizing the Lipschitz continuity of φ in the first and second argument and the D -Lipschitz continuity of T , we can write
| | Q ( x 1 ) Q ( x 2 ) | | λ C δ P ζ R | | x 1 x 2 | | λ C | b | | | φ ( x 1 S x 1 , ν 1 ) φ ( x 2 S x 2 , ν 2 ) | | λ C δ P ζ R | | x 1 x 2 | | λ C | b | | | φ ( x 1 S x 1 , ν 1 ) φ ( x 2 S x 2 , ν 1 ) | | λ C | b | | | φ ( x 2 S x 2 , ν 1 ) φ ( x 2 S x 2 , ν 2 ) | | λ C δ P ζ R | | x 1 x 2 | | λ C | b | δ φ 1 | | ( x 1 S x 1 ) ( x 2 S x 2 ) | | λ C | b | δ φ 2 | | ν 1 ν 2 | | λ C δ P ζ R | | x 1 x 2 | | λ C | b | δ φ 1 | | ( x 1 x 2 ) ( S x 1 S x 2 ) | | λ C | b | δ φ 2 ζ T | | x 1 x 2 | | .
Since S is δ S -Lipschitz-continuous and relaxed ( α S , k S ) -cocoercive mapping, therefore
| | ( x 1 x 2 ) ( S x 1 S x 2 ) | | 2 = | | x 1 x 2 | | 2 2 S x 1 S x 2 , x 1 x 2 + | | S x 1 S x 2 | | 2 | | x 1 x 2 | | 2 + 2 α S | | S x 1 S x 2 | | 2 2 k S | | x 1 x 2 | | 2 + | | S x 1 S x 2 | | 2 [ ( 1 2 k S ) + ( 1 + 2 α S ) δ S ] | | x 1 x 2 | | 2 ,
which inferred that
| | ( x 1 x 2 ) ( S x 1 S x 2 ) | | ( 1 2 k S ) + ( 1 + 2 α S ) δ S | | x 1 x 2 | | = λ C ( 1 2 k S ) + ( 1 + 2 α S ) δ S | | x 1 x 2 | | .
Utilizing (17)–(20), (16) becomes
| | ( R ρ , M ( F , G ) H ( A , B ) [ H ( A , B ) + ρ τ Q ] ) ( x 1 ) R ρ , M ( F , G ) H ( A , B ) [ H ( A , B ) + ρ τ Q ] ( x 2 ) | | 1 1 + ρ α M [ ( π 1 + π 2 ) + ρ τ [ λ C δ P ζ R λ C | b | δ φ 1 ( 1 2 k S ) + ( 1 + 2 α S ) δ S λ C | b | δ φ 2 ζ T ] ] | | x 1 x 2 | | = 1 τ ( 1 + ρ α M ) [ ( π 1 + π 2 ) τ + ρ [ λ C δ P ζ R λ C | b | δ φ 1 ( 1 2 k S ) + ( 1 + 2 α S ) δ S λ C | b | δ φ 2 ζ T ] ] | | x 1 x 2 | | ,
which implies that
| | R ρ , M ( F , G ) H ( A , B ) [ H ( A , B ) + ρ τ Q ] ( x 1 ) R ρ , M ( F , G ) H ( A , B ) [ H ( A , B ) + ρ τ Q ] ( x 2 ) | | Θ | | x 1 x 2 | | ,
where
Θ = ( π 1 + π 2 ) τ + ρ λ C [ δ P ζ R | b | ( δ φ 1 ( 1 2 k S ) + ( 1 + 2 α S ) δ S δ φ 2 ζ T ) ] τ ( 1 + ρ α M ) .
From condition (15), we deduce that Θ < 1 . Thus, from (21), we can see that the mapping R ρ , M ( F , G ) H ( A , B ) [ H ( A , B ) + ρ τ Q ] is contraction. There exists a unique point x H p such that
x = R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] .
Thus, from Lemma 5, one can conclude that ( x , μ , ν ) , x H p , μ R ( x ) , ν T ( x ) is the unique solution of GSMOVIP (10). □

4. Convergence Analysis

This section begins with the construction of a three-step iterative algorithm. Finally, the convergence analysis of the proposed iterative algorithm to the unique solution of GSMOVIP (10) is discussed.
Theorem 2.
Let C be a normal cone in H p with normal constant λ C . Let the mappings A , B , F , G , P , S , H , φ , R , T be identical as in Theorem 1, such that all the suppositions of Theorem 1 are satisfied. Let M : H p × H p 2 H p be a set-valued H ( · , · ) -compression XOR- α M -non-ordinary difference mapping. If x n + 1 x and the following condition holds:
( π 1 + π 2 ) τ + ρ λ C [ δ P ζ R | b | ( δ φ 1 ( 1 2 k S ) + ( 1 + 2 α S ) δ S δ φ 2 ζ T ) ] < 1 ; ρ , α M > 0 .
Then, the approximate sequences { x n } , { μ n } and { ν n } generated by Algorithm 1 converge strongly to the unique solution x, μ, and ν, respectively, of GSMOVIP (10).
Algorithm 1 Let C be a normal cone with normal constant λ C in H p . Let A , B , F , G , P , S : H p H p and H , φ : H p × H p H p be the single-valued mappings.
  Let R , T : H p C B ( H p ) be the set-valued mappings and M : H p × H p 2 H p be a set-valued H ( · , · ) -compression XOR- α M -non-ordinary difference mapping. For any initial guesses x 0 H p , μ 0 R ( x 0 ) , ν 0 T ( x 0 ) , compute the sequences { x n } , { μ n } , { ν n } by the following iterative scheme:
z n = ( 1 c n ) x n + c n [ R ρ , M ( F , G ) H ( A , B ) [ H ( A x n , B x n ) + ρ τ ( P ( μ n ) b φ ( x n S x n , ν n ) ) + a ] , y n = ( 1 b n ) x n + b n [ R ρ , M ( F , G ) H ( A , B ) [ H ( A z n , B z n ) + ρ τ ( P ( μ n ) b φ ( z n S z n , ν n ) ) + a ] , x n + 1 = ( 1 a n ) x n + a n [ R ρ , M ( F , G ) H ( A , B ) [ H ( A y n , B y n ) + ρ τ ( P ( μ n ) b φ ( y n S y n , ν n ) ) + a ] , μ n + 1 R ( x n + 1 ) : | | μ n + 1 μ n | | D ( R ( x n + 1 ) , R ( x n ) ) , ν n + 1 T ( x n + 1 ) : | | ν n + 1 ν n | | D ( T ( x n + 1 ) , T ( x n ) ) ,
where μ n R ( x n ) , μ n R ( y n ) , μ n R ( z n ) , ν n T ( x n ) , ν n T ( y n ) , ν n T ( z n ) and 0 a n , b n , c n 1 satisfying n = 0 a n = , for all n = 0 , 1 , 2 , . Stop the iteration if the sequences { x n } , { μ n } and { ν n } satisfy the fixed-point problem ( ) , otherwise continue.
Proof. 
Assume that x H p is a solution of GSMOVIP (10). Then, from Theorem 1, we have
x = ( 1 a n ) x + a n R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] = ( 1 b n ) x + b n R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] = ( 1 c n ) x + c n R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] .
From Algorithm 1, (22), (24), Lemma 4, and Proposition 2, it follows that
0 x n + 1 x = ( 1 a n ) x n + a n R ρ , M ( F , G ) H ( A , B ) [ H ( A y n , B y n ) + ρ τ ( P ( μ n ) b φ ( y n S y n , ν n ) ) + a ] ( 1 a n ) x + a n R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] ( 1 a n ) ( x n x ) + a n ( R ρ , M ( F , G ) H ( A , B ) [ H ( A y n , B y n ) + ρ τ ( P ( μ n ) b φ ( y n S y n , ν n ) ) + a ] R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] ) ( 1 a n ) ( x n x ) + Θ a n ( y n x ) .
Again, using the similar arguments, we estimate
0 y n x = ( 1 b n ) x n + b n R ρ , M ( F , G ) H ( A , B ) [ H ( A z n , B z n ) + ρ τ ( P ( μ n ) b φ ( z n S z n , ν n ) ) + a ] ( 1 b n ) x + b n R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] ( 1 b n ) ( x n x ) + b n ( R ρ , M ( F , G ) H ( A , B ) [ H ( A z n , B z n ) + ρ τ ( P ( μ n ) b φ ( z n S z n , ν n ) ) + a ] R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] ) ( 1 b n ) ( x n x ) + Θ b n ( z n x ) .
Again, using the same facts as mentioned above, we have
0 z n x = ( 1 c n ) x n + c n R ρ , M ( F , G ) H ( A , B ) [ H ( A x n , B x n ) + ρ τ ( P ( μ n ) b φ ( x n S x n , ν n ) ) + a ] ( 1 c n ) x + c n R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] ( 1 c n ) ( x n x ) + c n ( R ρ , M ( F , G ) H ( A , B ) [ H ( A x n , B x n ) + ρ τ ( P ( μ n ) b φ ( x n S x n , ν n ) ) + a ] R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] ) ( 1 c n ) ( x n x ) + Θ c n ( x n x ) .
It follows from (25)–(27) that
0 x n + 1 x ( 1 a n ) ( x n x ) + Θ a n [ ( 1 b n ) ( x n x ) + Θ b n ( ( 1 c n ) ( x n x ) + Θ c n ( x n x ) ) ] ( 1 a n ( 1 Θ ) ) ( x n x ) .
Utilizing the definition of normal cone and applying Proposition 1, we acquire
| | x n + 1 x | | ( 1 a n ( 1 Θ ) ) | | x n x | | .
Setting ω n = | | x n x | | , ϑ n = a n ( 1 Θ ) , we get
ω n + 1 ( 1 ϑ n ) ω n .
Thus, from Lemma 1 and (30), we get ω n 0 as n . Hence, x n x as n . It follows from the Algorithm 1 that
| | μ n + 1 μ | | D ( R ( x n + 1 ) , R ( x ) ) ζ R | | x n + 1 x | | ;
| | ν n + 1 ν | | D ( T ( x n + 1 ) , T ( x ) ) ζ T | | x n + 1 x | | .
From (31) and (32), one can see that { μ n } and { ν n } are Cauchy sequences in H p . Therefore, there exist μ , ν H p such that μ n μ and ν n ν , strongly for sufficiently large n. Next, we show that μ R ( x ) and ν T ( x ) . Since μ n R ( x n ) , then we have
d ( μ , R ( x ) ) | | μ μ n | | + d ( μ n , R ( x ) ) | | μ μ n | | + D ( R ( x n ) , R ( x ) ) | | μ μ n | | + ζ R | | x n x | | 0 , as n .
Hence, d ( μ , R ( x ) ) 0 , and therefore μ R ( x ) as R ( x ) C B ( H p ) . In a similar fashion, we can show that ν T ( x ) . Therefore, by Lemma 5, one can come to an conclusion that { ( x n , μ n , ν n ) } converges strongly to the unique solution ( x , μ , ν ) of GSMOVIP (10). □

5. Numerical Example

Example 1.
Let H p = ( , ) with the usual inner product and norm, and let C = [ 0 , 1 ] be a normal cone with normal constant λ C = 1 . Let A , B , F , G , P , S : H p H p be the single-valued mappings defined by
A ( x ) = x 2 , B ( x ) = x 3 , F ( x ) = 2 x 3 , G ( x ) = 2 x 3 , P ( x ) = x 2 , S ( x ) = x 4 , for all x H p .
Now, for each x , y H p , x y . Then, we can easily verify that P is 2 3 -Lipschitz-continuous, S is 1 3 -Lipschitz-continuous and relaxed ( 1 , 1 4 ) -cocoerecive.
Let H , φ : H p × H p H p be the single-valued mappings defined by
H ( x , y ) = x y 2 , φ ( x , y ) = x y 3 , for all x , y H p .
Then for any u , x , y H p , x y , we have
H ( A ( x ) , u ) H ( A ( y ) , u ) = A ( x ) u 2 A ( y ) u 2 1 2 [ A ( x ) A ( y ) ] = 1 2 x 2 y 2 1 3 ( x y ) .
That is, H ( A ( x ) , u ) H ( A ( y ) , u ) 1 3 ( x y ) . Hence, H ( A , B ) is 1 3 -ordered compression mapping with respect to A . Similarly, one can show that H ( A , B ) is 1 5 -ordered compression mapping with respect to B . Now for any u , x , y H p , x y , we have
φ ( x S ( x ) , ν ) φ ( y S ( y ) , ν ) = ( x S ( x ) ) ν 3 ( y S ( y ) ) ν 3 1 3 [ ( x S ( x ) ) ( y S ( y ) ) ] = 1 3 [ ( x x 4 ) ( y y 4 ) ] = 1 4 x y 1 3 ( x y ) .
Hence, φ is 1 3 -Lipschitz-continuous with respect to the first argument. Similarly, we can show that φ is 1 2 -Lipschitz-continuous with respect to the second argument.
Let R , T : H p C B ( H p ) and M : H p × H p 2 H p be the set-valued mappings defined by
R ( x ) = x 2 , 1 3 : x H p , 0 x 1 , for all x H p ,
T ( x ) = x 3 , 1 5 : x H p , 0 x 1 , for all x H p ,
M ( x , y ) = { 3 ( x + y ) } , for all x , y H p .
Then, it is easy to show that R and T are D -Lipschitz-continuous mappings with constants 1 2 and 1 3 , respectively. Additionally,
M ( F ( x ) , G ( x ) ) = 3 ( F ( x ) + G ( x ) ) = 3 2 x 3 + 2 x 3 = 4 x .
Let p x = 4 x M ( F ( x ) , G ( x ) ) and p y = 4 y M ( F ( y ) , G ( y ) ) , then M is a comparison mapping, and we estimate
( p x p y ) α M ( H ( A ( x ) , B ( x ) ) H ( A ( y ) , B ( y ) ) ) = 4 ( x y ) α M 5 12 ( x y ) = 4 [ ( x y ) ( x y ) ] = 0 .
Hence, M is a XOR- 48 5 -non-ordinary difference mapping with respect to A and B . Additionally, for ρ = 1 ,
[ H ( A , B ) + ρ M ( F , G ) ] ( H p ) = H p .
Hence, M is H ( · , · ) -compression XOR- 48 5 -non-ordinary difference mapping. The resolvent operator R ρ , M ( F , G ) H ( A , B ) : H p H p associated with A , B , F and G is given by
R ρ , M ( F , G ) H ( A , B ) ( x ) = 6 x 29 , for all x H p .
It is easy to verify that the resolvent operator is single-valued and comparison mapping. Additionally,
| | R ρ , M ( F , G ) H ( A , B ) ( x ) R ρ , M ( F , G ) H ( A , B ) ( y ) | | = | | 6 x 29 6 y 29 | | = 6 29 | | x y | | 1 5 | | x y | | , for all x , y H p .
That is, the resolvent operator is 1 5 -Lipschitz-continuous. For ρ , τ , b = 1 and b = 0 , we have
R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] = 6 29 [ H ( A x , B x ) + ( P ( μ ) φ ( x S x , ν ) ) ] = 6 29 A ( x ) B ( x ) 2 + x 4 1 3 x x 4 x 3 = 6 29 5 x 12 4 x 3 = 21 x 58 .
Clearly, 0 is the fixed-point of R ρ , M ( F , G ) H ( A , B ) [ H ( A x , B x ) + ρ τ ( P ( μ ) b φ ( x S x , ν ) ) + a ] .
Let a n = 1 / ( n + 1 ) , b n = 3 n / ( 3 n + 2 ) and c n = n + 2 / ( n + 3 ) . It is easily seen that the sequences { a n } , { b n } and { c n } satisfy the condition 0 a n , b n , c n 1 , n = 0 a n = .
Now, we can approximate the sequences { x n } , { y n } and { z n } by the Algorithm 1 as follows:
x n + 1 = n n + 1 x n + 21 58 ( n + 1 ) y n , y n = 2 3 n + 2 x n + 63 n 58 ( 3 n + 2 ) z n , z n = 1 n + 1 x n + 21 ( n + 2 ) 58 ( n + 3 ) x n .
It is also clear that the condition (23) is satisfied. Hence, all the suppositions of Theorem 2 are verified. Therefore, the sequence { ( x n , μ n , ν n ) } converges strongly to the unique solution 0, which is the solution of GSMOVIP (10).

6. Conclusions

We introduced a new class of mapping, namely, H ( · , · ) -compression XOR- α M -non-ordinary difference mapping. A resolvent operator associated to this mapping was defined, and we discussed some of its characteristics. We examined a generalized, set-valued, mixed-ordered, variational inclusion problem involving H ( · , · ) -compression XOR- α M -non-ordinary difference mapping and relaxed cocoercive mapping in the setting of real ordered Hilbert spaces. An existence result was discussed for our considered ordered inclusion problem. Further, a three-step iterative algorithm using a ⊕ operator was suggested, and a convergence analysis of the proposed iterative algorithm was presented. Finally, a numerical example was given to illustrate the existence and convergence results. Further, the results presented in this paper can be generalized in ordered Banach spaces and ordered uniformly smooth Banach spaces.

Author Contributions

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

Funding

This research was funded by the Deanship of Scientific Research at Princess Nourah bint Abdulrahman University through the Fast-Track Research Funding Program.

Institutional Review Board Statement

Not Applicable.

Informed Consent Statement

Not Applicable.

Data Availability Statement

Not Applicable.

Acknowledgments

This research was funded by the Deanship of Scientific Research at Princess Nourah bint Abdulrahman University through the Fast-track Research Funding Program. The authors sincerely thank the anonymous referees for their valuable suggestions and useful comments that have led to the present improved version of the original manuscript.

Conflicts of Interest

The authors declare that there is no conflict of interests regarding the publication of this article.

References

  1. Stampacchia, G. Formes bilineaires coercivites sur les ensembles convexes. Comptes Rendus l’Acad. Des Sci. 1964, 258, 4413–4416. [Google Scholar]
  2. Harker, P.T.; Pang, J.S. Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications. Math. Program. 1990, 48, 161–220. [Google Scholar] [CrossRef]
  3. Karamardian, S. Generalized complementarity problem. J. Optim. Theory Appl. 1971, 8, 161–168. [Google Scholar] [CrossRef]
  4. Kinderlehrer, D.; Stampacchia, G. An Introduction to Variational Inequalities and Their Applications; Academic Press: New York, NY, USA, 1980. [Google Scholar]
  5. Lemke, C.E. Bimatrix equilibrium points and mathematical programming. Manag. Sci. 1965, 11, 681–689. [Google Scholar] [CrossRef] [Green Version]
  6. Nagurney, A. Network Economics: A Variational Inequality Approach; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2002. [Google Scholar]
  7. Smith, M.J. The existence, uniqueness and stability of traffic equilibria. Transp. Res. 1979, 13, 295–304. [Google Scholar] [CrossRef]
  8. Tremolieres, R.; Lions, J.L.; Glowinski, R. Numerical Analysis of Variational Inequalities; Elsevier: Amsterdam, The Netherlands, 2011. [Google Scholar]
  9. Ahmad, R.; Akram, M.; Dilshad, M. Graph convergence for the H(·,·)-co-accretive mapping with an application. Bull. Malays. Math. Sci. Soc. 2015, 38, 1481–1506. [Google Scholar] [CrossRef]
  10. Akram, M.; Chen, J.W.; Dilshad, M. Generalized Yosida approximation operator with an application to a system of Yosida inclusions. J. Nonlinear Funct. Anal. 2018, 2018, 1–20. [Google Scholar]
  11. Cho, Y.J.; Fang, Y.P.; Huang, N.J.; Hwang, H.J. Algorithms for systems of nonlinear variational inequalities. J. Korean Math. Soc. 2004, 41, 489–499. [Google Scholar] [CrossRef] [Green Version]
  12. Flam, S.D.; Ben-Israel, A. A continuous approach to oligopolistic market equilibrium. Oper. Res. 1990, 38, 1045–1051. [Google Scholar] [CrossRef]
  13. Liu, Q.; Cao, J. A recurrent neural network based on projection operator for extended general variational inequalities. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 2010, 40, 928–938. [Google Scholar]
  14. Noor, M.A.; Noor, K.I. New system of general nonconvex variational inequalities. Appl. Math. E-Notes 2010, 10, 76–85. [Google Scholar]
  15. Verma, R.U. Projection methods, algorithms and a new system of nonlinear variational inequalities. Comput. Math. Appl. 2001, 41, 1025–1031. [Google Scholar] [CrossRef]
  16. Hassouni, A.; Moudafi, A. A perturbed algorithms for variational inclusions. J. Math. Anal. Appl. 1994, 185, 706–712. [Google Scholar] [CrossRef] [Green Version]
  17. Akram, M.; Dilshad, M. System of generalized set-valued parametric ordered variational inclusion problems with operator ⊕ in ordered Banach spaces. Commun. Korean Math. Soc. 2021, 36, 103–119. [Google Scholar]
  18. Li, H.G.; Qiu, D.; Zou, Y. Characterizations of weak-ANODD set-valued mappings with applications to an approximate solution of GNMOQV inclusions involving ⊕ operator in ordered Banach spaces. Fixed-Point Theory Appl. 2013, 2013, 241. [Google Scholar] [CrossRef] [Green Version]
  19. Li, H.G.; Li, L.P.; Jin, M.M. A class of nonlinear mixed ordered inclusion problems for ordered (αA, λ)-ANODM set-valued mappings with strong comparison mapping. Fixed-Point Theory Appl. 2014, 2014, 79. [Google Scholar] [CrossRef] [Green Version]
  20. Yang, H.; Agarwal, R.P.; Nashine, H.K.; Liang, Y. fixed-point theorems in partially ordered Banach spaces with applications to nonlinear fractional evolution equations. J. Fixed-Point Theory Appl. 2017, 19, 1661–1678. [Google Scholar] [CrossRef]
  21. Zhang, C.; Wang, Y. Applications of order-theoretic fixed-point theorems to discontinuous quasi-equilibrium problems. Fixed-Point Theory Appl. 2015, 2015, 54. [Google Scholar] [CrossRef] [Green Version]
  22. Li, H.G. Approximation solution for generalized nonlinear ordered variational inequality and ordered equation in ordered Banach space. Nonlinear Anal. Forum 2008, 13, 205–214. [Google Scholar]
  23. Li, H.G. A nonlinear inclusion problem involving (α, λ)-NODM set-valued mappings in ordered Hilbert space. Appl. Math. Lett. 2012, 25, 1384–1388. [Google Scholar] [CrossRef]
  24. Li, H.G.; Pan, X.B.; Deng, Z.Y.; Wang, C.Y. Solving GNOVI frameworks involving (γG, λ)-weak-GRD set-valued mappings in positive Hilbert spaces. Fixed-Point Theory Appl. 2014, 2014, 1–9. [Google Scholar] [CrossRef] [Green Version]
  25. Li, H.G.; Yang, Y.; Jin, M.M.; Zhang, Q. Stability for a new class of GNOVI with (γG, λ)-weak-GRD mapping in positive Hilbert spaces. Math. Probl. Eng. 2016, 2016, 9217091. [Google Scholar] [CrossRef] [Green Version]
  26. Ahmad, R.; Ahmad, I.; Ali, I.; Homidan, S.; Wang, Y.H. H(·,·)-ordered compression mapping for solving XOR-variational inclusion problem. J. Nonlinear Convex Anal. 2018, 19, 2189–2201. [Google Scholar]
  27. Ahmad, I.; Rahaman, M.; Ahmad, R.; Ali, I. Convergence analysis and stability of perturbed three-step iterative algorithm for generalized mixed ordered quasi-variational inclusion involving XOR operator. Optimization 2020, 69, 821–845. [Google Scholar] [CrossRef]
  28. Schaefer, H.H. Banach Lattices and Positive Operators; Springer: Berlin, Germany, 1974. [Google Scholar]
  29. Du, Y.H. Fixed-points of increasing operators in ordered Banach spaces and applications. Appl. Anal. 1990, 38, 1–20. [Google Scholar] [CrossRef]
  30. Weng, X. Fixed-point iteration for local strictly pseudo-contractive mappings. Proc. Am. Math. Soc. 1991, 113, 727–731. [Google Scholar] [CrossRef]
  31. Verma, R.U. Generalized system for relaxed cocoercive variational inequalities and Projection methods. J. Optim. Theory Appl. 2004, 121, 203–210. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Agarwal, P.; Filali, D.; Akram, M.; Dilshad, M. Convergence Analysis of a Three-Step Iterative Algorithm for Generalized Set-Valued Mixed-Ordered Variational Inclusion Problem. Symmetry 2021, 13, 444. https://doi.org/10.3390/sym13030444

AMA Style

Agarwal P, Filali D, Akram M, Dilshad M. Convergence Analysis of a Three-Step Iterative Algorithm for Generalized Set-Valued Mixed-Ordered Variational Inclusion Problem. Symmetry. 2021; 13(3):444. https://doi.org/10.3390/sym13030444

Chicago/Turabian Style

Agarwal, Praveen, Doaa Filali, M. Akram, and M. Dilshad. 2021. "Convergence Analysis of a Three-Step Iterative Algorithm for Generalized Set-Valued Mixed-Ordered Variational Inclusion Problem" Symmetry 13, no. 3: 444. https://doi.org/10.3390/sym13030444

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