Related to the system of generalized set-valued nonlinear implicit quasi-variationalinequalities (1.2), we now consider a new system of generalized implicit Wiener-Hopfequations (4.1). And we will establish the equivalence between them. This equivalence isthen used to suggest a number of new iterative algorithms for solving the given systems ofvariational inequalities.
To be more precise, let , , where I is the identity operator, and are two projection operators, and are two convex sets. We consider the following problem offinding , such that , and
(4.1)
where , are constants. (4.1) is called the system of generalizedimplicit Wiener-Hopf equations.
If , we obtain the following system of generalized Wiener-Hopfequations from (4.1), which is of finding such that , and
(4.2)
where , are constants.
If , , we obtain the following Wiener-Hopf equation from (4.2), whichis of finding such that and
(4.3)
where is a constant.
Lemma 4.1 The system of generalized set-valued nonlinear implicitquasi-variational inequalities (1.2) has solutionssuch that, if and only if the system of generalized implicit Wiener-Hopf equations(4.1) has solutionsandsuch that, , where
(4.4)
and, are constants.
Proof Let such that , be a solution of (1.2), then by Lemma 2.6, we know that satisfy (2.3).
Let , , then by (2.3), we have , , which is just (4.4). And we have
Using the fact and , we obtain (4.1). That is to say, and such that , is also the solution of (4.1).
Conversely, let and such that , be a solution of (4.1). Then we have
Now, by invoking Lemma 2.3 and the above relations, we have
Thus , where
is a solution of (1.2). □
If , we obtain the following lemma from Lemma 4.1.
Lemma 4.2 The system of generalized set-valued nonlinear quasi-variationalinequalities (1.1) has solutionssuch that, if and only if the system of generalized Wiener-Hopf equations (4.2)has solutionsandsuch that, , where
(4.5)
and, are constants.
Using the system of Wiener-Hopf equations technique, Lemma 4.1 and Lemma 2.7, weconstruct the following iterative algorithms.
Algorithm 4.3 Let H be a real Hilbert space, and be two nonempty closed convex sets in H, be two nonlinear mappings, be two set-valued mappings, . For any given , such that , , , . We compute , , , , and by the following iterative schemes:
(4.6)
(4.7)
(4.8)
(4.9)
(4.10)
(4.11)
where .
If , we have the following iterative algorithm from Algorithm4.3.
Algorithm 4.4 For any given , such that , , , , we compute , , , , and by the following iterative schemes:
where .
Theorem 4.5 Let H be a real Hilbert space, andbe two nonempty closed convex sets in H. For, let nonlinear mappingsbe-Lipschitz continuous and-relaxed co-coercive with respect to the ith argument, be-H-Lipschitz continuous, ifAssumption 2.4 holds and there exist constantssuch that
(4.12)
then there existsatisfying the system of generalized implicit Wiener-Hopf equations (4.1).So, the problem (1.2) admits solutionsand sequences, , , , andwhich are generated by Algorithm 4.3 converge to x, y, , , andrespectively.
Proof By (4.8), we have
(4.13)
Since is -relaxed co-coercive with respect to the first argument andLipschitz continuous, we have
(4.14)
and
(4.15)
From -H-Lipschitz continuity of and (4.10), we have
(4.16)
Combining (4.13), (4.14), (4.15) and (4.16), we obtain
(4.17)
Similarly, we can have
(4.18)
By (4.6), Lemma 2.3 and Assumption 2.4,
which implies that
(4.19)
Similarly, we can obtain
(4.20)
By (4.17)-(4.20), we have
(4.21)
where
Let
then as . By (4.12), we know that . So, (4.21) implies that and are both Cauchy sequences. By (4.19) and (4.20), we know that and are both Cauchy sequences respectively. So, there exist and such that , , and as . In a similar way as in Theorem 3.3, we know and are also Cauchy sequences and there exist and such that and .
By the continuity of the mappings , , , , , and Algorithm 4.3, as , we have
where , are constants. That is just (4.4). By Lemma 4.1, we knowthat satisfy the generalized implicit Wiener-Hopf equations (4.1).So, we claim that is a solution of the problem (1.2). This completes theproof. □
If , we do not need Assumption 2.4 and we can obtain thefollowing theorem from Theorem 4.5.
Theorem 4.6 Let H be a real Hilbert space, K be a nonempty closed convex set in H. For, let nonlinear mappingsbe-Lipschitz continuous and-relaxed co-coercive with respect to the ith argument, be-H-Lipschitz continuous if there existconstantssuch that
then there existsatisfying (4.5). So, the generalized Wiener-Hopfequations (4.2) and the problem (1.1) admit the same solutionsand sequences, , , , andwhich are generated by Algorithm 4.4 converge to x, y, , , andrespectively.
Remark 4.7 It is the first time that the system of generalized Wiener-Hopf equationstechnique has been used to solve the system of generalized variational inequalities problem.And for a suitable and appropriate choice of the mappings , and , Theorem 3.3 and Theorem 4.5 include many importantknown results of variational inequality as special cases.
Remark 4.8 It is easy to see that a γ-strongly monotone mapping mustbe a -relaxed co-coercive mapping, whenever , . Therefore, the class of the -relaxed co-coercive mappings is a more general one. Hence, theresults presented in the paper include many known results as special cases.