Year: 1996
Journal of Computational Mathematics, Vol. 14 (1996), Iss. 1 : pp. 54–63
Abstract
Recently, we have proposed an iterative projection and contraction (PC) method for a class of linear complementarity problems (LCP)$^{[4]}$. The method was showed to be globally convergent, but no statement could be made about the rate of convergence. In this paper, we develop a modified globally linearly convergent PC method for linear complementarity problems. Both the method and the convergence proofs are very simple. The method can also be used to solve some linear variational inequalities. Several computational experiments are presented to indicate that the method is surprising good for solving some known difficult problems.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1996-JCM-9219
Journal of Computational Mathematics, Vol. 14 (1996), Iss. 1 : pp. 54–63
Published online: 1996-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 10