An Algorithm for the Linear Complementarity Problem with a P₀ -Matrix
From MaRDI portal
Publication:3142602
DOI10.1137/0614064zbMATH Open0802.65082OpenAlexW2033711900MaRDI QIDQ3142602FDOQ3142602
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
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
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (12)
- On the modulus algorithm for the linear complementarity problem.
- A new subclass of \(P\)-matrices
- New perturbation results for solving the linear complementarity problem with \(P_o\)-matrices
- Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
- Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
- A support submatrix for the generalized linear complementarity problem
- Title not available (Why is that?)
- On a subclass of \(P_ 0\)
- Title not available (Why is that?)
- Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
- The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
- The vertical linear complementarity problem associated withPo-matrices
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)
