Algorithms for the Split Variational Inequality Problem
Numerical Algorithms
Hi-index | 0.00 |
We study two projection algorithms for solving the variational inequality problem in Hilbert space. One algorithm is a modified subgradient extragradient method in which an additional projection onto the intersection of two half-spaces is employed. Another algorithm is based on the shrinking projection method. We establish strong convergence theorems for both algorithms.