Live briefing
Everything about Lemke's algorithm
In mathematical optimization, Lemke's algorithm is a procedure for solving linear complementarity problems, and more generally mixed linear complementarity problems. It is named after Carlton E. Lemke. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Lemke's algorithmA 5-minute orientation
- Skim a recent paper: Investigation of Lemke Algorithm for Dynamic Rigid Plastic Response of Frame StructuresInfluential work since 2022
- Pick up a classic book: Economic foundations of symmetric programmingThe most-reprinted book on the subject
- Read the landmark paper: On a Generalization of the Lemke–Howson Algorithm to Noncooperative N -Person GamesCited 64 times
- Go sideways: Linear complementarity problemA closely related topic
- Go sideways: Complementarity theoryA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
On a Generalization of the Lemke–Howson Algorithm to Noncooperative N -Person Games
Copositive-plus Lemke algorithm solves polymatrix games
More with the Lemke complementarity algorithm
On the generation of all equilibrium points for bimatrix games through the Lemke—Howson Algorithm
A modified Lemke Algorithm for dynamic rigid plastic response of skeletal structures
Even more with the Lemke complementarity algorithm
The Lemke–Howson Algorithm Solving Finite Non-Cooperative Three-Person Games in a Special Setting
Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule
🆕 Influential since 2022
📚 Books worth reading
Economic foundations of symmetric programmingQuirino Paris · 2010- 📕A note on the Lemke-Howson algorithmLloyd S. Shapley · 1974
- 📕Caribou hunting in the upper Great LakesElizabeth Sonnenburg, Ashley K. Lemke · 2015
Pivoting and extensionsAlbert William Tucker, M. L. Balinski · 1974- 📕The linear complementary problemRolando A. Danao · 1978
- 📕The linear complementarity problemRolando A. Danao · 1978
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Linear complementarity problem In mathematical optimization theory, the linear complementarity problem (LCP) arises frequently in computational mechanics and encompasses the well-known…
- Complementarity theory A complementarity problem is a type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a function of two…
- Quadratic programming Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks…
- Criss-cross algorithm In mathematical optimization, the criss-cross algorithm is any of a family of algorithms for linear programming. Variants of the criss-cross algorithm…
- Active-set method In mathematical optimization, the active-set method is an algorithm used to identify the active constraints in a set of inequality constraints. The active…
- Relaxation (approximation) In mathematical optimization and related fields, relaxation is a modeling strategy. A relaxation is an approximation of a difficult problem by a nearby…
- Simplex algorithm In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming. The name of the algorithm is derived…
- Richard W. Cottle Richard W. Cottle (29 June 1934) is an American mathematician. He was a professor of Management Science and Engineering at Stanford University, starting…