A Class Of Globally Convergent Algorithms For Pseudomonotone Variational Inequalities

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 di#er in the tools which are used to construct the separating hyperplane. Our general scheme subsumes an extragradienttype projection method, a globally and locally superlinearly convergent Josephy-Newton-type method, a certain minimization-based method, and a splitting technique. 1 INTRODUCTION Given a function F : R n # R n and a set C # R n , the classical variational inequality problem [1, 3, 8, 9, 5], abbreviated VIP(F, C), is to find a point x such that x # C, #F ..