Iterative Algorithms for the Linear Complementarity Problem

Simple item page
dc.contributor.authorKappel, Nicholas W.en
dc.contributor.authorWatson, Layne T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:27Zen
dc.date.available2013-06-19T14:36:27Zen
dc.date.issued1984en
dc.description.abstractDirect 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.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000901/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000901/01/CS84002-R.pdfen
dc.identifier.trnumberCS84002-Ren
dc.identifier.urihttp://hdl.handle.net/10919/19431en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleIterative Algorithms for the Linear Complementarity Problemen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS84002-R.pdf
Size:
1.41 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports