Gap Functions and Error Bounds for Set-Valued Vector Quasi Variational Inequality Problems ()
1. Introduction
Let
be a set-valued map such that
, for any
, is a closed convex set in
. Let
be set-valued maps such that
is convex and compact for all
. Denote by
The set-valued vector quasi variational inequality (SVQVI) problem associated with
and K, denoted by
, consists of finding an
such that there exists
and
where
denotes the inner product in
.
Throughout this work, we denote the solution set of
by
.
When the set
is a constant set
on
then
reduces to the following strong vector variational inequality
in [1] .
Find an
such that there exists
and
Note that if each
is a single-valued map, and K is a constant map
, then
reduces to the weak Stampacchia vector variational inequality problem
studied in [2] .
Quasi variational inequality (QVI) problems started with a pioneer work of Bensoussan and Lions in 1973. The terminology quasi variational inequality was coined by Bensoussan et al. [3] . A QVI QVI is an extension of a variational inequality (VI) [4] in which the underlying set K depends on the solution vector x. For further details on QVI and its applications in various domains, the readers can refer to [5] [6] [7] [8] and the references therein.
In 1980, Giannessi [9] introduced and studied vector variational inequality (VVI) in finite-dimensional Euclidean space. Chen and Cheng [10] studied the VVI in infinite-dimensional spaces and applied it to vector optimization problem. Lee et al. [11] [12] , Lin et al. [13] , Konnov and Yao [14] , and Daniilidis and Hadiisawas [15] studied the generalized VVI and obtained some existence results. Very recently, Charitha et al. [2] presented several scalar-valued gap functions for Stampacchia and Minty-type VVIs. A good source of material on VVI is a research monograph [16] . Motivated by the extension of VI to VVI, several researchers initiated the study of QVI for vector-valued functions, known as vector quasi variational inequalities (VQVI); see, for instance [11] [12] [13] [14] [15] and the references therein.
In this paper, we first proposed a gap function for
using a scalarization scheme and then developed another scalar-valued gap function for the same problem but without involving any scalar parameter. Under certain monotonicity conditions and fixed point symmetric assumptions, we developed the error bound results for both kinds of gap functions and their regularized counterparts. Further, we relaxed and replaced the fixed point symmetric condition by a locally α-Holder condition and obtained the same error bound results.
We now briefly sketch the contents of the paper. In Section 2, we present a scalarization scheme. In Section 3, we develop the classical gap function and the regularized gap function for
with the help of set-valued scalar quasi variational inequality (SSQVI). In Section 4, we introduce another scalar gap function and its regularized version for
, both free of any scalar parameter. We also develop the error bounds using fixed point symmetric hypothesis on the underlying map K. In Section 5, we showed that the same error bounds results can be obtained by relaxing the fixed point symmetric property by the α-Holder type hypothesis on K.
2. Scalarization
In this section, we investigate
via the scalarization approach of Mastroeni [1] and Konnov [17] . We introduce SSQVI for
and establish an equivalence between them under certain conditions.
Define functions
by following
Lemma 2.1. Let
be nonempty subsets of
. Then
where
means convex hull.
Proof. Note that for each
,
, hence
Moreover,
is convex, thus,
Conversely, let
. Then, there exist
and
with
, such that
, implying
. Hence the requisite result follows.
Proposition 2.1. [1] Let
be nonempty subsets of
. For
, if
are compact then,
and
are compact.
The SSQVI associated with set-valued maps
and K, denoted by
, consists of finding an
such that there exists
and
Throughout this paper, the solution set of
is represented by
.
Theorem 2.1. Consider the following
1)
are nonempty, convex and compact valued maps.
2)
is closed, convex valued map.
Then, for each
,
.
Proof. Let
. Then there exist
such that
By definition of
, there exists
, with
and
, such that
which implies that, for every
, there exists an index
, such that
It follows that
so,
.
Conversely, let
. Hence,
, and there exists
, such that
thus, for each
, there exists an index
such that
Observe that
, hence for each
, there exist
such that
Consequently,
Under assumption (1) and by Proposition 2.1,
is convex and compact which along with assumption (2) and the minmax theorem, yields
Finally, there exists
such that
completing the requisite result.
3. Gap Functions by Scalarization
One of the classical approaches in the analysis of VI and QVI and its different variants is to transform the inequality into an equivalent constrained or unconstrained optimization problem by means of the notion of gap function, please see, [5] [18] [19] and references cited therein. The gap functions have potential to play an important role in developing iterative algorithms for solving the inequality, analyzing the convergence properties and obtaining useful stopping rules for iterative algorithms. This prompted us to study and analyze different gap functions for
.
Definition 3.1. A function
is said to be a gap function for a
on any set
if it satisfies the following properties:
1)
,
2)
.
3.1. Classical Gap Function by Scalarization
Consider the function
defined by
(1)
Theorem 3.1. Consider the following
1)
are nonempty, convex and compact valued maps.
2)
is closed, convex valued map.
Then,
defined in (1) is a gap function for
on
.
Proof. Observe that, for
which implies
.
Next for
if and only if
By Proposition 2.1, since
is compact set on
and
, there exists
such that
therefore, we have
By invoking Theorem 2.1,
.
The function
is not differentiable, in general, an observation that leads to consider the regularized gap function.
3.2. Regularized Gap Function by Scalarization
For any
, consider the function
defined by
If, for
, each
is a compact set and
is a convex set, then by the minimax theorem
where
.
Since
is a strongly concave function in y so has unique maxima over closed convex set
, then follow from [20] (Chapter 4, Theorem 1.7),
is differentiable on
.
Note that if
is a singleton then this gap function reduces to the regularized gap function for QVI proposed by Taji [19] .
Theorem 3.2. Consider the following
1)
are nonempty, convex and compact valued maps.
2)
is closed, convex valued map.
Then,
is a gap function for
over
.
Proof. Clearly, for
,
.
Let
and
. Then,
Under assumption (1) and by Proposition 2.1, there exists
such that
which implies
Take an arbitrary point
, and define a sequence of vectors
as
being convex, so
, therefore
which when
yields
Hence
, which implies that
also.
Conversely, let
. Then, by Theorem 2.1,
. Hence
and there exists
such that
therefore
But
, which gives
.
4. Another Scalar Gap Functions for SVQVI
In previous section, we used the scalarization parameter
in constructing
and then studied the gap function for
. It is interesting to ask whether one can develop a gap function for
without taking help of
. We make an attempt to construct such a gap function in the discussion to follow. But first a notation.
Let
and let
. Then,
and denote
i.e.,
is the ith component of the vector
.
4.1. Classical Gap Function
Define a function
such that
(2)
Theorem 4.1. Consider the following
1)
are nonempty, convex and compact valued.
2)
is closed, convex valued map.
Then, g defined in (2) is a gap function for
on
.
Proof. Since
, so
which implies
.
Consider
. We observe that
if and only if there exists
such that
that is,
Equivalently,
Hence,
.
Proposition 4.1. For each
,
.
Proof. Let
and
. Then there exist
or equivalently,
and
with
such that
. For any
,
It follows that
We now attend to our prime aim that to develop the error bounds for
. We shall be needing the following concepts.
Definition 4.1. [1] A set-valued map
is said to be strongly monotone with modulus
on
if, for any
,
F is said to be monotone if the above inequality holds with
. F is said to be strictly monotone if it is monotone and the strict relation in the above inequality holds when
.
Remark 4.1. Let
be two set-valued maps with
for any
. Note that, if
is strongly monotone with modulus
(respectively, monotone and strictly monotone) on
then,
is also strongly monotone with modulus
(respectively, monotone and strictly monotone) on
. Consequently, recall if
is strongly monotone with modulus
(respectively, monotone and strictly monotone) on
then, each
is strongly monotone with modulus
(respectively, monotone and strictly monotone) on
.
Remark 4.2. Note that if
is strongly monotone with modulus
on any set
then each
is strongly monotone with modulus
on
[1] . However, the converse, in general, may not hold. For instance, consider two maps
as
and
. Then,
are strongly monotone on
with modulus 1 and 3 respectively. But for
,
;
,
, we have,
, which means
is not strongly monotone (not even monotone) map on
.
Definition 4.2. [5] A set-valued map
is said to be fixed point symmetric if for all
, we have,
if
then
The following result provides an error bound in terms of scalar gap function (without scalarize parameter) under strong monotonicity of
map and fixed pint symmetric
map.
Theorem 4.2. Let
. Suppose the following hold
1)
are nonempty, convex, compact valued.
2)
is closed, convex valued and fixed point symmetric map.
3)
is strongly monotone with modulus
on
.
Then, for
, we have
(3)
Proof. Since
, there exists
such that
For
, we have
Therefore, there exists an index
such that
and
(4)
Now, from the definition of
and by Proposition 2.1, there exists
such that
which gives
Since
, by fixed point symmetric property of
,
, thus taking
in above inequality, we have
(5)
For
, by strongly monotonicity of
and (4), we get
(6)
Hence, for any
,
Remark 4.3. We observed that the strong monotonicity of
(that is, assumption (3)) is used only to obtain relation (6). A careful examination reveals that even the following condition can help us to achieve the same error bound for
:
For any
and for any
, there exists an index
, and
satisfying (4) and
(7)
Hence the error bound given in (3) is valid for
because under assumption (3) of Theorem 4.2, the set-valued maps
always satisfy (7).
In particular, if
is a constant map
and each
is a single-valued map, then (7) states that for any
, there exists an index
such that
(8)
For instant, take
given as
and
and
. For this,
. In this case
is
not strongly monotone that means assumption (3) of Theorem 4.2 fails but the error bound Formula (3) remains valid because
satisfy (8).
In light of Proposition 4.1, the following is immediate.
Corollary 4.2.1. Let
. Suppose the following hold
1)
are nonempty, convex, compact valued.
2)
is closed, convex valued and fixed point symmetric map.
3)
is strongly monotone with modulus
on
.
Then, for
,
Similar to
, the gap function
is not differentiable leading to define the regularized gap function for
.
4.2. Regularized Gap Function
For
, define a function
as
(9)
For each x, define the function
Here,
is a strongly concave function of y. When
is a closed convex set for any
then,
attains maximum at a unique point in
. If
is a compact set in
then, it follow from [20] (Chapter 4, Theorem 1.7),
is differentiable.
Theorem 4.3. Consider the following
1)
are nonempty, convex and compact valued.
2)
is closed, convex valued map.
Then,
defined in (9) is a gap function for
over the set
.
Proof. Since
, so
which implies
.
Let
. We observe that
if there exists
such that
By similar arguments given in Theorem 3.2, we can work out that
which is equivalent to
that is,
.
For the converse part, let
. Then
and there exists
such that
Hence for any arbitrary but fixed
, there exists an index
, depending on
, and there exists
, such that
In other words,
which implies
We conclude that
, and hence the result follows.
Theorem 4.4. Let
. Suppose the following hold
1)
are nonempty, convex, compact valued.
2)
is closed, convex valued and fixed point symmetric map.
3)
is strongly monotone with modulus
on
.
Then, for
and for any
,
Proof. Since
, there exists
such that
Taking
, we have
There exists an index
such that
, and
(10)
Proceeding along the lines of Theorem 4.2, we can easily obtain, for
,
where the last inequality follows from strongly monotonicity of
and (10), yielding the requisite result.
5. Substitution of “Fixed Point Symmetric Assumption”
Aussel [5] obtained the error bounds for a SSQVI by replacing “fixed point symmetric” property on
by the Holder’s type hypothesis which motivated us to see if the Holder’s type hypothesis on
works for
too.
Definition 5.1. [5] A set-valued map
is said to be locally α-Holder (
) at a point
if there exists
and
such that for all
where
represents a ball in
.
Remark 5.1. If
is a fixed point symmetric map over any set
then
will also be locally α-Holder (
) at any point
. However, the converse, in general, may not hold. For instance, consider Proposition 3.6 in [5] , where the constraints map
is defined, for any
, by
where
is a continuously differentiable function and
is an α-Holder continuous on
. Let
be such that
. Then for some constant
(see Proposition 3.6 in [5] ), the constraint map
is locally γ-Holder at
. Note that
is not necessary fixed point symmetric over
.
Recall the map
. For if
is a compact valued map then define
where
indicates the closed unit ball in
centered at
.
Theorem 5.1. Let
. Suppose the following hold
1)
are nonempty, convex, compact valued.
2)
is closed, convex valued and locally α-Holder with
at
and
.
3)
is strongly monotone with modulus
.
Then, for any
, and for any
,
where
.
Proof. Since
, there exists
such that
Taking
in above relation
Hence, there exists an index
and
such that
(11)
Also,
Using Proposition 2.1, there exists
such that
For any
, there exists an index
and
such that
Consequently,
(12)
where the last inequality is due to assumption (3), (11) and triangular inequality of
.
Since
is locally α-Holder at
, for all
, we have
Taking into account that
, inequality (12), we have, for
,
where
.
Then, for all
, if
we have
because
, thus proving that
is the unique solution of
over
.