  In this paper, we generalize the classical extragradient algorithm for
solving variational inequality problems by utilizing nonzero normal vectors of
the feasible set. In particular, conceptual algorithms are proposed with two
different linesearchs. We then establish convergence results for these
algorithms under mild assumptions. Our study suggests that nonzero normal
vectors may significantly improve convergence if chosen appropriately.
