On the Solution of the Monotone and Nonmonotone Linear Complementarity Problem by an Infeasible Interior-Point Algorithm

This publication has 16 references indexed in Scilit:

• An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
  Computational Optimization and Applications, 1996
• On the Formulation and Theory of the Newton Interior-Point Method for Nonlinear Programming
  Published by Defense Technical Information Center (DTIC) ,1995
• A primal—dual infeasible-interior-point algorithm for linear programming
  Mathematical Programming, 1993
• A sequential LCP method for bilevel linear programming
  Annals of Operations Research, 1992
• Parallel and Serial Successive Overrelaxation for Multicommodity Spatial Price Equilibrium Problems
  Transportation Science, 1992
• A computational analysis of LCP methods for bilinear and concave quadratic programming
  Computers & Operations Research, 1991
• Sufficient matrices and the linear complementarity problem
  Linear Algebra and its Applications, 1989
• Computational complexity of LCPs associated with positive definite symmetric matrices
  Mathematical Programming, 1979
• Computing Economic Equilibria on Affine Networks with Lemke's Algorithm
  Mathematics of Operations Research, 1979
• The Linear Complementarity Problem
  Management Science, 1971