论文信息 - Extensions of Lemke's algorithm for the linear complementarity problem

Extensions of Lemke's algorithm for the linear complementarity problem

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.

M. Todd

[1] С. И. Радауцан. ИССЛЕДОВАНИЕ НЕКОТО РЫХ СЛОЖНЫХ ПОЛУПРОВОДНИКОВЫХ Т ВДРДЫХ РАСТВОРОВ И СОЕДИНЕНИЙ НА ОСНОВ Е ИНДИЯ , 1962 .

[2] M. Fiedler,et al. On matrices with non-positive off-diagonal elements and positive principal minors , 1962 .

[3] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[4] G. Dantzig,et al. COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .

[5] C. E. Lemke,et al. Recent results in complementarity problems , 1970 .

[6] B. Eaves. The Linear Complementarity Problem , 1971 .

[7] M. Todd. Complementarity Algorithms without Rays , 1973 .

[8] C. B. García,et al. Some classes of matrices in linear complementarity theory , 1973, Math. Program..