Abstract.
In this paper we develop the convergence theory of a general class of projection and contraction algorithms (PC method), where an extended stepsize rule is used, for solving variational inequality (VI) problems. It is shown that, by defining a scaled projection residue, the PC method forces the sequence of the residues to zero. It is also shown that, by defining a projected function, the PC method forces the sequence of projected functions to zero. A consequence of this result is that if the PC method converges to a nondegenerate solution of the VI problem, then after a finite number of iterations, the optimal face is identified. Finally, we study local convergence behavior of the extragradient algorithm for solving the KKT system of the inequality constrained VI problem. \keywords{Variational inequality, Projection and contraction method, Predictor-corrector stepsize, Convergence property.} \amsclass{90C30, 90C33, 65K05.}
Author information
Authors and Affiliations
Additional information
Accepted 5 September 2000. Online publication 16 January2001.
Rights and permissions
About this article
Cite this article
Xiu, N., Wang, C. & Zhang, J. Convergence Properties of Projection and Contraction Methods for Variational Inequality Problems. Appl Math Optim 43, 147–168 (2001). https://doi.org/10.1007/s002450010023
Published:
Issue Date:
DOI: https://doi.org/10.1007/s002450010023