Iterative algorithms for the linear complementarity problem

From MaRDI portal





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 \textit{W. M. G. van Bokhoven} [A class of linear complementarity problems is solvable in polynomial time, unpublished paper, Dept. of Electrical Engineering, University of Technology, The Netherlands (1980)] 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.



Cites work


Cited in
(40)


Describes a project that uses

Uses Software






This page was built for publication: Iterative algorithms for the linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3800997)