Description:
Computing stationary points -- Some pivot schemes for the linear complementarity problem -- An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds -- Robust implementation of Lemke's method for the linear complementarity problem -- Computational complexity of complementary pivot methods -- Characterization of linear complementarity problems as linear programs -- On solving linear complementarity problems as linear programs -- Existence of solution rays for linear complementarity problems with Z-matrices -- A linear complementarity problem with an n by 2n “P”-matrix -- On the parametric nonlinear complementarity problem -- Improving the convergence of fixed-point algorithms -- On the homotopic approach to systems of equations with separable mappings.