Abstract

In this paper, we revisit the numerical approach to variational inequality problems involving strongly monotone and Lipschitz continuous operators by a variant of projected reflected gradient method. Contrary to what done so far, the resulting algorithm uses a new simple stepsize sequence which is diminishing and nonsummable. This brings the main advantages of the algorithm where the construction of aproximation solutions and the formulation of convergence are done without the prior knowledge of the Lipschitz and strongly monotone constants of cost operators. The assumptions in the formulation of theorem of convergence are also discussed in this paper. Numerical results are reported to illustrate the behavior of the new algorithm and also to compare with others.