On the average speed of Lemke's algorithm for quadratic programming

DOI10.1007/BF01580649MaRDI QIDQ4721868zbMATH OpenFDO

Authors Yieh-Hei Wan

Publication date 1986

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

average number of stepsLemke algorithmpositive semi-definite matrices

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Recommendations

• A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
• Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
• scientific article; zbMATH DE number 4027159
• An improved Lemke algorithm for convex quadratic programming with equality constraints
• On modified Lemke algorithm for solving quadratic programming problems

Cites work

• Computational complexity of complementary pivot methods
• scientific article; zbMATH DE number 3880432 (Why is no real title available?)
• scientific article; zbMATH DE number 3332062 (Why is no real title available?)
• On the average number of steps of the simplex method of linear programming

Cited in

(6)

• Average complexity of divide-and-conquer algorithms
• Extending the quadrangle inequality to speed-up dynamic programming
• On modified Lemke algorithm for solving quadratic programming problems
• An improved Lemke algorithm for convex quadratic programming with equality constraints
• Random inequality constraint systems with few variables
• Imitation games and computation

This page was built for publication: On the average speed of Lemke's algorithm for quadratic programming

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