# ITERATIVE ALGORITHMS FOR THE LINEAR COMPLEMENTARITY PROBLEM

1984) ITERATIVE ALGORITHMS FOR THE LINEAR COMPLEMENTARITY PROBLEM. Technical Report CS84002-R, Computer Science, Virginia Tech. (

Full text available as: |

## Abstract

Direct complementary pivot algorithms for the linear complementarity problem with P-matrices are known to have exponential computational complexity. The analog of Gauss-Seidel and SOR iteration for linear complementarity problems with P-matrices has not been extensively developed. This paper extends some work of van Bokhoven to a class of nonsymmetric P-matrices, and develops and compares several new iterative algorithms for the linear complementarity problem. Numerical results for several hundred test problems are presented. Such indirect iterative algorithms may prove useful for large sparse complementarity problems.

Item Type: | Departmental Technical Report |
---|---|

Keywords: | linear complementarity problem, P-matrix, iterative algorithm, fixed point iteration, principal pivot submatrix, contraction mapping, computational complexity |

Subjects: | Computer Science > Historical Collection(Till Dec 2001) |

ID Code: | 901 |

Deposited By: | Administrator, Eprints |

Deposited On: | 13 May 2006 |