Robust implementation of Lemke's method for the linear complementarity problem

DOI10.1007/BFB0120781zbMATH Open0378.90055MaRDI QIDQ4159162FDOQ4159162

Authors:

Publication date: 1978

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (9)

• A symplectic pseudospectral method for constrained time-delayed optimal control problems and its application to biological control problems
• A global Newton method to compute Nash equilibria.
• A decomposition algorithm for quadratic programming
• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• Generalization of Murty's direct algorithm to linear and convex quadratic programming
• Large-scale linearly constrained optimization
• Models and methods of solution of quadratic integer programming problems
• Parallel pivotal algorithm for solving the linear complementarity problem
• George B. Dantzig and systems optimization

Uses Software

• DEVEX

This page was built for publication: Robust implementation of Lemke's method for the linear complementarity problem

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