- Research Article
- Open Access
A New Projection Algorithm for Generalized Variational Inequality
Journal of Inequalities and Applications volume 2010, Article number: 182576 (2010)
We propose a new projection algorithm for generalized variational inequality with multivalued mapping. Our method is proven to be globally convergent to a solution of the variational inequality problem, provided that the multivalued mapping is continuous and pseudomonotone with nonempty compact convex values. Preliminary computational experience is also reported.
We consider the following generalized variational inequality. To find and such that
where is a nonempty closed convex set in , is a multivalued mapping from into with nonempty values, and and denote the inner product and norm in , respectively.
Theory and algorithm of generalized variational inequality have been much studied in the literature [1–9]. Various algorithms for computing the solution of (1.1) are proposed. The well-known proximal point algorithm  requires the multivalued mapping to be monotone. Relaxing the monotonicity assumption,  proved if the set is a box and is order monotone, then the proximal point algorithm still applies for problem (1.1). Assume that is pseudomonotone, and  described a combined relaxation method for solving (1.1); see also [12, 13]. Projection-type algorithms have been extensively studied in the literature; see [14–17] and the references therein. Recently,  proposes a projection algorithm for generalized variational inequality with pseudomonotone mapping. In , choosing needs solving a single-valued variational inequality and hence is computationally expensive; see expression (2.1) in . In this paper, we introduce a different projection algorithm for generalized variational inequality. In our method, can be taken arbitrarily. Moreover, the main difference of our method from that of  is the procedure of Armijo-type linesearch; see expression (2.2) in  and expression (2.2) in the next section.
Let be the solution set of (1.1), that is, those points satisfying (1.1). Throughout this paper, we assume that the solution set of problem (1.1) is nonempty and is continuous on with nonempty compact convex values satisfying the following property:
Property (1.2) holds if is pseudomonotone on in the sense of Karamardian . In particular, if is monotone, then (1.2) holds.
The organization of this paper is as follows. In the next section, we recall the definition of continuous multivalued mapping, present the algorithm details, and prove the preliminary result for convergence analysis in Section 3. Numerical results are reported in the last section.
Let us recall the definition of continuous multivalued mapping. is said to be upper semicontinuous at if for every open set containing , there is an open set containing such that for all . F is said to be lower semicontinuous at , if we give any sequence converging to and any , there exists a sequence that converges to . is said to be continuous at if it is both upper semicontinuous and lower semicontinuous at . If is single valued, then both upper semicontinuity and lower semicontinuity reduce to the continuity of .
Let denote the projector onto and let be a parameter.
and solve problem (1.1) if and only if
Choose and three parameters , and Set
If for some , stop; else take arbitrarily .
Let be the smallest nonnegative integer satisfying
where . Set .
Compute where , and
Let and go to Step 1.
Since has compact convex values, has closed convex values. Therefore, in Step 2 is uniquely determined by .
If is a single-valued mapping, the Armijo-type linesearch procedure (2.2) becomes that of Algorithm 2.2 in .
We show that Algorithm 2.2 is well defined and implementable.
If is not a solution of problem (1.1), then there exists a nonnegative integer satisfying (2.2).
Suppose that for all , we have
where . Since is lower semicontinuous, , and as , for each , there is such that . Since ,
So . Let in (2.4), we have . This contradiction completes the proof.
For every and ,
See [15, Lemma ].
Let be a closed convex set in , a real-valued function on , and the set . If is nonempty and is Lipschitz continuous on with modulus , then
where denotes the distance from to .
See [14, Lemma ].
Let solve the variational inequality (1.1) and let the function be defined by (2.3). Then and . In particular, if then
It follows from (2.3) that
where the first inequality follows from (2.2) and the last one follows from Lemma 2.6 and . If , then because . It remains to be proved that . Since , we have
on the other hand, assumption (1.2) implies that
Adding the last two expressions, we obtain that
It follows that
where the second inequality follows from assumption (1.2) and . Thus is verified.
3. Main Results
If is continuous with nonempty compact convex values on and condition (1.2) holds, then either Algorithm 2.2 terminates in a finite number of iterations or generates an infinite sequence converging to a solution of (1.1).
Let be a solution of the variational inequality problem. By Lemma 2.8, . We assume that Algorithm 2.2 generates an infinite sequence . In particular, for every . By Step 3, it follows from Lemma in  that
where the last inequality is due to . It follows that the squence is nonincreasing, and hence is a convergent sequence. Therefore, is bounded and
By the boundedness of , there exists a convergent subsequence converging to .
If is a solution of problem (1.1), we show next that the whole sequence converges to . Replacing by in the preceding argument, we obtain that the sequence is nonincreasing and hence converges. Since is an accumulation point of , some subsequence of converges to zero. This shows that the whole sequence converges to zero, hence .
Suppose now that is not a solution of problem (1.1). We show first that in Algorithm 2.2 cannot tend to . Since is continuous with compact values, Proposition in  implies that is a bounded set, and so the sequence is bounded. Therefore, there exists a subsequence converging to . Since is upper semicontinuous with compact values, Proposition in  implies that is closed, and so . By the definition of , we have
If , then . The lower continuity of , in turn, implies the existence of such that converges to . Since , , and . Therefore and
Letting , we obtain the contradiction
with being continuous. Therefore, is bounded and so is .
It follows from (2.3) that
Since and are bounded, we have the sequence and hence the sequence is bounded. Thus, for some ,
Therefore, each function is Lipschitz continuous on with modulus . Noting that and applying Lemma 2.7, we obtain that
It follows from (3.8) and Lemma 2.8 that
Then (3.2) implies that
By the boundedness of , we obtain that Since is continuous and the sequences and are bounded, there exists an accumulation point of such that . This implies that solves the variational inequality (1.1). Similar to the preceding proof, we obtain that .
4. Numerical Experiments
In this section, we present some numerical experiments for the proposed algorithm. The MATLAB codes are run on a PC (with CPU Intel P-T2390) under MATLAB Version 22.214.171.12404(R14) Service Pack 1. We compare the performance of our Algorithm 2.2 and [15, Algorithm 1]. In the Tables 1 and 2, "It." denotes number of iteration, and "CPU" denotes the CPU time in seconds. The tolerance means when the procedure stops.
and let be defined by
Then the set and the mapping satisfy the assumptions of Theorem 3.1 and (0,0,1) is a solution of the generalized variational inequality. Example 4.1 is tested in . We choose , and for our algorithm; , and for Algorithm 1 in . We use as the initial point.
and be defined by
Then the set and the mapping satisfy the assumptions of Theorem 3.1 and (1,0,0,0) is a solution of the generalized variational inequality. We choose , and for the two algorithms.
Allevi E, Gnudi A, Konnov IV: The proximal point method for nonmonotone variational inequalities. Mathematical Methods of Operations Research 2006, 63(3):553–565. 10.1007/s00186-005-0052-2
Auslender A, Teboulle M: Lagrangian duality and related multiplier methods for variational inequality problems. SIAM Journal on Optimization 2000, 10(4):1097–1115. 10.1137/S1052623499352656
Bao TQ, Khanh PQ: A projection-type algorithm for pseudomonotone nonlipschitzian multivalued variational inequalities. In Generalized Convexity, Generalized Monotonicity and Applications, Nonconvex Optimization and Its Applications. Volume 77. Springer, New York, NY, USA; 2005:113–129. 10.1007/0-387-23639-2_6
Ceng LC, Mastroeni G, Yao JC: An inexact proximal-type method for the generalized variational inequality in Banach spaces. Journal of Inequalities and Applications 2007, 2007:-14.
Fang SC, Peterson EL: Generalized variational inequalities. Journal of Optimization Theory and Applications 1982, 38(3):363–383. 10.1007/BF00935344
Fukushima M: The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem. Mathematical Programming 1996, 72(1):1–15. 10.1007/BF02592328
He Y: Stable pseudomonotone variational inequality in reflexive Banach spaces. Journal of Mathematical Analysis and Applications 2007, 330(1):352–363. 10.1016/j.jmaa.2006.07.063
Saigal R: Extension of the generalized complementarity problem. Mathematics of Operations Research 1976, 1(3):260–266. 10.1287/moor.1.3.260
Salmon G, Strodiot J-J, Nguyen VH: A bundle method for solving variational inequalities. SIAM Journal on Optimization 2003, 14(3):869–893.
Rockafellar RT: Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization 1976, 14(5):877–898. 10.1137/0314056
Konnov IV: On the rate of convergence of combined relaxation methods. Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika 1993, (12):89–92.
Konnov IV: Combined Relaxation Methods for Variational Inequalities, Lecture Notes in Economics and Mathematical Systems. Volume 495. Springer, Berlin, Germany; 2001:xii+181.
Konnov IV: Combined relaxation methods for generalized monotone variational inequalities. In Generalized Convexity and Related Topics, Lecture Notes in Econom. and Math. Systems. Volume 583. Springer, Berlin, Germany; 2007:3–31.
He Y: A new double projection algorithm for variational inequalities. Journal of Computational and Applied Mathematics 2006, 185(1):166–173. 10.1016/j.cam.2005.01.031
Li F, He Y: An algorithm for generalized variational inequality with pseudomonotone mapping. Journal of Computational and Applied Mathematics 2009, 228(1):212–218. 10.1016/j.cam.2008.09.014
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/S0363012997317475
Facchinei F, Pang JS: Finite-Dimensional Variational Inequalities and Complementary Problems. Springer, New York, NY, USA; 2003.
Karamardian S: Complementarity problems over cones with monotone and pseudomonotone maps. Journal of Optimization Theory and Applications 1976, 18(4):445–454. 10.1007/BF00932654
Aubin J-P, Ekeland I: Applied Nonlinear Analysis, Pure and Applied Mathematics. John Wiley & Sons, New York, NY, USA; 1984:xi+518.
This work is partially supported by the National Natural Science Foundation of China (no. 10701059), by the Sichuan Youth Science and Technology Foundation (no. 06ZQ026-013), and by Natural Science Foundation Projection of CQ CSTC (no. 2008BB7415).
About this article
Cite this article
Fang, C., He, Y. A New Projection Algorithm for Generalized Variational Inequality. J Inequal Appl 2010, 182576 (2010). https://doi.org/10.1155/2010/182576
- Variational Inequality
- Multivalued Mapping
- Variational Inequality Problem
- Projection Algorithm
- Proximal Point Algorithm