Outer approximated projection and contraction method for solving variational inequalities

Abstract

AbstractIn this paper we focus on solving the classical variational inequality (VI) problem. Most common methods for solving VIs use some kind of projection onto the associated feasible set. Thus, when the involved set is not simple to project onto, then the applicability and computational effort of the proposed method could be arguable. One such scenario is when the given set is represented as a finite intersection of sublevel sets of convex functions. In this work we develop an outer approximation method that replaces the projection onto the VI’s feasible set by a simple, closed formula projection onto some “superset”. The proposed method also combines several known ideas such as the inertial technique and self-adaptive step size.Under standard assumptions, a strong minimum-norm convergence is proved and several numerical experiments validate and exhibit the performance of our scheme.