Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
From MaRDI portal
Publication:3707784
DOI10.1007/BFb0121072zbMath0582.90099MaRDI QIDQ3707784
Jong-Shi Pang, R. Chandrasekaran
Publication date: 1985
Published in: Mathematical Programming Essays in Honor of George B. Dantzig Part II (Search for Journal in Brave)
linear complementarity; P-matrix; strictly diagonally dominant matrix; parametric principal pivoting; hidden Z transpose; polynomial testing procedure
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
CP-rays in simplicial cones, Generalizations of the hidden Minkowski property, Good hidden \(P\)-matrix sandwiches, A class of linear complementarity problems solvable in polynomial time, On the convergence of the block principal pivotal algorithm for the LCP, On some classes of matrices related to solving linear complementarity problems as linear programs, Extended \(P\)-pairs, A class of polynomially solvable linear complementarity problems, Two counterexamples on the polynomial solvability of the linear complementarity problem