An algorithm for the linear complementarity problem with upper and lower bounds

DOI10.1007/BF00939635zbMath0651.90086OpenAlexW2111274455MaRDI QIDQ1106738

Gerard van der Laan, Adolphus J. J. Talman

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939635

zbMATH Keywords

upper and lower boundssystems of nonlinear equationspivoting algorithmarbitrary starting pointoctahedral simplicial algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (2)

Extension of GAMS for complementarity problems arising in applied economic analysis ⋮ Linear complementarity problem with upper bounds

Cites Work

• Unnamed Item
• Even more with the Lemke complementarity algorithm
• A class of simplicial restart fixed point algorithms without an extra dimension
• The octahedral algorithm, a new simplicial fixed point algorithm
• A Modified Integer Labeling for Complementarity Algorithms
• Bimatrix Equilibrium Points and Mathematical Programming

This page was built for publication: An algorithm for the linear complementarity problem with upper and lower bounds