On the average speed of Lemke's algorithm for quadratic programming
From MaRDI portal
Publication:4721868
DOI10.1007/BF01580649zbMath0613.90075MaRDI QIDQ4721868
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (3)
Average complexity of divide-and-conquer algorithms ⋮ Imitation games and computation ⋮ Random inequality constraint systems with few variables
Cites Work
This page was built for publication: On the average speed of Lemke's algorithm for quadratic programming