Extensions of Lemke's algorithm for the linear complementarity problem

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1976 English Publisher:Springer Science and Business Media LLCJournal:Journal of Optimization Theory and Applications, volume 20, pages 397-416 (issn: 0022-3239, eissn: 1573-2878,

Copyright policy )

Authors: Todd, M. J.;

doi: 10.1007/bf00933128

Extensions of Lemke's algorithm for the linear complementarity problem

- Summary
- Subjects
- Metrics

Abstract

Lemke's algorithm for the linear complementarity problem fails when a desired pivot is not blocked. A projective transformation overcomes this difficulty. The transformation is performed computationally by adjoining a new row to a schema of the problem and pivoting on the element in this row and the unit constant column. Two new algorithms result; some conditions for their success are discussed.

Related Organizations

Cornell University
United States

Keywords

Nonlinear programming, Linear programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	9
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average