Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
From MaRDI portal
Publication:4180165
DOI10.1287/moor.3.4.322zbMath0396.90096MaRDI QIDQ4180165
Layne T. Watson, Alan Stickney
Publication date: 1978
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.3.4.322
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
15A39: Linear inequalities of matrices
05C20: Directed graphs (digraphs), tournaments
Related Items
Unique sink orientations of grids, Observations on a class of nasty linear complementarity problems, Solving more linear complementarity problems with Murty's Bard-type algorithm, A Simple P-Matrix Linear Complementarity Problem for Discounted Games, Computational complexity of LCPs associated with positive definite symmetric matrices, A variable dimension algorithm for the linear complementarity problem