An Algorithm for the Linear Complementarity Problem with a P₀ -Matrix

DOI10.1137/0614064MaRDI QIDQ3142602zbMATH OpenOpenAlexFDO

Authors

Publication date 20 December 1993

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0614064

zbMATH Keywords

algorithmlinear complementarity problemscomputational resultsnonnegative principal minors

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
• A constructive characterization ofQ o-matrices with nonnegative principal minors
• On Some Classes of Linear Complementarity Problems with Matrices of Order n and Rank (n − 1)
• scientific article; zbMATH DE number 30954
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm

Cited in

(15)

• A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps
• scientific article; zbMATH DE number 724220 (Why is no real title available?)
• New perturbation results for solving the linear complementarity problem with \(P_o\)-matrices
• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
• Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
• A support submatrix for the generalized linear complementarity problem
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• scientific article; zbMATH DE number 2077071 (Why is no real title available?)
• The vertical linear complementarity problem associated withP_o-matrices
• On the modulus algorithm for the linear complementarity problem.
• A new subclass of \(P\)-matrices
• An asymptotic approach for testing \(P_{0}\)-matrices
• An algorithmic characterization of \(\mathbf P\)-matricity
• On a subclass of \(P_ 0\)
• Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm

This page was built for publication: An Algorithm for the Linear Complementarity Problem with a $P_0 $-Matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142602)