1. Introduction
In recent years, many theories of variational inequality types and its special forms have been extended and generalized to research a variety of applications and problems arising from several fields such as applied mathematics, optimization, control theory, equilibrium problems and nonlinear programming problems, etc. In 1964, a variational inequality problem (VIP) was introduced by Stampacchia [
1].
In 2016, Noor [
2] introduced and researched the existence of solution by using fixed point theory for a system of extended general variational inequalities with six strongly monotone operators.
From the above results, we intend in this manuscript to consider a system of extended general variational inequalities with nonlinear operators, more precisely, relaxed cocoercive operators which are more generalized than strongly monotone operators. We show that a system of extended general variational inequalities include general variational inequality and several other classes of variational inequalities as special cases. Using the projection method, it is shown that a system of extended general variational inequalities (SEGVI) are equivalent to the nonlinear projection equations. This alternative equivalent problem is used to consider the existence and convergence of a solution of a system of extended general variational inequalities under appropriate conditions.
2. Preliminaries
Hereafter, we take that H be a real Hilbert space whose norm and inner product are denoted by and respectively. Let be two closed convex subsets in H.
For given nonlinear operators
:
consider a problem of finding
with
such that
The problem (
1) is said to be a system of extended general variational inequalities (SEGVI) with six nonlinear operators.
We consider some special cases of the (SEGVI) (
1).
- I.
If
and
a closed convex subset in
then problem (
1) reduces to find
with
such that
for all
The system (
2) is said to be a system of extended general variational inequalities with four nonlinear operators.
- II.
If
and
a closed convex subset in
then problem (
1) reduces to find
with
such that
for all
and
The system (
3) is said to be a system of general variational inequalities with four nonlinear operators.
- III.
If
then problem (
2) reduces to find
with
such that
for all
The problem of type (
4) is said to be an extended general variational inequality (EGVI), which was studied by Noor [
3].
For adequate and suitable conditions of spaces and operators, we can obtain several new and known classes of variational inequalities. Recent applications, iteration methods, existence problem and convergence theory are related to the above problems (see [
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14] and other references therein).
Now, we digest some definitions and related basic properties which are indispensable in the following discussions.
Lemma 1. ([
15])
Let Ω
be a closed and convex subset in Then, for a given satisfiesif and only ifwhere is the projection of H onto Ω
in Remark 1. It is very well known that the projection operator is nonexpansive, i.e.,More information on the projection operator can be found in Section 3 of [16]. Definition 1. ([
17]) Let
H be a Hilbert space.
- (1)
An operator
T:
is said to be
α-strongly monotone, if for each
we have
for a constant
This implies that
that is,
T is
-expansive and when
it is expansive.
- (2)
An operator
T:
is said to be
β-Lipschitz continuous, if there exists a constant
such that
- (3)
An operator
T:
is said to be
μ-cocoercive, if there exists a constant
such that
Clearly, every
-cocoercive operator
T is
-Lipschitz continuous.
- (4)
An operator
T:
is said to be
relaxed α-cocoercive, if there exists a constant
such that
- (5)
An operator
T:
is said to be
relaxed -cocoercive, if there exists a constant
such that
For
T is
r-strongly monotone. This class of operators is more generalized than the class of strongly monotone operators. One can easily show that the following implication:
Lemma 2. ([
18])
Let and be two nonnegative real sequences satisfying the following condition:where is some nonnegative integer and is a sequence with and Then, From the auxiliary principle method of Glowinski et al. [
19], it is easy to show that we have the system (
1) equivalent to the following:
Find
with
and
where, for all
and
(see, [
3,
20]).
We use this equivalent problem to generate some iteration techniques for solving the system of extended general variational inequalities and its other variant kinds.
3. Results
In this section, we study about a system of extended general variational inequalities (SEGVI) (
7) being equivalent to a system of fixed point problems. This alternative equivalent problem is used to generate iteration schemes for solving problem (
7), by the method of Noor et al. [
21].
Lemma 3. ([
2])
The system of extended general variational inequalities (
7)
has a solution, with and if and only if with satisfies the relationswhere and . Lemma 3 implies that problem (
7) is equivalent to the relations of fixed point problems (
8) and (
9). Using the fixed point problems (
8) and (
9), we can suggest and analyze some iteration forms:
where
This alternative problem is used to propose the following iteration schemes for solving a system of extended general variational inequalities (SEGVI) (
7) and its variant kinds.
Algorithm 1. For given : and find and by the iterative schemeswhere Algorithm 1 can be viewed as a Gauss–Seidel method for solving system of extended general variational inequalities (SEGVI) (
7).
For adequate and suitable conditions of spaces and operators, we can obtain several new and known iteration schemes for solving system of extended general variational inequalities (SEGVI) and related problems. It has been shown [
22] that problem (
1) has a solution under some suitable conditions.
Now, we investigate the convergence analysis of Algorithm 1. This is the core of our following result.
Theorem 1. Let : be relaxed , , , , , -cocoercive and , , , , , -Lipschitz continuous operators, respectively. If the following conditions hold:
- (i)
,
,
- (ii)
, ,
, ,
- (iii)
for all
then sequences and obtained from Algorithm 1 converge to x and y, respectively.
Proof. Let
with
be a solution of (
7). Then, from (
11) and (
12), we have
Since operator
is relaxed
-cocoercive with constant
and
-Lipschitz continuous, then it follows that
In a similar way, we have
and
where we have used the property of operators
, respectively. Combining (
13)–(
16), we obtain
From (
10) and (
12), we have
In a similar way, from the property of operators
, we get
Combining (
18)–(
21), we have
From (
17) and (
22), put
we obtain
Thus,
which implies that
where
From conditions, we obtain
By Lemma 2, it follows from (
23) that
This completes the proof. ☐
Corollary 1. ([2], Theorem 4) Let
:
be strongly monotone with constants
,
,
,
,
,
and
,
,
,
,
,
-Lipschitz continuous operators, respectively. If the following conditions hold:
- (i)
, ,
- (ii)
, , , ,
- (iii)
for all
then sequences and obtained from Algorithm 1 converge to x and y, respectively.
Proof. In Theorem 1, from Definition 1, we take , we get the result of Corollary 1. ☐
On the other hand, using Lemma 3, one can easily show that
with
is a solution of (
7) if and only if
with
satisfies
This alternative problem can be used to propose and analyze the following iteration scheme for solving system (
7).
Algorithm 2. For given with find and by the iteration schemeswhere for all Now, we consider the convergence analysis of Algorithm 2, using the method of Theorem 1. For the sake of completeness and to convey an idea, we include all the details.
Theorem 2. Let operators : be relaxed , , , , , -cocoercive and , , , , , -Lipschitz continuous, respectively. If the following conditions hold:
- (i)
,
,
- (ii)
, ,
, ,
- (iii)
for all
then sequences and which are defined by Algorithm 2 converge to x and respectively.
Proof. Let
with
be a solution of (
7). Then, from (
6), (
14), (
16), (
27) and (
31), we have
Now, we put
then (
33) and (
35) have
Adding (
36) and (
37), we have
Thus,
which implies that
where
Therefore, by Lemma 2, it follows from (
38) that
This completes the proof. ☐
Corollary 2. ([2], Theorem 6) Let
:
be strongly monotone with constants
,
,
,
,
,
and
,
,
,
,
,
-Lipschitz continuous operators, respectively. If the following conditions hold:
- (i)
, ,
- (ii)
, , , ,
- (iii)
for all
then sequences and obtained from Algorithm 2 converge to x and y, respectively.
Proof. In Theorem 2, we take , and we get the result of Corollary 2. ☐
Open Problem Do Theorems 1 and 2 hold for a Banach space or other spaces?