Open Access

An Implicit Extragradient Method for Hierarchical Variational Inequalities

Fixed Point Theory and Applications20102011:697248

https://doi.org/10.1155/2011/697248

Received: 20 September 2010

Accepted: 7 November 2010

Published: 28 November 2010

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 [124] 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 [2532]. 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
(24)

We need the following lemmas for proving our main result.

Lemma 2.1 (see [13]).

Let be a nonempty closed convex subset of a real Hilbert space . Let the mapping be -inverse strongly monotone, and let be a constant. Then, one has
(25)

In particular, if , then is nonexpansive.

Lemma 2.2 (see [32]).

Let be a nonempty closed convex subset of a real Hilbert space . Assume that the mapping is monotone and weakly continuous along segments, that is, weakly as . Then, the variational inequality
(26)
is equivalent to the dual variational inequality
(27)

3. Main Result

In this section, we will introduce our implicit extragradient algorithm and show its strong convergence to the unique solution of .

Algorithm 1.

Let be a closed convex subset of a real Hilbert space . Let be an -inverse strongly monotone mapping. Let be a (nonself) contraction with coefficient . For any , define a net as follows:
(31)

where is a constant.

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 .

Finally, if we take that , then VI (3.28) is reduced to
(329)
Equivalently,
(330)
This clearly implies that
(331)

Therefore, is the minimum-norm solution of .This completes the proof.

Remark 3.3.
  1. (1)

    Note that our Implicit Extragradient Algorithms (3.1) and (3.2) have strong convergence in an infinite dimensional Hilbert space.

     
  2. (2)

    In many problems, it is needed to find a solution with minimum norm; see [3438]. 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

Authors’ Affiliations

(1)
Department of Mathematics, Tianjin Polytechnic University
(2)
Department of Information Management, Cheng Shiu University

References

  1. Stampacchia G: Formes bilinéaires coercitives sur les ensembles convexes. Comptes rendus de I'Academie des. Sciences 1964, 258: 4413–4416.MathSciNetMATHGoogle Scholar
  2. Lions J-L, Stampacchia G: Variational inequalities. Communications on Pure and Applied Mathematics 1967, 20: 493–519. 10.1002/cpa.3160200302MathSciNetView ArticleMATHGoogle Scholar
  3. Liu F, Nashed MZ: Regularization of nonlinear ill-posed variational inequalities and convergence rates. Set-Valued Analysis 1998,6(4):313–344. 10.1023/A:1008643727926MathSciNetView ArticleMATHGoogle Scholar
  4. Korpelevič GM: An extragradient method for finding saddle points and for other problems. Èkonomika i Matematicheskie Metody 1976,12(4):747–756.MathSciNetGoogle Scholar
  5. Glowinski R: Numerical Methods for Nonlinear Variational Problems, Springer Series in Computational Physics. Springer, New York, NY, USA; 1984:xv+493.View ArticleGoogle Scholar
  6. Iusem AN, Svaiter BF: A variant of Korpelevich's method for variational inequalities with a new search strategy. Optimization 1997,42(4):309–321. 10.1080/02331939708844365MathSciNetView ArticleMATHGoogle Scholar
  7. Khobotov EN: Modification of the extra-gradient method for solving variational inequalities and certain optimization problems. USSR Computational Mathematics and Mathematical Physics 1989,27(5):120–127.View ArticleMATHGoogle Scholar
  8. Solodov MV, Svaiter BF: A new projection method for variational inequality problems. SIAM Journal on Control and Optimization 1999,37(3):765–776. 10.1137/S0363012997317475MathSciNetView ArticleMATHGoogle Scholar
  9. Aslam Noor M: Some developments in general variational inequalities. Applied Mathematics and Computation 2004,152(1):199–277. 10.1016/S0096-3003(03)00558-7MathSciNetView ArticleMATHGoogle Scholar
  10. Yao Y, Yao J-C: On modified iterative method for nonexpansive mappings and monotone mappings. Applied Mathematics and Computation 2007,186(2):1551–1558. 10.1016/j.amc.2006.08.062MathSciNetView ArticleMATHGoogle Scholar
  11. Censor Y, Gibali A, Reich S: Two extensions of Korpelevich's extragradient method for solving the variational inequality problem in Euclidean space. 2010.Google Scholar
  12. Censor Y, Gibali A, Reich S: The subgradient extragradient method for solving variational inequalities in Hilbert space. Journal of Optimization Theory and Applications. In pressGoogle Scholar
  13. Takahashi W, Toyoda M: Weak convergence theorems for nonexpansive mappings and monotone mappings. Journal of Optimization Theory and Applications 2003,118(2):417–428. 10.1023/A:1025407607560MathSciNetView ArticleMATHGoogle Scholar
  14. Yao Y, Liou YC, Marino G: Strong convergence of two iterative algorithms for nonexpansive mappings in Hilbert spaces. Fixed Point Theory and Applications 2009, 2009:-7.Google Scholar
  15. Yao Y, Liou Y-C, Wu Y-J: An extragradient method for mixed equilibrium problems and fixed point problems. Fixed Point Theory and Applications 2009, 2009:-15.Google Scholar
  16. Yao Y, Liou Y-C, Yao J-C: A new hybrid iterative algorithm for fixed-point problems, variational inequality problems, and mixed equilibrium problems. Fixed Point Theory and Applications 2008, 2008:-15.Google Scholar
  17. Yao Y, Liou Y-C, Yao J-C: Convergence theorem for equilibrium problems and fixed point problems of infinite family of nonexpansive mappings. Fixed Point Theory and Applications 2007, 2007:-12.Google Scholar
  18. Yao Y, Liou Y-C, Yao J-C: An extragradient method for fixed point problems and variational inequality problems. Journal of Inequalities and Applications 2007, 2007:-12.Google Scholar
  19. 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
  20. Cianciaruso F, Marino G, Muglia L, Yao Y: A hybrid projection algorithm for finding solutions of mixed equilibrium problem and variational inequality problem. Fixed Point Theory and Applications 2010, 2010:-19.Google Scholar
  21. Cianciaruso F, Marino G, Muglia L, Yao Y: On a two-step algorithm for hierarchical fixed point problems and variational inequalities. Journal of Inequalities and Applications 2009, 2009:-13.Google Scholar
  22. 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
  23. Zeng L-C, Ansari QH, Shyu DS, Yao J-C: Strong and weak convergence theorems for common solutions of generalized equilibrium problems and zeros of maximal monotone operators. Fixed Point Theory and Applications 2010, 2010:-33.Google Scholar
  24. Zeng L-C, Kum S, Yao J-C: Algorithm for solving a generalized mixed equilibrium problem with perturbation in a Banach space. Fixed Point Theory and Applications 2010, 2010: 22.View ArticleMathSciNetMATHGoogle Scholar
  25. Moudafi A, Maingé P-E: Towards viscosity approximations of hierarchical fixed-point problems. Fixed Point Theory and Applications 2006, 2006: 10.View ArticleMathSciNetMATHGoogle Scholar
  26. Xu H-K: Viscosity method for hierarchical fixed point approach to variational inequalities. Taiwanese Journal of Mathematics 2010,14(2):463–478.MathSciNetMATHGoogle Scholar
  27. Cianciaruso F, Colao V, Muglia L, Xu H-K: On an implicit hierarchical fixed point approach to variational inequalities. Bulletin of the Australian Mathematical Society 2009,80(1):117–124. 10.1017/S0004972709000082MathSciNetView ArticleMATHGoogle Scholar
  28. Maingé P-E, Moudafi A: Strong convergence of an iterative method for hierarchical fixed-point problems. Pacific Journal of Optimization 2007,3(3):529–538.MathSciNetMATHGoogle Scholar
  29. Moudafi A: Krasnoselski-Mann iteration for hierarchical fixed-point problems. Inverse Problems 2007,23(4):1635–1640. 10.1088/0266-5611/23/4/015MathSciNetView ArticleMATHGoogle Scholar
  30. Yao Y, Liou Y-C: Weak and strong convergence of Krasnoselski-Mann iteration for hierarchical fixed point problems. Inverse Problems 2008,24(1):8.MathSciNetView ArticleMATHGoogle Scholar
  31. Marino G, Colao V, Muglia L, Yao Y: Krasnoselski-Mann iteration for hierarchical fixed points and equilibrium problem. Bulletin of the Australian Mathematical Society 2009,79(2):187–200. 10.1017/S000497270800107XMathSciNetView ArticleMATHGoogle Scholar
  32. Lu X, Xu H-K, Yin X: Hybrid methods for a class of monotone variational inequalities. Nonlinear Analysis: Theory, Methods & Applications 2009,71(3–4):1032–1041. 10.1016/j.na.2008.11.067MathSciNetView ArticleMATHGoogle Scholar
  33. Rockafellar RT: Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization 1976,14(5):877–898. 10.1137/0314056MathSciNetView ArticleMATHGoogle Scholar
  34. Sabharwal A, Potter LC: Convexly constrained linear inverse problems: iterative least-squares and regularization. IEEE Transactions on Signal Processing 1998,46(9):2345–2352. 10.1109/78.709518MathSciNetView ArticleMATHGoogle Scholar
  35. Cui Y-L, Liu X: Notes on Browder's and Halpern's methods for nonexpansive mappings. Fixed Point Theory 2009,10(1):89–98.MathSciNetMATHGoogle Scholar
  36. Liu X, Cui Y: The common minimal-norm fixed point of a finite family of nonexpansive mappings. Nonlinear Analysis: Theory, Methods & Applications 2010,73(1):76–83. 10.1016/j.na.2010.02.041MathSciNetView ArticleMATHGoogle Scholar
  37. Yao Y, Chen R, Xu H-K: Schemes for finding minimum-norm solutions of variational inequalities. Nonlinear Analysis: Theory, Methods & Applications 2010,72(7–8):3447–3456. 10.1016/j.na.2009.12.029MathSciNetView ArticleMATHGoogle Scholar
  38. Yao Y, Xu HK: Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications. Optimization. In pressGoogle Scholar

Copyright

© Yonghong Yao and Yeong Cheng Liou. 2011

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.