A NEW STRATEGY FOR SOLVING VARIATIONAL-INEQUALITIES IN BOUNDED POLYTOPES

We consider variational inequality problems where the convex set under consideration is a bounded polytope. We define an associated box constrained minimization problem and we prove that, under a general condition on the Jacobian, the stationary points of the minimization problems are solutions of the variational inequality problem. The condition includes the case where the operator is monotone. Based on this result we develop an algorithm that can solve large scale problems. We present numerical experiments.