1. Introduction
It is well known that inclusion problems were introduced and studied as a generalization of equilibrium problems, which include a vast range of problems in analysis such as variational inequalities, vector optimization, game theory, fixed point problems, the Nash equilibrium problem, complementary problems, traffic equilibrium problems, economics, etc., see [
1,
2,
3]. It is interesting to note that the term “Variational inclusion”, is understood with different aspects in several works. That is, it means simply multi-valued variational inequalities in [
4,
5] and the problem of finding the zeros of maximal monotone mappings in [
6,
7,
8], etc. Variational inclusions involving different kinds of operators are useful and have a wide range of applications in industry, mathematical finance, decision sciences, ecology, engineering sciences, etc., see [
9,
10,
11,
12,
13,
14,
15].
Due to the fact that the projection methods cannot be used to solve variational inclusion problems, the resolvent operator methods came into the picture to solve them efficiently. It is also known that the monotone operators in abstract spaces can be regularized into single-valued Lipschitzian monotone operator through a process known as Yosida approximation, see [
16,
17,
18,
19].
The XOR-operation ⊕ is a binary operation and behaves like ADD operation, which is associative as well as commutative. XOR-operation depicts interesting facts and observations and forms various real time applications, i.e., data encryption, error detection in digital communication, parity check and helps to implement multi-layer perception in neural networks.
Many problems related to ordered variational inequalities and ordered equations were studied by H.G.Li together with his co-authors, see [
20,
21,
22,
23,
24] and I.Ahmad with his co-authors, see [
25,
26]. Considering all the facts mentioned above, in this paper, we introduce and study a quite new and interesting problem which we call Cayley inclusion problem involving XOR-operation. The Cayley inclusion problem involves a Cayley operator and a multi-valued mapping. We have shown some properties of the Cayley operator, that is, it is single-valued, comparison as well as Lipschitz-type-continuous. A fixed point formulation of the Cayley inclusion problem is given by using the concept of resolvent operator and Yosida approximation operator. An iterative algorithm is established and finally an existence and convergence result is proved for the Cayley inclusion problem involving XOR-operation. An example is constructed to illustrate some of the concepts used in this paper.
2. Preliminaries
Throughout this paper, we suppose that is a real ordered Hilbert space endowed with a norm and an inner product d is the metric induced by the norm and is the family of all nonempty subsets of
Now, we recall some known concepts are results which we need to prove the main result of this paper and can be found in [
22,
23,
24,
27,
28].
Definition 1. A nonempty closed convex subset C of is said to be a cone, if
- (i)
for any and , then ,
- (ii)
for any and , then .
Definition 2. A cone C is said to be normal if and only if, there exist a constant such that implies , where is the normal constant of C.
Definition 3. Let C be a cone. For arbitrary element , holds if and only if, . The relation in is called partial ordered relation.
Definition 4. For arbitrary elements , if (or ) holds, then x and y are said to be comparable to each other (denoted by ).
Definition 5. For arbitrary elements and means least upper bound and greatest upper bound of the set Suppose and exist, then some binary operations are defined as follows:
- (i)
- (ii)
- (iii)
- (iv)
The operations ⊕ and ⊙ are called OR, AND, XOR and XNOR operations, respectively.
Lemma 1. If then lub and glb exist, and
Lemma 2. For any natural number and as then
Proposition 1. Let ⊕ be an XOR-operation and ⊙ be an XNOR-operation. Then the following relations hold:
- (i)
- (ii)
if then
- (iii)
- (iv)
if
- (v)
if then if and only if
- (vi)
- (vii)
- (viii)
if and w are comparable to each other, then
- (ix)
if and
Proposition 2. Let C be a normal cone in with normal constant then for each the following relations hold:
- (i)
- (ii)
- (iii)
- (iv)
if then
Definition 6. Let be a single-valued mapping.
- (i)
A is said to be a comparison mapping if then , and , ,
- (ii)
A is said to be strongly comparison mapping, if A is a comparison mapping and if and only if , .
Definition 7. A mapping is said to be β-ordered comparison mapping, if A is comparison mapping and Definition 8. Let be a multi-valued mapping. Then
- (i)
M is said to be a comparison mapping, if for any and if then for any and any
- (ii)
a comparison mapping M is said to be α-non-ordinary difference mapping, if for each and such that - (iii)
a comparison mapping M is said to be γ-ordered rectangular, if there exists a constant and for any there exist and such thatholds. - (iv)
M is said to be weak comparison mapping, if for any , , then there exist and such that , and .
- (v)
M is said to be λ-weak ordered different comparison mapping, if there exist a constant such that for any , there exist , , holds.
- (vi)
a weak comparison mapping is said to be a -weak ordered rectangular different multi-valued mapping, if M is a γ-ordered rectangular and λ-weak ordered different comparison mapping and , for .
Definition 9. Let be a multi-valued mapping. The operator defined byis called the resolvent operator associated with M, where is a constant. It is well known that the resolvent operator associated with M is single-valued.
Definition 10. The Yosida approximation operator associated with M is defined bywhere is a constant. Now we define the Cayley operator based on resolvent operator (1)
Definition 11. The Cayley operator of M is defined as:where I is the identity operator. Proposition 3. Let is a γ-ordered rectangular multi-valued mapping. Then, the Yosida approximation operator is single-valued, for .
Proof. For the proof we refer to [
25]. □
Proposition 4. Let is a γ-ordered rectangular multi-valued mapping. Then, the Cayley operator associated with M is single valued, for
Proof. Let
Then
Thus , where Let then .
Similarly, for
, we have
, where
Now, we evaluate
by using the values of
and
calculated above and using Proposition 1.
Since
M is
-ordered rectangular multi-valued mapping and using (4), we have
which implies that
Therefore, the Cayley operator associated with M is single-valued. □
Proposition 5. For any , let and .Then, the Cayley operator associated with M is a comparison mapping.
Proof. For any
, let
then obviously
. As
is a comparison mapping, we have
. Thus, we have
i.e., we have
Therefore, the Cayley operator associated with M is a comparison mapping. □
Lemma 3. Let be a γ-ordered rectangular multi-valued mapping with respect to , for . Then the following condition holds: That is, the resolvent operator is Lipschitz-type-continuous.
Proof. For the proof we refer to [
25]. □
Lemma 4. Let be a -weak ordered rectangular different multi-valued mapping with respect to and the resolvent operator defined by (1) is θ-Lipschitz-type-continuous. Then, the Yosida approximation operator defined by (2) is -Lipschitz-type-continuous. i.e., That is, the Yosida approximation operator is Lipschitz-type-continuous.
Proof. For the proof we refer to [
25]. □
Lemma 5. Let be -weak ordered rectangular different multi-valued mapping with respect to and the resolvent operator is θ-Lipschitz-type-continuous. Then, the Cayley operator defined by (3) is -Lipschitz-type-continuous. That is, Proof. Using Cauchy-Schwartz inequality and Proposition 1, we have
Using the Lipschitz-type-continuity of the resolvent operator
, we have
i.e., the Cayley operator
is Lipschitz-type-continuous. □
We construct the following example in support of some of the concepts used in this paper.
Example 1. Let be a normal cone with constant . Let be the multi-valued mapping defined by and . That is, M is a comparison mapping. Thus, M is -ordered rectangular mapping. Also it is easy to see that for , M is 2-weak ordered different comparison mapping. Hence, M is -weak ordered rectangular different multi-valued mapping.
The resolvent operator defined by (1) is given by That is, the resolvent operator is -Lipschitz-type-continuous.
In view of the above, the Cayley operator defined by (3) is of the form: It is easy to see that that the Cayley operator defined above is a comparison and single-valued mapping. Also, That is, the Cayley operator is -Lipschitz-type-continuous.
3. Formulation of The Problem and Existence of Solution
Let be a real ordered Hilbert space. Let be the multi-valued mapping and be the Cayley operator. We consider the following problem:
We call Problem (5) a Cayley inclusion problem involving XOR-operation.
If
, then the Problem (5) reduces to the problem of finding
such that
Problem (6) is a fundamental problem of inclusions in analysis and studied by Li et al. [
22] and others.
The following Lemma is a fixed point formulation of Cayley inclusion Problem involving XOR-operation (5).
Lemma 6. The Cayley inclusion Problem (5) involving XOR-operation has a solution if and only if, it satisfies the following equation: Proof. From Equation (
7), we have
Using the definition of resolvent operator and Yosida approximation operator, we obtain
which implies that
i.e., the required Cayley inclusion Problem involving XOR-operation (5). □
Based on Lemma 6, we define the following iterative algorithm for finding the solution of the Cayley inclusion problem involving XOR-operation (5).
Iterative Algorithm 1. For initial element , compute the sequence by the following iterative scheme:where , is a constant and I is the identity operator. Theorem 1. Let be a real ordered Hilbert space and C be a normal cone with normal constant with ordering . Let be γ-ordered rectangular, -weak ordered rectangular different multi-valued mapping. Let be the Yosida approximation operator defined by (2) and be the Cayley operator defined by (3) such that both the operators are Lipschitz-type-continuous with constant and , respectively. Let and , for all , such that the following condition is satisfied: Then the sequence generated by the Algorithm 1 strongly converges to , the solution of the Cayley inclusion Problem involving XOR-operation (5). In addition, for any , the following condition holds: Proof. By using Algorithm 1 and Proposition 1, we have
Using Proposition 2, we calculate
As
is Lipschitz-type-continuous, we have
Using the Lipschitz-type-continuity of Yosida approximation operator
and Cayley operator
, we have
where
,
Since
, we have
Hence, for
, we have
It follows from condition (8) that
, and thus
and so
is a Cauchy sequence in
. Since
is complete
Thus, we can write
It follows that
satisfies the Equation (
7),
By Lemma 6, is a solution of Cayley inclusion problem involving XOR-operation (5). On the other hand, it follows that
Using Lemma 1 and (12), we have
This complete the proof. □