An algorithm for the linear complementarity problem

DOI10.1080/00207167808803148MaRDI QIDQ4184202zbMATH OpenOpenAlexFDO

Authors 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) Quadratic programming (90C20) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites work

• scientific article; zbMATH DE number 3356432 (Why is no real title available?)
• scientific article; zbMATH DE number 3363343 (Why is no real title available?)
• Bimatrix Equilibrium Points and Mathematical Programming
• Complementary pivot theory of mathematical programming
• Computational complexity of complementary pivot methods
• Equilibrium Points of Bimatrix Games
• Linear complementarity problems solvable by A single linear program
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• Some Perturbation Theorems for Q-Matrices
• The Linear Complementarity Problem
• The Unloading Problem for Plane Curves
• The complementarity problem

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4184202)