Strong convergence of a double projection-type method for monotone variational inequalities in Hilbert spaces

We introduce a projection-type algorithm for solving monotone variational inequality problems in real Hilbert spaces without assuming Lipschitz continuity of the corresponding operator. We prove that the whole sequence of iterates converges strongly to a solution of the variational inequality. The method uses only two projections onto the feasible set in each iteration in contrast to other strongly convergent algorithms which either require plenty of projections within a step size rule or have to compute projections on possibly more complicated sets. Some numerical results illustrate the behavior of our method.