full
search.png

Search

close.png

Cancel

arrow
Volume 14, Issue 1
A Modified Projection and Contraction Method for a Class of Linear Complementarity Problems

B. S. He

J. Comp. Math., 14 (1996), pp. 54-63.

Published online: 1996-02

Preview Full PDF 3307 27394

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-14-54, author = {B. S. He}, title = {A Modified Projection and Contraction Method for a Class of Linear Complementarity Problems}, journal = {Journal of Computational Mathematics}, year = {1996}, volume = {14}, number = {1}, pages = {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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9219.html} }
TY - JOUR T1 - A Modified Projection and Contraction Method for a Class of Linear Complementarity Problems AU - B. S. He JO - Journal of Computational Mathematics VL - 1 SP - 54 EP - 63 PY - 1996 DA - 1996/02 SN - 14 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9219.html KW - AB -

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.

B. S. He. (1996). A Modified Projection and Contraction Method for a Class of Linear Complementarity Problems. Journal of Computational Mathematics. 14 (1). 54-63. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard