An improved Lemke algorithm for convex quadratic programming with equality constraints

MaRDI QIDQ3370577zbMATH OpenFDO

Authors Bin Zhang, Zhong-Sheng Hua

Publication date 8 February 2006

zbMATH Keywords

convex quadratic programmingequality constraintsLemkelinear complementarity problem

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• On modified Lemke algorithm for solving quadratic programming problems
• scientific article; zbMATH DE number 1092140
• An interior point algorithm for convex quadratic programming with strict equilibrium constraints
• scientific article; zbMATH DE number 1293312
• On the average speed of Lemke's algorithm for quadratic programming

Cited in

(5)

• Capacity-constrained multiple-market price discrimination
• On modified Lemke algorithm for solving quadratic programming problems
• scientific article; zbMATH DE number 1092140 (Why is no real title available?)
• scientific article; zbMATH DE number 1117802 (Why is no real title available?)
• On the average speed of Lemke's algorithm for quadratic programming

This page was built for publication: An improved Lemke algorithm for convex quadratic programming with equality constraints

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