Open Access
Translator Disclaimer
2013 New Double Projection Algorithm for Solving Variational Inequalities
Lian Zheng
J. Appl. Math. 2013: 1-8 (2013). DOI: 10.1155/2013/714397


We propose a class of new double projection algorithms for solving variational inequality problem, which can be viewed as a framework of the method of Solodov and Svaiter by adopting a class of new hyperplanes. By the separation property of hyperplane, our method is proved to be globally convergent under very mild assumptions. In addition, we propose a modified version of our algorithm that finds a solution of variational inequality which is also a fixed point of a given nonexpansive mapping. If, in addition, a certain local error bound holds, we analyze the convergence rate of the iterative sequence. Numerical experiments prove that our algorithms are efficient.


Download Citation

Lian Zheng. "New Double Projection Algorithm for Solving Variational Inequalities." J. Appl. Math. 2013 1 - 8, 2013.


Published: 2013
First available in Project Euclid: 14 March 2014

zbMATH: 1271.49007
MathSciNet: MR3064950
Digital Object Identifier: 10.1155/2013/714397

Rights: Copyright © 2013 Hindawi


Vol.2013 • 2013
Back to Top