Descent methods for a class of generalized variational inequalities

摘要

In this paper we propose a class of differentiable gap functions in order to formulate a generalized variational inequality (GVI) problem, involving a set-valued map with closed and convex graph, as an optimization problem. We also show that under appropriate assumptions on the set-valued map, any stationary point of the equivalent optimization problem is a global optimal solution and solves the GVI. Finally, we describe descent methods for solving the optimization problem equivalent to the GVI and we prove its global convergence.