Some LCPs solvable in strongly polynomial time with Lemke's algorithm
type: Item
instance of: scholarly article
title: Some LCPs solvable in strongly polynomial time with Lemke's algorithm
zbMATH Open document ID: 1356.90145
author: Ilan Adler
author: R. W. Cottle
author: Jong-Shi Pang
published in: Mathematical Programming. Series A. Series B
publication date: 2016-11-25T00:00:00Z
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 6656105
zbMATH Keywords: Lemke's algorithm
zbMATH Keywords: parametric principal pivoting method
zbMATH Keywords: covering vector
zbMATH Keywords: parametric direction vector
MaRDI profile type: Publication
full work available at URL: s10107-016-0996-4
OpenAlex ID: W2332504605
cites work: Strongly polynomial algorithm for a class of combinatorial LCPs
cites work: A class of polynomially solvable linear complementarity problems
cites work: NP-completeness of the linear complementarity problem
cites work: Observations on a class of nasty linear complementarity problems
cites work: Complementary pivot theory of mathematical programming
cites work: Q4003375
cites work: On the uniqueness of solutions to linear complementarity problems
cites work: The Linear Complementarity Problem
cites work: Computational complexity of LCPs associated with positive definite symmetric matrices
cites work: God and man in the mathematics of Kronecker
cites work: CP-rays in simplicial cones
cites work: Q4051879
cites work: Bimatrix Equilibrium Points and Mathematical Programming
cites work: Geometric Properties of Hidden Minkowski Matrices
cites work: Computational complexity of complementary pivot methods
cites work: Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
cites work: On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method
DOI: 10.1007/S10107-016-0996-4
description: scientific article; zbMATH DE number 6656105