Abstract

As a well-known numerical method, the extragradient method solves numerically the variational inequality of finding such that , for all . In this paper, we devote to solve the following hierarchical variational inequality Find such that , for all . We first suggest and analyze an implicit extragradient method for solving the hierarchical variational inequality . It is shown that the net defined by the suggested implicit extragradient method converges strongly to the unique solution of in Hilbert spaces. As a special case, we obtain the minimum norm solution of the variational inequality .

1. Introduction

The variational inequality problem is to find such that

(11)

The set of solutions of the variational inequality problem is denoted by . It is well known that the variational inequality theory has emerged as an important tool in studying a wide class of obstacle, unilateral, and equilibrium problems; which arise in several branches of pure and applied sciences in a unified and general framework. Several numerical methods have been developed for solving variational inequalities and related optimization problems, see [1–24] and the references therein. In particular, Korpelevich's extragradient method which was introduced by Korpelevič [4] in 1976 generates a sequence via the recursion

(12)

where is the metric projection from onto , is a monotone operator, and is a constant. Korpelevich [4] proved that the sequence converges strongly to a solution of . Note that the setting of the space is Euclid space .

Recently, hierarchical fixed point problems and hierarchical minimization problems have attracted many authors' attention due to their link with some convex programming problems. See [25–32]. Motivated and inspired by these results in the literature, in this paper we are devoted to solve the following hierarchical variational inequality :

(13)

For this purpose, in this paper, we first suggest and analyze an implicit extragradient method. It is shown that the net defined by this implicit extragradient method converges strongly to the unique solution of in Hilbert spaces. As a special case, we obtain the minimum norm solution of the variational inequality .

2. Preliminaries

Let be a real Hilbert space with inner product and norm , and let be a closed convex subset of . Recall that a mapping is called -inverse strongly monotone if there exists a positive real number such that

(21)

A mapping is said to be -contraction if there exists a constant such that

(22)

It is well known that, for any , there exists a unique such that

(23)

We denote by , where is called the metric projection of onto . The metric projection of onto has the following basic properties:

(i) for all ;

(ii) for every ;

(iii) for all , ;

(iv) for all , .

Such properties of will be crucial in the proof of our main results. Let be a monotone mapping of into . In the context of the variational inequality problem, it is easy to see from property (iii) that

Note the fact that is a possible nonself mapping. Hence, if we take , then (3.1) reduces to

(32)

Remark 3.1.

We notice that the net defined by (3.1) is well defined. In fact, we can define a self-mapping as follows:

(33)

From Lemma 2.1, we know that if , the mapping is nonexpansive.

For any , we have

(34)

This shows that the mapping is a contraction. By Banach contractive mapping principle, we immediately deduce that the net (3.1) is well defined.

Theorem 3.2.

Suppose the solution set of is nonempty. Then the net generated by the implicit extragradient method (3.1) converges in norm, as , to the unique solution of the hierarchical variational inequality . In particular, if one takes that , then the net defined by (3.2) converges in norm, as , to the minimum-norm solution of the variational inequality .

Proof.

Take that . Since , using the relation (2.4), we have . In particular, if we take , we obtain

(35)

From (3.1), we have

(36)

Noting that is nonexpansive, thus,

(37)

That is,

(38)

Therefore, is bounded and so are , . Since is -inverse strongly monotone, it is -Lipschitz continuous. Consequently, and are also bounded.

From (3.6),(2.5), and the convexity of the norm, we deduce

(39)

Therefore, we have

(310)

Hence

(311)

By the property (ii) of the metric projection , we have

(312)

where is some appropriate constant. It follows that

(313)

and hence (by (3.7))

(314)

which implies that

(315)

Since , we derive

(316)

Next, we show that the net is relatively norm-compact as . Assume that is such that as . Put and .

By the property (ii) of metric projection , we have

(317)

Hence

(318)

Therefore,

(319)

In particular,

(320)

Since is bounded, without loss of generality, we may assume that converges weakly to a point . Since , we have . Hence, also converges weakly to the same point .

Next we show that . We define a mapping by

(321)

Then is maximal monotone (see [33]). Let . Since and , we have . On the other hand, from , we have

(322)

that is,

(323)

Therefore, we have

(324)

Noting that , , and is Lipschitz continuous, we obtain . Since is maximal monotone, we have and hence .

Therefore we can substitute for in (3.20) to get

(325)

Consequently, the weak convergence of and to actually implies that strongly. This has proved the relative norm-compactness of the net as .

Now we return to (3.20) and take the limit as to get

(326)

In particular, solves the following VI

(327)

or the equivalent dual VI (see Lemma 2.2)

(328)

Therefore, . That is, is the unique solution in of the contraction . Clearly this is sufficient to conclude that the entire net converges in norm to as .

In many problems, it is needed to find a solution with minimum norm; see [34–38]. Our Algorithm (3.2) solves the minimum norm solution of .

Declarations

Acknowledgments

The authors thank the referees for their comments and suggestions which improved the presentation of this paper. The first author was supported in part by Colleges and Universities, Science and Technology Development Foundation (20091003) of Tianjin and NSFC 11071279. The second author was supported in part by NSC 99-2221-E-230-006

Wang S, Marino G, Wang F: Strong convergence theorems for a generalized equilibrium problem with a relaxed monotone mapping and a countable family of nonexpansive mappings in a Hilbert space.Fixed Point Theory and Applications 2010, 2010:-22.Google Scholar

Peng J-W, Wu S-Y, Yao J-C: A new iterative method for finding common solutions of a system of equilibrium problems, fixed-point problems, and variational inequalities.Abstract and Applied Analysis 2010, 2010:-27.Google Scholar

Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.