Two counterexamples on the polynomial solvability of the linear complementarity problem

DOI10.1007/BF02592069zbMath0659.90083OpenAlexW2027705265WikidataQ124974772 ScholiaQ124974772MaRDI QIDQ3809598

Richard E. Stone, R. Chandrasekaran, Jong-Shi Pang

Publication date: 1987

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

polynomial solvabilityparametric principal pivoting algorithmlinear coplementarityp-matrix

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item
• Strongly polynomial algorithm for a class of combinatorial LCPs
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• Monotone solutions of the parametric linear complementarity problem

This page was built for publication: Two counterexamples on the polynomial solvability of the linear complementarity problem