An algorithm for the linear complementarity problem

Layne T. Watson · International Journal of Computer Mathematics · 1978

A practical algorithm for solving the linear complementarity problem is presented. This algorithm is based on the n-cycle algorithm, which is known to converge if M is a nondegenerate Q-matrix. A brief survey of other available algorithms is also given. Some typical test results are included.

Read the paper · More papers on PaperTik