Lemke's algorithm

Known as: Lemke 
In mathematical optimization, Lemke's algorithm is a procedure for solving linear complementarity problems, and more generally mixed linear… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We present a single sufficient condition for the processability of the Lemke algorithm for semimonotone Linear Complementarity… (More)
  • figure 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
PURPOSE This article summarizes prior work in the learning sciences and discusses one perspective—situative learning—in depth… (More)
  • table 1
  • figure 1
  • table 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Conducting Video Research in the Learning Sciences: Guidance on Selection, Analysis, Technology, and Ethics Sharon J. Derry a… (More)
  • figure 1
  • figure 2
  • figure A-1
Is this relevant?
2008
2008
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We present an equivalent linear complementarity problem (LCP) formulation of the noncooperative Nash game resulting from the DSL… (More)
  • table 1
  • table 2
Is this relevant?
2005
2005
We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
  • Jack Lloyd
  • Proceedings of the IEEE International Conference…
  • 2005
We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1994
1994
We present the graph visualization system daVinci, an interactive tool that can be used by arbitrary application programs as a… (More)
  • figure 6
  • figure 8
Is this relevant?
1991
1991
In [13] Lemke and Howson showed how to find Nash equilibria [15] for bimatrix games by formulating the problem as an instance of… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
An efficient and numerically stable dual algorithm for positive definite quadratic programming is described which takes advantage… (More)
  • figure I
Is this relevant?