Algorithms for the Linear Complementarity Problem Which Allow an Arbitrary Starting Point

This publication has 11 references indexed in Scilit:

• A class of simplicial restart fixed point algorithms without an extra dimension
  Mathematical Programming, 1981
• Equivalence of LCP and PLS
  Mathematics of Operations Research, 1981
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
  SIAM Review, 1980
• A restart algorithm for computing fixed points without an extra dimension
  Mathematical Programming, 1979
• Implicit representation of generalized variable upper bounds in linear programming
  Mathematical Programming, 1978
• Computing stationary points
  Published by Springer Nature ,1978
• The Solution of Systems of Piecewise Linear Equations
  Mathematics of Operations Research, 1976
• Some classes of matrices in linear complementarity theory
  Mathematical Programming, 1973
• The Approximation of Fixed Points of a Continuous Mapping
  SIAM Journal on Applied Mathematics, 1967
• Bimatrix Equilibrium Points and Mathematical Programming
  Management Science, 1965