“…There are several iterative methods for solving VIP (see, e.g., [4,5,7,11,18,30,33,35]). The basic idea consists of extending the projected gradient method for solving the problem of minimizing f (x) subject to x ∈ C given by 6) where {α n } is a positive real sequence satisfying certain conditions and P C is the metric projection onto C. For convergence properties of this method for the case in which f : R 2 → R is convex and differentiable function, one may see [2]. An immediate extension of method (1.6) to VIP is the projected gradient method for optimization problems, substituting the operator A for the gradient, so that we generate a sequence {x n } through:…”