A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point

DOI10.1007/BF01582068zbMath0809.90122OpenAlexW1967840740MaRDI QIDQ1322558

Hans Kremers, Adolphus J. J. Talman

Publication date: 28 March 1995

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

linear complementaritycomplementary pivoting

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (3)

KLERC: kernel Lagrangian expectile regression calculator ⋮ Conjugate gradient method for the linear complementarity problem withs-matrix ⋮ On the equivalence of linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• The basic theorem of complementarity revisited
• Computation of economic equilibria by a sequence of linear complementarity problems
• Computing stationary points
• Computational complexity of complementary pivot methods
• Bimatrix Equilibrium Points and Mathematical Programming
• On the basic theorem of complementarity

This page was built for publication: A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point