VARIATIONAL INEQUALITY AND

COMPLEMENTARITY PROBLEM
Sudarsan Nanda
KIIT Deemed to be University
Bhuabaneswar, Odisha,751024, India
e-mail: snanda@kiit.ac.in

Abstract
Variational inequality and Complementarity have much in common, but there
has been little direct contact between the researchers of these two related fields of
mathematical sciences. Several problems arising from Fluid Mechanics, Solid Me-
chanics, Structural Engineering, Mathematical Physics, Geometry, Mathematical
Programming etc. have the formulation of a Variational Inequality or Complemen-
tarity Problem. People working in applied mathematics mostly deal with infinite
dimensional case and they deal with Variational inequality whereas people working
in operations research mostly deal with finite dimensional problem and they use
complementarity problem. Variational inequality is a formulation for solving the
problem where we have to optimize a functional. The theory is derived by using the
techniques of nonlinear functional analysis such as fixed point theory and theory of
monotone operators etc.
In this paper we give a brief review of the subject. This paper is divided into four
sections. Section 1 deals with nonlinear operators which are required to describe the
results. Section 2, 3, 4 and 5 deal with Variational inequality, Equilibrium Problem
and Complementarity Problem. Section 6 describes semi-inner-product spaces and
Variational Inequality in semi-inner-product spaces.

1 NONLINEAR OPERATORS
In this section we discuss certain nonlinear operators, which are useful in the study of
variational inequalities and complementarity problem.
Let X be a real normed linear space and let X ∗ be the dual space of X. Let the pairing
between x ∈ X and x∗ ∈ X ∗ be denoted by (x∗ , x). Let T be a of a map from a subset
D(T ) of X into X ∗ . T is said to be monotone if
(T x − T y, x − y) ≥ 0 for all x, y ∈ D(T ),
and strictly monotone if T is monotone and strict inequality holds whenever x 6= y. T
is α-monotone if there is a continuous strictly increasing function α : [0, 1) → [0, 1] with
α(0) = 0 and α(r) → ∞ as r → ∞ such that
(T x − T y, x − y) ≥ kx − yk α (kx − yk)
for all x, y ∈ D(T ). T is strongly monotone if α(r) = cr for some c > 0. T is coercive
on subset K of D(T ) if there exists a function c : (0, ∞) → [−∞, ∞] with c(r) → ∞ as
r → ∞ such that
(T x, x) ≥ kxk c (kxk) for all x ∈ K.

1
Thus T is coercive on K if K is bounded, while T is coercive on an unbounded K if and
only if
(T x, x)
→ ∞ as kxk → ∞, x ∈ K.
kxk
T is hemicontinuous if D(T ) is convex for any x, y ∈ D(T ), the map t → T (tx + (1 − t)y)
of [0, 1] to X ∗ is continuous for the natural topology of [0, 1] and the weak topology of
X ∗.
Examples:
(a) Let f : R → R be a monotonically increasing function. Then f is a monotone
operator.
(b) Let H be a Hilbert space and T : H → H be a compact self-adjoint linear operator.
Then T is monotone operator if all the eigen-values of T are non-negative.
(c) Let H be a Hilbert space. An operator T : H → H is said to be nonexpansive if

kT x − T yk ≤ kx − yk for all x, y ∈ H.

If T is nonexpansive, then I − T is a monotone operator.

(d) Let H be a Hilbert space and C a closed convex subset of H. Let Px denote the point
of minimum distance of C from x, that is,
 
Px = z ∈ C : kz − xk = inf ky − xk .
y∈C

Then P is a monotone operator on H.

(e) Let H be a Hilbert space. Then an operator T : H → H is said to be accretive if

kx − yk ≤ kT x − T yk for all x, y ∈ H.

Then T : H → H is monotone if I + λT is accretive for every λ > 0.

Theorem 1.1. If T : D(T ) ⊂ X → X ∗ is α-monotone, then it is strictly monotone
(hence monotone) and coercive in particular every strongly monotone operator is strictly
monotone and coercive.
Let X be nls and let X ∗ be its dual. A map T : X → X ∗ is said to a duality map if for
any x ∈ X,
(i) (T x, x) = kT xk kxk, and
(ii) kT xk = kxk.
A duality map can be constructed in any nls in the following way : By Hahn-Banach
theorem, for any x ∈ X, there exists at least one bounded linear functional yx ∈ X ∗ such
that yx = 1 and (yx , x) = kxk. Taking one such functional yx and setting Tx = kxk yx
and T (−x) = − kxk yx , we get kTx k = kxk and (Tx , x) = kTx k kxk.

2
Theorem 1.2. In general a duality map T : X → X ∗ is multivalued. It is single-valued
if X ∗ is strictly convex.
Theorem 1.3. If T : X → X ∗ is a duality map, then it is monotone and coercive. If
further X is strictly convex, then T is strictly monotone.
Theorem 1.4. Let X be a real Banach space and F : X → X ∗ be a nonlinear operator.
If the Gateaux derivative F 0 (x) exists for every x ∈ X and is positive semidefinite, then
F is monotone.
Theorem 1.5. Let f be a proper convex function defined on X. If f is differentiable,
then ∇f is monotone.
Theorem 1.6. Let f be a proper differentiable function defined on X. If ∇f is monotone,
then f is convex.

2 VARIATIONAL INEQUALITIES
In this section we shall discuss some basic properties of variational inequalities. Before
we state the definition we shall first discuss some examples where variational inequalities
arise.
Example 2.1. Let I = [a, b] ⊂ R. Let f be a real-valued differentiable function defined
on I. Suppose, we seek for the points x ∈ I for each

f (x) = min f (y).

y∈I

Then three cases will arise in this case :

(i) a < x < y ⇒ f 0 (x) = 0
(ii) a = x ⇒ f 0 (x) ≥ 0
(iii) x = b ⇒ f 0 (x) ≤ 0.
All these cases can be put together as a single inequality as follows:

f 0 (x)(y − x) ≥ 0 for all y ∈ I.

This is an example of variational inequality.

Example 2.2. Let K be a closed convex set in Rn and let f : K → R be differentiable.
We characterize the points x ∈ K for which

f (x) = min f (y).

y∈K

If there exists x ∈ K which satisfies the above equation and if F (x) = grad f (x), then x
is a solution of the following inequality

x ∈ K : (F (x), y − x) ≥ 0 for all y ∈ K.

3
Conversely, if f is differentiable and convex and if the above inequality is satisfied by x,
then

f (x) = min f (y).

y∈K

Example 2.3. Let Ω be a bounded open domain in Rn with the boundary T . In some
problems of mechanics we seek a real-valued function x → u(x) which, in Ω, satisfies the
classical equation
n
X ∂ 2u
−∇u − u = f, f ∈ Ω, ∇u = (1)
i=1
∂x2i

with the boundary conditions

∂u ∂u
u ≥ 0, ≥ 0, u = 0 on Γ. (2)
∂v ∂v
∂
where ∂v
denotes differentiation along the outward normal to Γ. If we write

1
J(v) = a(v, v) − (f, v)
2
where
n Z Z
X ∂u ∂v
a(u, v) = dx + uv dx
i=1 Ω
∂xi ∂xi Ω
Z
(f, v) = f v dx
Ω

and if we introduce the closed convex set K defined by

K = {v : v ≥ 0 on Γ} ,

then the problem given by (1) and (2) is equivalent to finding u ∈ K such that

J(u) = inf J(v).

v∈K

This admits a unique solution u characterized by

u ∈ K : a(u, v − u) ≥ (f, v − u) for all v ∈ K.

This is called a variational inequality problem.

We shall now state the problem in the most general setting.
Let X be a reflexive real Banach space and let X ∗ be its dual. Let T be a monotone
hemicontinuous mapping from X to X ∗ and let K be a nonempty closed convex subset
of the domain D(T ) of T . Then a variational inequality is stated as follows:

x ∈ K : (T x, y − x) ≥ 0 for all y ∈ K. (3)

4
Any x ∈ X which satisfies (3) is called a solution of the variational inequality. Let us
write S(T, K) to denote the set of all solutions of variational inequality (3). We shall, in
fact, consider a more general inequality which is stated as follows:
For each given element w0 ∈ X ∗ ,

x ∈ K : (T x − w0 , y − x) ≥ 0 for all y ∈ K. (4)

Inequality (3) can also be written by replacing the subset K of X by an extended real-
valued function defined on X. For any subset K of X, let δk , called the indicator function
of K, be the function defined on X by

0, if y ∈ K;
δK (y) =
∞, if y ∈/ K.

Then it is easy to verify that x ∈ K is a solution of (3) if and only if

(T x, y − x) ≥ δK (x) − δK (y) for all y ∈ K.

Therefore we consider, as a generalization of inequality (3), the inequalities of the form :

(T x, y − x) ≥ f (x) − f (y) for all y ∈ K, (5)

where f is an arbitrary extended real-valued function defined on X.

Observe that if f = 0, then (5) reduces to the VI(3) and if T = 0, then we are in
the framework of the calculus of variations where we minimize the extended real-valued
functional f , i.e., we have

f (x) ≤ f (y) for all y ∈ X

or

f (x) = min f (y).

y∈X

Theorem 2.4. Let T be a monotone, hemi-continuous mapping of a subset D(T ) of X

into X ∗ and K a convex subset of D(T ). Then for a given element w0 ∈ X ∗ , any solution
of inequality (4) is also a solution of the equality

(T y − w0 , y − x) ≥ 0 ∀ y ∈ K. (6)

Theorem 2.5. Let T be a hemi-continuous mapping of X into X ∗ . Suppose that for any
pair of vectors x0 ∈ K and w0 ∈ X ∗ ,

(T y − w0 , y − x) ≥ 0 ∀ y ∈ K. (7)

Then T x0 = w0 .
The following result gives uniqueness of solution when it exists.
Theorem 2.6. If the mapping T from X into X ∗ is strictly monotone, then the inequality
(4) can have atmost one solution.

5
Theorem 2.7. If either the mapping T is strictly monotone or the function f is strictly
convex, then the inequality (5) can have atmost one solution.
We shall now state that the following fundamental theorem for variational inequality.
Theorem 2.8. Let T be a monotone semicontinuous map of a closed convex subset K
of a reflexive real Banach space X, with 0 ∈ K, into X ∗ and if K is not bounded, let T
be coercive on K. Then for each given element w0 ∈ X ∗ there is an x ∈ K such that
inequality (4) holds, i.e.,

x ∈ K : (T x − w0 , y − x) ≥ 0 ∀ y ∈ K.

3 Types of Variational Inequalities

Where the operator depends upon the spaces concerned and the set K is always convex
closed subset of the space.
(1) The Variational like Inequality Problem (VLIP)
Find x ∈ K such that

(T x, θ(u, x)) ≥ 0 for all u ∈ K.

(2) Variational Type Inequality Problem (VTIP)

For z ∈ K find u ∈ K such that
   
z+u
T , x − u ≥ 0 for all x ∈ K.
2

(3) Strongly Nonlinear Variational like Inequality Problem (SNVIP)

Find u ∈ K such that

(T u, θ(x, u)) ≥ (Au, θ(x, u)) for all x ∈ K.

(4) Strongly Nonlinear Implicit Variational like Inequality Problem (SNIVIP)

Find u ∈ K such that

(T u, g(x) − g(u)) ≥ (Au, g(x) − g(u)) for all x ∈ K.

(5) Nonlinear Quasi-Variational Inequality Problem (NQVIP)

Find u ∈ K such that u ∈ S(u) and

(T (u) , x − u) ≥ 0 for all x ∈ S(u).

(6) Quasi-Variational like Inequality Problem (QVLIP)

Find u ∈ K such that u ∈ S(u) and

(T (u) , θ(x, u)) ≥ 0 for all x ∈ S(u).

6
(7) Quasi-Variational Type Inequality Problem
(QVTIP)
For z ∈ K, find u ∈ K such that u ∈ S z+u2
, and
     
z+u z+u
T , x − u ≥ 0 for all x ∈ S .
2 2

(8) Generalized Quasi-Variational Type Inequality Problem

(GQVTIP)
For z ∈ K, find u ∈ K, w ∈ X ∗ such that u ∈ S z+u , T z+u


2 2
and
 
z+u
(w, x − u) ≥ 0 for all x ∈ S .
2

Theorem 3.1. Let K be a nonempty closed convex subset of a reflexive real Banach
space X with dual X ∗ , 0 is an interior point of K. Let S = T − f, T, f : K → K ∗ be
hemicontinuous. T uniformly monotone with a gauge function c1 (r), f uniformly relaxed
Lipschitz with another gauge function c2 (r). Let G ⊂ X × X ∗ be such that

G = {(v, Su + z) : (x, u − z) ≥ 0 ∀ v ∈ K} .

Then NVI: u ∈ K : (Su, v − u) ≥ 0 has a unique solution.

Theorem 3.2. S : K → X ∗ is p-monotone, T : K → X ∗ is p-Lipschitz, S, T are
hemicontinuous, K is nonempty closed convex set in X. Then u ∈ K is a solution of the
VI

(Su − T u − w, v − u) ≥ 0 ∀ v ∈ K

iff u is a solution of

(Su − T u − w, v − u) ≥ (r − s) ku − vkp

when s < r, p > 1, r p-monotone constant and s p-Lip constant.

Let K be a nonempty closed convex subset of a reflexive Banach space X, S, T : K → X ∗ ,
f : X → [−∞, ∞] is conve, lsc and f 6= ∞. Let S be hemicontinuous, strong monotone
with constant r > 0, T hemicontinuous and relaxed Lip with constant k.
Theorem 3.3. Under the above conditions

(Su − T u, v − u) + f (v) − f (u) ≥ 0 ∀ v ∈ K

⇒ (Sv − T v, v − u) + f (v) − f (u) ≥ c kv − uk2

where c = r − k > 0.
Theorem 3.4. Under the above conditions

(Su − T u, v − u) + f (v) − f (u) ≥ 0

has a unique solution.

7
 Let X be lc H-tvs, G : X → X is continuous, T is said to be G-monotone if ∃ a
constant r > 0 such that

(T u − T v, G(u − v)) ≥ r (p(u − v))2

where p is a seminorm on X.

Theorem 3.5. Let K be a nonempty, compact, convex subset of X, T : K → X ∗ is

strongly G-monotone, G(u + v) = G(u) + G(v), G(tx) = tG(x). Then

(T u, G(v − u)) ≥ 0 ∀ v ∈ K

has a solution.

A set K ⊂ Rn is said to invex if

u, v ∈ K, 0 ≤ t ≤ 1 ⇒ u + tη(v, u) ∈ K

for some vector η : K × K → R. η : K × K → R is said to be strongly monotone if ∃

σ > 0 such that

(η(v, u), v − u) ≥ σ kv − uk2

Lip continuous if ∃ a constant δ > 0 such that

kη(x, u)k ≤ δ kv − uk .

Assumption 1. η(v, u) = −η(u, v).

√
Assumption 2. γ = ξδ + β 1 − 2σ + δ 2 < α, α > 0, σ > 0, β > 0, δ > 0 are strong
monotone an Lip constants of T and η respectively, ξ > 0 is the Lip constant of A.

Theorem 3.6. T : K → R, η : K × K → R are both strongly monotone and Lip

continuous, A : K → R Lip continuous. Assumption 1 and 2 hold. Then ∃ a unique
solution of the variational inequality

u ∈ K : (T u − Au, η(v, u)) ≥ 0 ∀ v ∈ K.

Definition 3.7. Let T : K → X ∗ . T is said to be

Relaxed Lipschitz: (T u − T v, u − v) ≤ k ku − vk2 .
Uniformly Monotone if ∃ a gauge function c1 (r) such that

(T x − T y, x − y) ≥ c1 (kx − yk) kx − yk .

Strongly Monotone if ∃ a constant c1 > 0 such that

(T x − T y, x − y) ≥ c1 kx − yk2 .

8
Uniformly Relaxed Lipschitz if ∃ a gauge function c2 (r) such that
(T x − T y, x − y) ≤ c1 (kx − yk) kx − yk .
Relaxed Lipschitz if ∃ a constant c2 > 0 such that

(T x − T y, x − y) ≤ c2 kx − yk2 .
p-Monotone if ∃ a constant r > 0 such that
(T x − T y, x − y) ≥ r kx − ykp .
p-Lipschitz type if ∃ a s > 0 and p > 1 such that
(T x − T y, x − y) ≤ s kx − ykp .
Relaxed Monotone if ∃ a constant k > 0 such that
(T x − T y, x − y) ≥ −k kx − yk2 .
Strongly Lip (T x − T y, x − y) ≤ −c kx − yk2 .
Strongly Pseudo-contractive or Strictly Pseudo-contractive :
∃ t > 1 : kx − yk ≤ k(1 + r)(x − y) − rt(T x − T y)k .
Strictly accretive for r > 0 such that

(T x − T y, x − y) ≥ r kx − yk2 .
Remarks:
(1) T Relaxed Lip ⇔ −T Relaxed Monotone
(2) T Relaxed Lip ⇔
I − T is strongly monotone, if k < 1;
I − T is relaxed monotone, if k > 1.

(3) T strongly monotone ⇔ I − T is strongly (strictly) contractive.

(4) T strongly Lip ⇔ I − T is strongly monotone.

4 EQUILIBRIUM PROBLEM
There is another problem, called ‘equilibrium problem’, which is even more general than
variational inequality. For a brief discussion of equilibrium problem one may refer, for
example, Blum and Oettli. We quote below the problem and then mention some problems
which arise as special cases.
Let X be a real Banach space and K a closed convex subset of X. Let f : K × K → R
be such that f (x, x) = 0 for ∀ x ∈ K.
The equilibrium problem (P) is to find
x0 ∈ K, f (x, y) ≥ 0 ∀ y ∈ K.

9
Examples 1. Optimization: Let g : K → R. Find x0 ∈ K such that

g(x0 ) = min g(x).

x∈K

This is a special case of (P), the case for which f (x, y) = g(y) − g(x).
2. Convex Optimization for differentiable map and variational inequality:
Let g : X → R be convex and Gateaux differentiable with Gateaux differential Dg(x) ∈
X ∗ at x. Consider the problem minx∈K g(x). If x0 solves the above problem, it is known
that x0 is a solution of the following VI

x0 ∈ K, (Dg(x0 ), y − x0 ) ≥ 0 ∀ y ∈ K.

Observe that the above is a special case of the problem (P) with f (x, y) = (Dg(x), y − x).
3. Fixed Points:
Let X be a Hilbert space, T : K → K. Find x0 ∈ K such that T x0 = x0 . Put
f (x, y) = (T (x) − x, y − x). Then the above problem is the problem (P).

5 COMPLEMENTARITY PROBLEM
Several problems arising in various fields such as: mathematical problem, game theory,
economics, mechanics and geometry have mathematical formulation of a complementarity
problem.

Definition 5.1. Let X be a reflective real Banach space and let X ∗ be its dual. Let K be
a closed convex cone in X with 0 ∈ K. The polar of K is the cone K ∗ defined by

K ∗ = {y ∈ X ∗ : (y, x) ≥ 0 ∀ x ∈ K} .

Obviously K ∗ 6= ∅ since 0 ∈ K ∗ . It is also easy to see that K ∗ is a closed convex

cone in X ∗ . Let T be a map from K into X ∗ . Then the complementarity problem (CP
in short) is to find an x ∈ X such that

x ∈ K, T x ∈ K ∗ , (T x, x) = 0.

The following theorem proves the equivalence between the complementarity problem and
variational inequality over closed convex cone. We write

S(T, K) = {x : x ∈ K, (T x, y − x) ≥ 0 for all y ∈ K}

and

C(T, K) = {x : x ∈ K, T x ∈ K ∗ , (T x, x) = 0} .

We have

Theorem 5.2. Karamardian [58]

C(T, K) = S(T, K).

10
Remarks:

(a) It should be noted that the solution of a complementarity problem, if exists, is unique
if the operator is strictly monotone. Since C(T, K) = S(T, K) for a closed convex
cone K, the proof is same as that of Theorem 2.6.

(b) Regarding the existence it must be noted that the solution may not exist only under
the assumption of hemicontinuity and monotonicity (even strict monotonicity) of the
operator T . For example, let X = R, K = {x ∈ R : x ≥ 0}, so that K = K ∗ and K
is a closed convex cone. Let T : K → R be defined by
1
Tx = .
1+x
Then T is hemicontinuous and strictly monotone (T x, x) = 0 implies x = 0 but
/ K ∗.
T 0 = −1 ∈

We shall now discuss the existence of solutions of the complementarity problem. We have

Theorem 5.3. Let T : K → X ∗ be hemicontinuous, monotone and coercive. Then

the complementarity problem has a solution. In particular if T is hemicontinuous and
α-monotone, then the solution exists and is unique.

Theorem 5.4. Let T : K → X ∗ be hemicontinuous, monotone and let T 0 ∈ K ∗ . The

the complementarity problem has a solution.

Theorem 5.5. Let T : C → B ∗ be hemicontinuous and monotone such that there is an

x ∈ C with T x ∈ int C ∗ . Then there is an x0 such that

x0 ∈ C, T x0 ∈ C ∗ and (T x0 , x0 ) = 0. (10)

If further T is strictly monotone, then there is a unique x0 satisfying (10).

In order to prove the theorem we need the following result, which is due Browder, See
Browder [12] and Mosco [75].

Theorem 5.6. Let T be a monotone, hemicontinuous map of a closed, convex bounded

subset K of B, with 0 ∈ K, into B ∗ . Then there is an x0 ∈ K such that

(T x0 , y − x0 ) ≥ 0 for all y ∈ K.

Now observe that if e ∈ C ∗ but e ∈/ int C ∗ , the sets Dr (e) need not be bounded. In
this case we cannot conclude that y = 0 from the fact that (e, y) = 0. Consider the case
when B = R2 , C = R2 and e = (1, 0). Then for each r > 0, Dr (e) contains the positive
y-axis and hence is unbounded.
We note that this theorem fails to hold if the requirement that there exists x ∈ C with
T x ∈ int C ∗ is dropped.
Take B = R3 , C = {(x, y, z) ∈ R3 : x, z ≥ 0, 2xz ≥ y 2 }. Define T by T (x, y, z) =
(x + 1, y + 1, 0). Then T is monotone, hemicontinuous (even bounded). (1, −1, 1) ∈ C

11
and T (1, −1, 1) = (2, 0, 0) ∈ C ∗ . If u = (x, y, z) ∈ C with T u ∈ C ∗ , then y = −1 and
hence x > 0. Hence for any such u, (T u, u) = x(x + 1) > 0.
Theorem 5.6 appears, in, some form and other Browder [9], Mosco [75] and Hartman
and Stampacchia [45]. The papers were written almost at the same time and there are
some overlapping results contained in those papers. Finite Dimensional Case

Let K be a closed convex cone in Rn and f a map from K into Rn such that
x ∈ K, f (x) ∈ K ∗ , (f (x, x)) = 0.
In particular, if K = Rn+ ,
{x = (x1 , x2 , · · · , xn ) ∈ Rn : xi ≥ 0, i = 1, 2, · · · , n} ,
then the particular problem can be stated as follows:
n
X
x ≥ 0, f (x) ≥ 0, (f (x), x) = xi f (xi ) = 0.
i=1

If further f (x) = M x + b where M is a given real square matrix of order n and b is a given
column vector in Rn , then the above problem is called linear complementarity problem
(LCP in short) and it can be stated as follows:
Find w1 , w2 , · · · , wn and (x1 , x2 , · · · , xn ) such that
w = M x + b, w ≥ 0, x ≥ 0, wi xi = 0, i = 1, 2, · · · , n.
Otherwise, in general, the problem is known as a nonlinear complementarity problem
(NCP in short).
We shall now illustrate the LCP by a numerical example.

An Example
As a specific example of an LCP in Rn , let
   
2 1 −5
n = 2, M = , q= .
1 2 −6
In this case the problem is to solve
w1 − 2x1 − x2 = −5
w2 − x1 − 2x2 = −6
w1 , w2 , x1 , x2 ≥ 0, w1 x1 = w2 x2 = 0.
This can be expressed in the form of vector equation as:

         
1 0 −2 −1 −5
w1 + w2 + x1 + x2 =
0 1 −1 −2 −6
w1 , w2 , x1 , x2 ≥ 0, w1 x1 = w2 x2 = 0.

As special cases we have the following results for Rn .

12
Theorem 5.7. Let f : K → Rn be continuous, monotone, then NCP has a solution. In
particular if f is continuous and strongly monotone , then the solution exists uniquely.

Theorem 5.8. Let f : K → Rn be continuous, monotone and such that f (0) ∈ K ∗ (or
f (0) = 0). Then there exists a solution to the NCP.

Theorem 5.9. Let f : K → Rn be continuous, monotone and such that there exists an
x ∈ K with f (x) ∈ int K ∗ . Then there exists a solution to the NCP.

Lemke [64] and Eaves [27] discussed the existence of stationary points and nature of the
set of all stationary points of the pair (f, K) in Rn where K = Rn+ . Lemke [64] discussed
the linear case by considering affine function. A basic theorem of Lemke [65] states as
follows:

Theorem 5.10 (Lemke). Given an affine map f : Rn+ → Rn and a d ∈ Rn+ there is a
piecewise affine map x : R+ → Rn+ such that x(t) is a stationary point of (f, Dtn ) with

d · x(t) = t where
Dtn = x ∈ Rn+ : d · x ≤ 1 .


There are several matrices used in LCP.

Definition 5.11. Let M be square matrix of order n. M is said to positive definite if

n X
X n
yT M y = yi Mij yj > 0 for all 0 6= y ∈ Rn .
i=1 j=1

Positive semi-definite if

y T M y ≥ 0 for all y ∈ Rn .

Composite Matrix if

y T M y ≥ 0 for all y ≥ 0 and strictly copositive if strictly inequality holds for all y ≥ 0.

Composite plus Matrix if it is copositive matrix and if

y T (M + M T ) = 0, whenever y ≥ 0 satisfies y T M y = 0.

P-matrix if all the principal subdeterminants of M are positive.

Q-matrix if the LCP has a solution for every q ∈ Rn .

nondegenerate matrix if all the principal subdeterminants are nonzero.

degenerate if it is not nondegenerate.

13
z-matrix if mij ≤ 0 for all i 6= j

J-matrix if

M z ≥ 0, z T M z ≥ 0, z ≥ 0, ⇒ z = 0.

6 SEMI INNER-PRODUCT SPACE

AND VARIATIONAL INEQUALITY
In this section we discuss the concept of semi-inner product (sip in short), which was
introduced by Lumer [69] in the year 1961 and subsequently studied by Giles [38] and
several other mathematicians. We then study variational inequality in sip space.
Let V be a complex vector space. A sip on V is a complex function [ , ] on V × V with
the following properties: for x, y, z ∈ V and λ ∈ C,
(i) [x + y, z] = [x, z] + [y, z],
[λx, y] = λ[x, y],
(ii) [x, x] > 0 for x 6= 0,
(iii) |[x, y]|2 ≤ [x, x][y, y].
V along with a sip defined on it is called a sip space. A sip space has the homogeneity
property when the sip satisfies
(iv) [x, λy] = λ[x, y].
With the aim of carrying over Hilbert space type arguments to the theory of Banach
spaces Lumer [69] introduced the concept of sip. But the generality of the axiom system
defining the sip is a serious limitation of any extensive development of a theory of sip
spaces parallel to the theory of inner-product spaces. Let X be a normed linear space
and let X ∗ be its dual.
The unit ball of X is

U = {x ∈ X : kxk ≤ 1} and its boundary

S = {x ∈ X : kxk = 1} is the unit sphere of X.

U ∗ = {f ∈ X ∗ : kf k ≤ 1} and its boundary

S ∗ = {f ∈ X : kf k = 1} is the unit sphere of X ∗ .

The conjugate norm will also be denoted by k , k.
Theorem 6.1. A sip space V is a normed linear space with the norm kxk = [x, x]1/2 .
Every normed linear space can be made into a sip space (in general, in infinitely many
different ways) with the homogeneity property.
Theorem 6.2. A Hilbert space H can be made into a sip space in a unique way. A sip
space is an ip space if and only if the norm it induces satisfies parallelogram law.

14
6.0.1 Continuous and Uniform sip spaces
A continuous sip space is sip space V where the sip has the additional property:

(v) For all (x, y) ∈ S × S,

Re[y, x + λy] → Re[y, x] for all λ → 0.

The space is a uniformly continuous sip space when the above limit is approached uni-
formly for all (x, y) ∈ S × S.
A uniform sip space is a uniformly continuous sip space where the induced normed
linear space is uniformly continuous and complete.

6.0.2 Examples (Lp space for 1 < p < ∞)

The real Banach space Lp (X, S, µ), where 1 < p < ∞, can readily be expressed as a
uniform sip space with sip defined by
Z
1
[y, x] = p−2 y |x|p−1 sgn x dµ.
kxk X

For x, y in any sip space V , x is said to be normal to y and y is transversal to x if [y, x] = 0.

A vector x ∈ V is normal to a subspace N and N is transversal to x, if x is normal to
each y ∈ N .
A Banach space X is said to be smooth at a point x ∈ S if and only if there exists
a unique hyperplane of support of x, that is, there exists only one continuous linear
functional Ix ∈ E ∗ with kIx k = 1 and Ix (x) = 1. x is said to be a smooth Banach space
if it is smooth at every x ∈ S.
The norm of X is said to be Gateaux differentiable if for all x, y ∈ S and real λ,

kx + λyk − kxk
lim exists.
λ→0 λ
The norm is said to be uniformly Frechet differentiable if this limit is approached uniformly
for (x, y) ∈ S × S. Note that X is smooth at x ∈ S if and only if the norm is Gateaux
differentiable at x. We have

Theorem 6.3. In a continuous sip space, x is normal to y if and only if kx + λyk > kxk
for all complex number λ.

Theorem 6.4. A sip space is continuous (uniformly continuous) sip space iff the norm
is Gateaux (uniformly Frechet) differentiable.

Lemma 6.5. In a continuous sip space which is uniformly convex and complete in its
norm, there exists a nonzero vector normal to every proper closed vector subspace.

Lemma 6.6. A sip space is strictly convex if whenever [x, y] = kxk kyk, x, y 6= 0, then
y = λx for some real λ > 0.

15
Theorem 6.7 (Generalized Riesz-Fischer Theorem). In a continuous sip space V
which is uniformly convex and complete in its norm, to every continuous linear functional
f ∈ V ∗ , there exists a unique vector y ∈ V such that

f (x) = [x, y], x ∈ V.

Theorem 6.8. For a uniform sip space M , the dual space M ∗ is a uniform sip space
w.r.t. the sip defined by

bfx .fy c = [y, x].

Theorem 6.9. Every finite dimensional strictly convex, continuous sip space is a uniform
sip space.
Theorem 6.10. Let X be a continuous sips which is uniformly convex and complete in
its norm. If A is a bounded linear operator from X into itself, then there is a unique
bounded linear operator A+ such that

[Ax, y] = x, A+ y .
 

A+ is called the generalized adjoint of A: The proof uses Theorem 6.7 and is similar to
that of the corresponding for Hilbert space operators. Note that if X is a Hilbert space,
then the generalized adjoint is the usual Hilbert space adjoint.
We now discuss variational inequality and complementarity problem in semi-inner-
product space under certain contractive type conditions on the operators.
Let K be a closed convex subset of sips. If T : K → K, then a variational inequality
(VI in short) is stated as follows:

x ∈ K : [T x, y − x] ≥ 0 for all y ∈ K.

If K is closed convex cone, then the polar or dual of K, denoted by K + , is defined by

K + = {z ∈ X ∗ : [z.x] ≥ 0 for all x ∈ K} .

If K is a closed convex cone, then the complementarity problem (CP for short) is defined
as follows:

x ∈ K, T x ∈ K + and [T x, x] = 0.

Observe that if K is a closed convex cone, then (VI) and (CP) are equivalent.
We have
Theorem 6.11. Let X be uc and ss and K a nonempty closed convex subset of X. Let
T : K → K satisfy any one of the following conditions:
(i) kT x − T yk ≤ a kx − yk + b kT x − yk + c kT y − yk
where

−1 < a < 0, b ≥ 0, c ≥ 0, a + b + c = 0,

16
 (ii) kT x − T yk ≤ a1 kx − yk + a2 kx − T xk + a3 ky − T yk + a4 kx − T xk + a5 ky − T xk
where
5
X
−1 < a < 0, a2 , a3 , a4 , a5 ≥ 0, ai = 0.
i=1

Then there is a unique y0 ∈ K such that [T y0 , x − y0 ] ≥ 0 for all x ∈ K.

Theorem 6.12. Let X be Hilbert space and K a closed convex cone and let the conditions
of the previous theorem be satisfied. Then the CP has a unique solution, i.e., there is a
unique y0 ∈ X such that

y0 ∈ K, T y0 ∈ K ∗ and (T y0 , y0 ) = 0.

Theorem 6.13. Let X be uc and ss and K a nonempty closed convex subset of X. Let
T : K → K be nonexpansive. Then there exists some y0 ∈ K such that

[T y0 + y0 , y0 ] = 0.

References
[1] George Allen, Variational Inequalities Complementarity Problems and Duality The-
orems, JMAA, 58, (1977), 1-10.

[2] Alfred Auslender, Marc. Teboulle, Entropy Proximal Decomposition Methods for
Convex Programms and Variational Inequalities, Math. Prog. Ser A 91, (2001), 33 -
47.

[3] A. EI-Arni, Generalized Quasi-variational Inequalities with Non-compact Sets,

JMAA, 241, (2000), 189 - 197.

[4] A EI-Arni, Generalized Quasi-variational inequalities on Non-compact Sets with

Pseudo-monotone Operators, JMAA, 249, (2000), 515 - 526.

[5] M. S. Bazaras, J. J. Goode and M.Z. Nashed, A nonlinear complementarity problem

in mathematical programming in Banach space, Proc. Amer. Math. Soc. 35 (1972),
165 - 170.

[6] A. Behera and G.K. Panda, Nonlinear Random Variational Inequality Problem of
Mathematical Programming in Banach Spaces, Opsearch, 36 (1), (1999), 35 - 41.

[7] A. Behera and Lopamudra Nayak, On Nonlinear-type Inequality Problem, Ind. J.

Pure Appl. Math., 30 (9) (1999), 911 - 923.

[8] A. Behera and Lopamudra Nayak, A Variational-type Inequality,Opsearch, 36 (2)

(1999), 107 - 112.

17
 [9] F.E. Browder, Nonlinear variational inequalities and maximal monotone mappings
in Banach spaces, Math. Annalen, 176 (1968), 89 - 113.
[10] F.E. Browder, Existence and approximation of solutions of nonlinear variational in-
equalities, Proc. Acad. Sci. U. S. 56 (1966a), 1080 - 1086.
[11] F.E. Browder, On the unification of calculus of variation and the theory of monotone
nonlinear operators in Banach spaces, ibid (1966b), 419 - 425.
[12] F.E. Browder, Nonlinear monotone operators and convex sets in Banach spaces, Bull.
Amer. Math. Soc. 71 (1965a), 780 - 58.
[13] F.E. Browder, On a theorem of Beurling and Livingstone, Canad. J. Math.17 (1965b),
367 - 372.
[14] F.E. Browder, Variational boundary value problems for quasilinear elliptic equations
of arbitrary order, Proc. Natl. Acad. Sci., U.S. 50 (1963), 31 - 37.
[15] B.D. Craven and B. Mond, Complementarity over arbitrary cone, Z.O.R. (1977).
[16] Jean-Pierre Crouzeix, Patrice Marcotte and Daolizhu, Conditions Ensuring the Ap-
plicability of Cutting Plane Methods for Solving Variational Inequalities, math. Prog.
Ser A 88, (2000), 521 - 539.
[17] R. Chandrasekharan, A special case of the complementarity pivot problem, Opsearch,
7 (1970) 263 268.
[18] R.W. Cottle and G.B. Dantzig, Complementarity pivot theory of mathematical pro-
gramming, Linear Algebra and its Appl. 1 (1968), 108 - 125.
[19] R.W. Cottle and G.B. Dantzing, A Generalization of the Linear Complementarity
Problem, Journal of Cominatorial Theory, 8 (1970), 79 - 90.
[20] Aris Daniilidis and Nicolas Hadjisavvas, Coercivity Conditions and Variational in-
equalities, Math. Prog. 86, (1999), 433 - 438.
[21] A.T. Dash and S. Nanda, A complementarity problem in mathematical programming
in Banach space, J. Math. Analysis Appl. 98 (1984).
[22] Androas Domokos, Solution Sensitivity of Variational Inequalities, JMAA, 230,
(1999), 382 - 389.
[23] Helmut Dietrich, A Smooth Dual Gap Function Solution to a Class of Quasi-
variational Inequalities, JMAA, 235 (1999), 380 - 393.
[24] O.D. Donato and G. Maier, The linear Complementarity Problem, Management Sci.,
17 (1971), 612 - 634.
[25] O.D.Donato and G. Maier, Mathematical programming methods for the inelastic
analysis of reinforced concrete frames allowing for limited rotation capacity, Int. J.
Numer. Methods Eng.4 (1972), 307 - 329.

18
[26] Stelle Dafermous, Exchange Price Equilibria and Variational Inequality, Math. Prog.
46 (1990), 391 - 402.

[27] B.C. Eaves, on the basis theorem of complementarity, Math. Programming 1 (1971),
68 - 75.

[28] M. Edelstein, On nearest points of sets in uniformly convex Banach spaces, J. London
Math. Soc.43 (1968) 375 - 77.

[29] C. M. Elliott, On a Variational Inequality Formulation of an Electromechanical

Machine moving boundary Problem and its Approximation by the Finite Element
Method, J. Inst. Math. Appl. 25 (1980), 121 - 131.

[30] C.M. Elliott and V. Janavosky, A Variational Inequlity Approach to Hele Shaw Flow
with a Moving Boundary, Proc. Royal Soc. Edinberg 88A (1981), 93 - 107.

[31] S.C. Fang and E.L. Peterson, Generalized Variational Inequalities, J. Optm. Theory
Appl. 38 (3), (1982), 363 - 383.

[32] Ashok Ganguly and Kamal Wadhwa, A variational Inequality Problem in Non-
compact Sets, Indian J. Math. 39 (3), 1997, 213 - 220.

[33] B. Garcia, Some classes of matrices in Linear complementarity problem Math. Pro-
gramming 5 (1973), 299 - 310.

[34] Bjorn Gustafssion, Application of Variational Inequalities to a Moving Boundary

Problem for Hele Shaw Flows, SIAM J. of Math. Anal. 16, (2) (1985), 279 - 300.

[35] F. Gianessi, On Some Connection among Variational Inequalities Combinatorial and

Continuous Optimization, Anals of Operation research, 58 (1985), 181 - 200.

[36] F. Gianessi, A remark on Infinite-dimentional Variational Inequalities, Estrattoda Le

Mathematiche, XLIX (1994), Fascicolo II.

[37] F.Gianessi and A.A. Khan, Regulation of Non-coercive Quasi Variational Inequalities,
Control and Cybernatics, 29 (1), (2000).

[38] J. R. Giles, Classes of semi-inner-product spaces, Trans. Amer. Math. Soc. 129 (1967),
436 - 46.

[39] M.S. Gowda and Thomas I. Seidman, Generalized Complementarity Problems,

JMAA,46, (1990), 329 - 340.

[40] M.S. Gowda and Yoon Song, On Semidefinite Linear Complementarity Problems,
Math. Prog. Ser A 88 (2000), 575 - 587.

[41] K.M. Ghosh, Fixed-point theorems, Pure Math Manuscript 3 (1984), 51 - 53.

[42] J.R. Giles, Classes of semi-inner-product spaces, Trans. Amer. Math. Soc. 129 (1967),
436 - 46.

19
[43] M. Gregus, A fixed-point theorem in Banach spaces, Boll. Un. Mat.Ital. 5 (17) A
(1980), 193 - 198.

[44] G.E. Hardy and T.D. Rogers, A generalization of a fixed-point theorem of Reich,
Chand, Math. Bull, 16 (1973) 201 - 206.

[45] Hartman and G. Stampacchia, On some nonlinear elliptic differential functional equa-
tions, Acta. Math. 115 (1966), 271 - 310.

[46] G.J. Habetler and A.L. Price, Existence theory of generalized nonlinear complemen-
tary problem, J. Optim. Theory Appl. 7 (1971), 223 - 239.

[47] G.J. Habetler and M.M. Kostreva, On a direct algorithm for nonlinear complemen-
tarity problems SIAM Journ. Control and optim. 16(3) (1978), 504 - 511

[48] P.T. Harker and J.S. Pang, Finite Dimensional Variational Inequality and Comple-
mentarity Problem: A Survey of Theory Algorithms and Applications, Math. Prog.
48, (1990), 161 - 217.

[49] Keisuke Hotta and Akiko Yoshise, Global Convergence of a class of Non-interior
Point Algorithms Using Chen-Harker-Kanzow-Smale Functions for Non-linear Com-
plementarity Problems, Math. Prog. Ser A, 86, (1999), 105 - 133.

[50] Bingsheng He, Inexact Implicit Methods for Monotone General Variational Inequal-
ities, Math. Prog. Ser A,86, (1999), 199 - 217.

[51] Chena-Fing Hu, Solving Variational Inequalities in a Fuzzy Environment, JMAA,

249, 527 - 538.

[52] Nan-jing Huang and Chuan-xian Deng, Auxiliary Principle and Iterative Algo-
rithms for Generalized Set-valued Strongly Non-linear Mixed Variational Inequalities,
JMAA, 256, (2001), 345 - 359.

[53] G.Isac, Exceptional Family Elements and the Solvability of Variational Inequalities
for Unbounded Sets in Infinite Dimensional Hilbert Spaces,JMAA, 246, (2000), 544
- 556.

[54] M.C. Joshi and R.K. Bose, some Topics in Nonlinear Functional Analysis, Wiley
Eastern Ltd (1985).

[55] Jin-Mun Jeong, Chul-Yen Park and Jong-Yeoul Park, Parabolic Variational Inequal-
ities and Their Lipschitz Perturbations in Hilbert Spaces, Ind. J. Pure Appl. Math.
31 (6), (2000), 603 - 620.

[56] S. Karamaradian, The nonlinear complementarity problem with applications I, J.

Optm. Theory Appl. 4 (1969) 87 - 98.

[57] S. Karamadian, The Nonlinear Complementarity Problem with Applications, II,J. of

Optm. Theoy Appl. 4 (1969), 167 - 181.

20
[58] S. Karamardian, Generalized complementarity problem, J. Optimization Theory
Appl., 8(3) (1971), 161 - 168.

[59] S. Karamardian, The complementarity problem, Math. Programming 2 (1972), 107

- 129.

[60] Akhtar A. Khan, Auxiliary Problem Principle Extended to Monotone Variational

Inequalities, Tamakang Journal of Mathematics , 27 (1996), 117 - 124.

[61] D. Kinderlehrer and G. Sampacchia, An Introduction to Variational Inequalities and

their Applications, Academic Press, New York 1980.

[62] Arunima Kumari, On Some Generalized Multi-Valued Variational Inequalities, Ind.

J. Pure Appl. Math. 31 (6) (2000), 667 - 674.

[63] J.L. Lions and G. Stampacchia, Variational inequalities, Comm. Pure Appl. Math.
20 (1967), 493 - 519.

[64] C.E. Lemke, Bimatrix equilibrium points and mathematical programming, Manage-
ment Sci. Ser. A, 11 (1965) 168 - 169.

[65] C. E. Lemke, Bimatrix equilibrium points and mathematical programming (J. B.

Rosen, O. L. Mangasarian and K. Ritter, eds.) Academic New York (1970)

[66] C.E. Lemke, Recent results on complementarity problems, in Nonlinear programming

(j.B. Rosen, O.L. Managasarian and K. Ritter, eds.), Academic New York (1970).

[67] C.E. Lemke, A Survey of Complementarity Theory, Variational Inequalities and Com-
plementarity Problems, (R.W. Cottle, F. Gianessi and J. Lions eds) John wiley and
Sons 1980, Chapter 5, 213 - 239.

[68] C.E. Lemke and J.T. Howson Jr., Equilibrium points of bimatrix games, SIAM J.
Appl. Math. 12 (1964), 413 - 423.

[69] G.Lumer, Semi-inner-product spaces, Trans. Amer. Math. Soc. 100 (1961), 29 -43.

[70] Kunquan Lan and Jeffrey Webb, Variational Inequalities and Fixed Point Theorems
for PM-Maps, JMAA, 224, (1998), 102 - 116.

[71] Li-Wei-Liu and Yu-Qiang Li, On Generalized Set-valued Variational Inclusion,

JMAA, 261 (2001), 231 - 240.

[72] Dinh The Luc, Existence Results for Densely Pseudomonotone Variational Inequali-
ties, JMAA, 254, (2001), 291 - 308.

[73] B. Mond, On the complex complementarity problem, Bull. Austral. Math. Soc. 9
(1973), 249 - 257.

[74] O.G. Mancino and G.G. Stampacchia, Convex programming and variational inequal-
ities, J. Optm. Theory Appl. 9(1) (1972), 3 - 23.

21
[75] U. Mosco, Convergence of convex sets and solutions of variational inequalities, Adv.
Math. 3 (1966), 510 - 585.

[76] U. Mosco, A remark on a theorem of F.E. Browder, J. Math. Analysis Appl. 20

(1967a), 90 - 93.

[77] U. Mosco, Approximation of the solution of some variational inequalities, Ann Scuolo
Normals sup. Pisa 21 (1967b), 373 - 934.

[78] K.G. Murty, On a characterization of P- matrices, SIAM J. Appl. Math. 20(3) (1971),
378 - 384.

[79] K.G. Murty, On the number of solutions of the complementarity problem and span-
ning properties of complementary cones, Linear Algebra and its Appl.5 (1972), 65 -
108.

[80] K.G.Murty, Note on a Bard-type scheme for solving the complementarity problem,
Opsearch 11, 2-3 (1974), 123 - 130.

[81] J. More, Coercivity Conditions in Nonlinear Complementarity Problem, SIAM Re-

view 16 (1974) 1 - 16.

[82] S.R. Mohan, Existence of Solutions range for Linear Complementarity Problems with
Z-matrix, Math. Programming Study 7 (1970), 108 - 119.

[83] R.N. Mukherjee and H.L. Verma, Sensitivity Analysis of Generalized Variational
Inequalities, JMAA, 167 (2) (1992), 299 - 304.

[84] Sribatsa Nanda and Sudarsan Nanda, A complex nonlinear complementarity prob-
lem, Bull. Austral.Math. Soc. 19 (1978), 437 - 444.

[85] Sribatsa Nanda and Sudarsan Nanda, A nonlinear complemtantarity problem in Ba-
nach space ibid 21 (1980), 351 - 356.

[86] Sribatsa Nanda and Sudarsan Nanda, On stationary points and the complementarity
problem, ibid 20 (1979a), 77 - 86.

[87] Sribatsa Nanda and Sudarsan Nanda, A nonlinear complementarity problem in Math-
ematical Programming in Hilbert space, ibid 20 (1979b), 233 - 236.

[88] Sudarsan Nanda, A note on a theorem on a nonlinear complementarity problem ibid

27 (1978), 161 - 163.

[89] S. Nanda, The nonlinear complementarity problem, J.Orissa Math. Soc. 1(1) (1982),
61 - 68.

[90] S. Nanda, A nonlinear Complementarity Problem in Semi-inner-product-Space, Ren-

diconti di math 2 (1982), 167 - 171.

22
[91] S. Nanda, A remark on a Nonlinear Complementarity Problem in Semi-inner-product
Space, Rendiconti di Mat. 4 (1983), 807 - 809.

[92] Sudarsan Nanda, Generalized quasi complementarity problems, J. Math. Anal. Appl.
120 (1986), 321 - 327.

[93] Sudarsan Nanda, Nonlinear complementarity problem in mathematical programming

in Banach Space, Indian J. Pure Appl. Math. 18 (3) (1987), 215 218.

[94] Sudarsan Nanda, Nonlinear complementarity problem in elasticity, Opsearch 27 (2)

(1990), 122 - 124.

[95] Sudarsan Nanda, On a complementarity problem in Banach space, Proc. Amer. Math.
Soc. 21 (1994), 1203 - 1205.

[96] S.Nanda, Nonlinear Analysis, Norosa Pub. House, new Delhi (2013).

[97] S.Nanda, A note on complementarity problem in mathematical programming in Ba-

nach space, (Unpublished).

[98] M.A Noor, Generalized quasi complementarity problems, J.Math. Appl. 120 (1986),
321 - 327.

[99] M.A. Noor, Convergence analysis of the iterative methods for quasi complementarity
problem, Internat. J. Math. and Math.Sci. 11 (2) (1988), 319 - 334.

[100] M.A. Noor, Iterative algorithms for semi-linear quasi complementarity problems, J.
Math. Anal. Appl. 145 (1990), 402 - 412.

[101] M.N. Noor, Nonconvex functions and variational inequality, JOTA 87 (3) (1995),
615 - 630.

[102] M.A. Noor, Monotone Nonlinear Variational Inequality, Mathematica 47 (1982), 99

- 118.

[103] M.A. Noor, Strongly Nonlinear Variational Inequality, CR Math Rep Acad Sci
Canda 4 (1982), 213 - 218.

[104] M.A. Noor, Generalized Nonlinear Variational Inequlaity, Journ. Math. Anal. Appl.
126 (1987), 78 - 84.

[105] M.A. Noor, Quasi-Variational Inequality, Appl Math Letters, (1988) 119 - 122.

[106] M.A. Noor, On Nonlinear Variational Inequality, Int. J. Math & Math Sci 14 (2)
1991, 399 - 402.

[107] M.A. Noor, On Nonlinear Complementarity Problem, JMAA, 128 (1987), 211 - 216.

[108] Muhammad Aslam Noor, Algorithm for General Monotone Mixed Variational In-
equality, JMAA, 229 (1999), 330 - 343.

23
[109] Muhammad Aslam Noor, On a Class of Variational Inequalities, JMAA, 128 (1987).

[110] Muhammad Aslam Noor, An Interative Scheme for a Class of Quasi-variational

Inequalities, JMAA, 110 (1985), 463 - 468.

[111] Muhammad Aslam Noor, Varaitional Inequalities for Fuzzy Mappings, FSS 55
(1993), 309 - 312.

[112] Muhammad Aslam Noor, Projection Method for Monotone Variational Inequalities,
JMAA 237 (1999), 405 - 412.

[113] Muhammad Aslam Noor, Three Step Iterative Algorithms for Multivalued Quasi-
variational Inequalities, JMAA 255 (2001), 589 - 604.

[114] Muhammad Aslam Noor, Solvability of Multivalued General Mixed Variational In-
equalities, JMAA 261 (261) (2001), 390 - 402.

[115] M.A. Noor and E.H. Al-shemas, Fixed point methods for nonlinear complementarity
problems, Indian J. Math. 35 (1993), 71 - 97.

[116] W. Oettli and E. Blum, From optimization and variational inequalities to equilib-
rium problems, Math. Student 63 (1994), 123 - 145.

[117] J. Parida and A. Sen, A variational-like inequality for multifunctions with applica-
tions, J. Math. Anal. Appl. 124 (1987), 73 - 81.

[118] J. Parida and A. Sen, A variational Inequality for multifunctions with applications,
J. Math. Anal. Appl. 124 (1987), 73 - 81.

[119] J. Parida and B. Sahoo, On the complex nonlinear complementarity problem , ibid
14 (1976a), 129 - 136.

[120] J. Parida and B. Sahoo, Existence theory for the complex nonlinear complementarity
problem, ibid 14 (1976b), 417 - 435.

[121] J. Parida, A. Sen and A. Kumar, A linear Complementarity Problem Involving

Subgradient, Bull. Austral. Math. Soc. 37 (1988), 345 - 351.

[122] J. Park and Sangho Kum, An Application of a Browder type fixed point Theorem
to Generalized Variational Inequalities, JMAA, 218 (1987), 519 - 526.

[123] G.K. Panda and N. Dash, On a Variational Type Inequality and its omplementarity
Problem in Hausdorff Topological Spaces, Ind. J. Pure Appl. Math. 31 (2) (2000),
153 - 160.

[124] Hou-Duo Qi, Li-Zhi Liao and Zheng-Hua Lin, Regularized Smoothing Aproximation
to Vertical Complementarity Problems, JMAA, 230 (1999), 261 - 276.

[125] A. Ravindran, A computer routine for quadratic and linear programming problems
[H], Commun. ACM 15 (9) (1972), 818 - 820.

24
[126] A. Ravindran, A comparison of the primal-simplex and complementary pivot meth-
ods for linear programming, Naval Res. Logistics Q. 20(1)(1973), 96 - 100.

[127] S. Reich, Some remarks concerning contraction mappings, Canad. Math. Bull.14
(1971), 121 - 124, MR 45, 1145.

[128] B.E. Rhoades, A comparison of various definitions of contractive mappings, Trans.

Amer. Math. Soc. 226 (1977), 257 - 289.

[129] A.H. Siddiqi, Recent developments in applicable mathematics, Macmillan Indian

Ltd. (1994).

[130] A.H.Siddiqi, Some remarks on variational and quasivariational inequalities of mono-

tone operators, preprint (IC / 90 / 215) ICTP, Italy (1990).

[131] A.H. Siddiqi and Q.H. Ansari, General strongly nonlinear variational inequalities,
J. Math. Anal. Appl. 166 (1992), 386 - 392.

[132] A.H. Siddiqi and Q.H. Ansari, An algorithm for a class of quasivariational inequal-
ities, Journ. Math. Anal.Appl. 145 (1990), 413 - 418.

[133] H. Scarf, The approximation of fixed points of a continuous map. SIAM J. Appl.
Math. 15 (1967), 328 - 343.

[134] R. Saigal, On the class of complementary cones and Lemkes algorithm, SIAM Journ.
Appl. Math. 23 (1972), 46 - 60.

[135] R. Saigal, A note on a special linear complementarity problem, Opsearch 7 (3)

(1970), 175 - 183.

[136] S. Simons, Variational inequalities via the Hann- Banach theorem, Arch. Math. 31
(1978), 482 - 490.

[137] M. Sakai, Applications of Variational Inequalities to the Existence Theorem on

Quadrature Domains, Trans. Amer. Math. Soc. 276 (1983), 267 - 279.

[138] Michel Thera, Existence results for the nonlinear complementarity problem and
applications to nonlinear analysis, J. Math. Anal.Appl. 154 (1991), 572 - 584.

[139] Ram U Verma, Nonlinear Uniformly monotone operators and associated nonlinear
variational inequality, Applicable Analysis, 66 (1997), 101 - 106.

[140] Ram U Verma, Variational inequality in locally convex Hausdroff topological vector
space, Arch Math. 71 (1998), 246 - 248.

[141] Ram U Verma, Nonlinear variational inequality on convex subsets of Banach Space,
Appl. Math. Letters, 10(4)(1997), 25 - 27.

[142] Ram U Verma, On monotone nonlinear variational inequality problems, Comment

Math Univ. Corolinal. 39(1) (1998), 9 - 98.

25
[143] Ram U Verma, Nonlinear monotone variatiomnal inequality, Comm. Appl. Anal 2
(1998), 151 - 156.

[144] L.T. Watson, Solving nonlinear complementarity problem by homotopy methods,

SIAM J. Control and Optm. 17(1) (1979) 36.

[145] J.C. Yao, Variational inequality, Appl Math Letters 5 (1992), 39 - 42.

[146] J.C. Yao, Application of variational inequality to nonlinear analysis, Appl Math
Letters 4 (1991), 89 - 92.

26