An algorithm for the linear complementarity problem
Published in International Journal of Computer Mathematics • Jan 1, 1978
Authors:
Layne T. Watson
Abstract
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.
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!