Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
From MaRDI portal
Publication:4180165
DOI10.1287/moor.3.4.322zbMath0396.90096OpenAlexW1982072587MaRDI QIDQ4180165
Alan Stickney, Layne T. Watson
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
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Linear inequalities of matrices (15A39) Directed graphs (digraphs), tournaments (05C20)
Related Items
A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations, A Mihalisin-Klee theorem for fans, Pivoting in linear complementarity: Two polynomial-time cases, Combinatorial characterizations of \(K\)-matrices, Observations on a class of nasty linear complementarity problems, A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem, A Simple P-Matrix Linear Complementarity Problem for Discounted Games, Unique end of potential line, Realizability makes a difference: a complexity gap for sink-finding in USOs, Counting unique-sink orientations, Unique sink orientations of grids, Enumeration of PLCP-orientations of the 4-cube, An exponential lower bound for Cunningham's rule, Computational complexity of LCPs associated with positive definite symmetric matrices, On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes, A variable dimension algorithm for the linear complementarity problem, Unnamed Item, On the Holt-Klee property for oriented matroid programming, Solving more linear complementarity problems with Murty's Bard-type algorithm
