Even more with the Lemke complementarity algorithm

DOI10.1007/BF01580589MaRDI QIDQ3720322zbMATH OpenFDO

Authors Philip C. Jones

Publication date 1986

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01580589

zbMATH Keywords

Lemke linear complementarity algorithmtermination result

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• On finite termination of an iterative method for linear complementarity problems
• scientific article; zbMATH DE number 819136
• On processability of Lemke's algorithm
• A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
• scientific article; zbMATH DE number 1559033

Cites work

• A variable dimension algorithm for the linear complementarity problem
• Bimatrix Equilibrium Points and Mathematical Programming
• Complementary pivot theory of mathematical programming
• Computing an Optimal Invariant Capital Stock
• More with the Lemke complementarity algorithm

Cited in

(6)

• An algorithm for the linear complementarity problem with upper and lower bounds
• On processability of Lemke's algorithm
• On generalizations of positive subdefinite matrices and the linear complementarity problem
• More on positive subdefinite matrices and the linear complementarity problem
• On solving a larger subclass of linear complementarity problems by Lemke's method
• Stable economic depreciation

This page was built for publication: Even more with the Lemke complementarity algorithm

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