Convergence analysis of a projection algorithm for variational inequality problems

Abstract

In this paper, we propose a projection based Newton-type algorithm for solving the variational inequality problems. A comprehensive study is conducted to analyze both global and local convergence properties of the algorithm. In particular, the algorithm is shown to be of superlinear convergence when the solution is a regular point. In addition, when the Jacobian matrix of the underlying function is positive definite at the solution or the solution is a non-degenerate point, the algorithm still possesses its superlinear convergence. Compared to the relevant projection algorithms in literature, the proposed algorithm is of remarkable advantages in terms of its generalization and favorable convergence properties under relaxed assumptions.