Skip to main navigation Skip to search Skip to main content

Conjugate gradient method for the linear complementarity problem with S-matrix

  • Dong Hui Li*
  • , Yi Yong Nie
  • , Jin Ping Zeng
  • , Qing Na Li
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we present a conjugate gradient method for solving the linear complementarity problem that involves an S-matrix. At each step, we solve a lower-dimensional system of linear equations by conjugate gradient method. The method terminates at the exact solution of the problem after a finite number of iterations. Moreover, the computational complexity of the proposed method is no more than the computational complexity of a conjugate gradient method for solving a system of linear equations. Preliminary numerical experiments show that the method is efficient.

Original languageEnglish
Pages (from-to)918-928
Number of pages11
JournalMathematical and Computer Modelling
Volume48
Issue number5-6
DOIs
Publication statusPublished - Sept 2008
Externally publishedYes

Keywords

  • Conjugate gradient method
  • Linear complementarity problem
  • S-matrix

Fingerprint

Dive into the research topics of 'Conjugate gradient method for the linear complementarity problem with S-matrix'. Together they form a unique fingerprint.

Cite this