# A Class of Globally Convergent Algorithms for Pseudomonotone Variational Inequalities

## Abstract

We describe a fairly broad class of algorithms for solving variational inequalities, global convergence of which is based on the strategy of generating a hyperplane separating the current iterate from the solution set. The methods are shown to converge under very mild assumptions. Specifically, the problem mapping is only assumed to be continuous and pseudomonotone with respect to at least one solution. The strategy to obtain (super)linear rate of convergence is also discussed. The algorithms in this class differ in the tools which are used to construct the separating hyperplane. Our general scheme subsumes an extragradient-type projection method, a globally and locally super linearly convergent Josephy-Newton-type method, a certain minimization-based method, and a splitting technique.

## Keywords

Variational Inequality Complementarity Problem Global Convergence Linear Complementarity Problem SIAM Journal## Preview

Unable to display preview. Download preview PDF.

## References

- [1]A. A. Auslender.
*Optimisation Méthodes Numériques*. Masson, Paris, 1976.MATHGoogle Scholar - [2]J. F. Bonnans. Local analysis of Newton-type methods for variational inequalities and nonlinear programming.
*Applied Mathematics and Optimization*, 29:161–186, 1994.MathSciNetMATHCrossRefGoogle Scholar - [3]R.W. Cottle, F. Giannessi, and J.-L. Lions.
*Variational Inequalities and Complementarity Problems: Theory and Applications*. Wiley, New York, 1980.MATHGoogle Scholar - [4]J.-P. Crouzeix. Characterizations of generalized convexity and generalized monotonicity, A survey. In J.-P. Crouzeix et al., editor,
*Generalized convexity, generalized monotonicity: Recent results*, pages 237–256. Kluwer Academic Publishers, 1998.CrossRefGoogle Scholar - [5]M. C. Ferris and J.-S. Pang (editors).
*Complementarity and variational problems: State of the Art*. SIAM Publications, 1997.MATHGoogle Scholar - [6]M. C. Ferris and J.-S. Pang. Engineering and economic applications of complementarity problems.
*SIAM Review*, 39:669–713, 1997.MathSciNetMATHCrossRefGoogle Scholar - [7]M.C. Ferris and O.L. Mangasarian. Error bounds and strong upper semicontinuity for monotone affine variational inequalities.
*Annals of Operations Research*, 47:293–305, 1993.MathSciNetCrossRefGoogle Scholar - [8]R. Glowinski, J.-L. Lions, and R. Trémolières.
*Numerical Analysis of Variational Inequalities*. North-Holland, Amsterdam, 1981.MATHGoogle Scholar - [9]P.T. Harker and J.-S. Pang. Finite-dimensional variational inequality problems: A survey of theory, algorithms and applications.
*Mathematical Programming*, 48:161–220, 1990.MathSciNetMATHCrossRefGoogle Scholar - [10]A.N. Iusem and B.F. Svaiter. A variant of Korpelevich’s method for variational inequalities with a new search strategy.
*Optimization*, 42:309–321, 1997.MathSciNetMATHCrossRefGoogle Scholar - [11]N.H. Josephy. Newton’s method for generalized equations. Technical Summary Report 1965, Mathematics Research Center, University of Wisconsin, Madison, Wisconsin, 1979.Google Scholar
- [12]S. Karamardian. Complementarity problems over cones with monotone and pseudomonotone maps.
*Journal of Optimization Theory and Applications*, 18:445–455, 1976.MathSciNetMATHCrossRefGoogle Scholar - [13]R. De Leone, O.L. Mangasarian, and T.-H. Shiau. Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmet-ric linear complementarity problem.
*Annals of Operations Research*, 22:43–54, 1990.MathSciNetMATHCrossRefGoogle Scholar - [14]W. Li. Remarks on matrix splitting algorithms for symmetric linear complementarity problems.
*SIAM Journal on Optimization*, 3:155–163, 1993.MathSciNetMATHCrossRefGoogle Scholar - [15]Z.-Q. Luo and P. Tseng. Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem.
*SIAM Journal on Optimization*, 2:43–54, 1992.MathSciNetMATHCrossRefGoogle Scholar - [16]O.L. Mangasarian. Convergence of iterates of an inexact matrix splitting algorithm for the symmetric monotone linear complementarity problem.
*SIAM Journal on Optimization*, 1:114–122, 1991.MathSciNetMATHCrossRefGoogle Scholar - [17]J.-S. Pang. Inexact Newton methods for the nonlinear complementarity problem.
*Mathematical Programming*, 36:54–71, 1986.MathSciNetMATHCrossRefGoogle Scholar - [18]S. M. Robinson. Strongly regular generalized equations.
*Mathematics of Operations Research*, 5:43–62, 1980.MathSciNetMATHCrossRefGoogle Scholar - [19]R.T. Rockafellar. Monotone operators and the proximal point algorithm.
*SIAM Journal on Control and Optimization*, 14:877–898, 1976.MathSciNetMATHCrossRefGoogle Scholar - [20]S. Schaible, S. Karamardian, and J.-P. Crouzeix. Characterizations of generalized monotone maps.
*Journal of Optimization Theory and Applications*, 76:399–413, 1993.MathSciNetMATHCrossRefGoogle Scholar - [21]M. V. Solodov and B. F. Svaiter. A truly globally convergent Newton-type method for the monotone nonlinear complementarity problem, 1998.
*SIAM Journal on Optimization*10 (2000), 605–625.MathSciNetMATHCrossRefGoogle Scholar - [22]M. V. Solodov and B. F. Svaiter. A new projection method for variational inequality problems.
*SIAM Journal on Control and Optimization*, 37:765–776, 1999.MathSciNetMATHCrossRefGoogle Scholar - [23]M. V. Solodov and P. Tseng. Modified projection-type methods for monotone variational inequalities.
*SIAM Journal on Control and Optimization*, 34:1814–1830, 1996.MathSciNetMATHCrossRefGoogle Scholar - [24]M.V. Solodov and B.F. Svaiter. A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator, 1998.
*Set-Valued Analysis*7 (1999), 323–345.MathSciNetMATHCrossRefGoogle Scholar - [25]M.V. Solodov and B.F. Svaiter. A globally convergent inexact Newton method for systems of monotone equations. In M. Fukushima and L. Qi, editors,
*Reformulation — Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods*, pages 355–369. Kluwer Academic Publishers, 1999.Google Scholar - [26]M.V. Solodov and B.F. Svaiter. A hybrid projection — proximal point algorithm.
*Journal of Convex Analysis*, 6:59–70, 1999.MathSciNetMATHGoogle Scholar