EP theorems and linear complementarity problems

DOI10.1016/S0166-218X(97)00143-1zbMath0908.90251MaRDI QIDQ1392569

Akihisa Tamura, Komei Fukuda, Makoto Namiki

Publication date: 18 March 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

linear complementarity; existentially polynomial time

Mathematics Subject Classification ID

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

Related Items

New criss-cross type algorithms for linear complementarity problems with sufficient matrices, Criss-cross methods: A fresh view on pivot algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The principal pivoting method revisited
• NP-completeness of the linear complementarity problem
• Sufficient matrices and the linear complementarity problem
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• Manifestations of the Schur complement
• \(P_ *\)-matrices are just sufficient
• Complementary pivot theory of mathematical programming
• The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
• LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations