An algorithm for the linear complementarity problem

DOI10.1080/00207167808803148zbMath0399.65039OpenAlexW2004113213MaRDI QIDQ4184202

Layne T. Watson

Publication date: 1978

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167808803148

zbMATH Keywords

Complementarity ProblemExamples of TestsHybrid AlgorithmN-Cyclic Algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (3)

Iterative algorithms for the linear complementarity problem ⋮ Some perturbation results for the Linear Complementarity Problem ⋮ CP-rays in simplicial cones

Cites Work

• Unnamed Item
• Unnamed Item
• Complementary pivot theory of mathematical programming
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• Some Perturbation Theorems for Q-Matrices
• Linear complementarity problems solvable by A single linear program
• Computational complexity of complementary pivot methods
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• The Linear Complementarity Problem
• The complementarity problem
• The Unloading Problem for Plane Curves

This page was built for publication: An algorithm for the linear complementarity problem