On processability of Lemke's algorithm
From MaRDI portal
Recommendations
Cites work
- A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
- A constructive characterization ofQ o-matrices with nonnegative principal minors
- A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
- Finiteness of Criss-Cross Method in Complementarity Problem
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- On generalized positive subdefinite matrices and interior point algorithm
- Pseudomonotone and copositive star matrices
- Some classes of matrices in linear complementarity theory
- The Linear Complementarity Problem
Cited in
(6)- Even more with the Lemke complementarity algorithm
- scientific article; zbMATH DE number 819136 (Why is no real title available?)
- On semimonotone star matrices and linear complementarity problem
- On the solution set of semi-infinite tensor complementarity problem
- More on semipositive tensor and tensor complementarity problem
- On some properties of \({\omega}\)-uniqueness in tensor complementarity problem
This page was built for publication: On processability of Lemke's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621472)