On the Alass of Complementary Cones and Lemke’s Algorithm
From MaRDI portal
Publication:5648147
DOI10.1137/0123006zbMATH Open0237.90040OpenAlexW2083183522MaRDI QIDQ5648147FDOQ5648147
Authors: Romesh Saigal
Publication date: 1972
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0123006
Cited In (32)
- Linear complementarity problems with an invariant number of solutions
- Almost N-matrices and linear complementarity
- A unification of two classes ofQ-matrices
- Variational inequality and complementarity problem
- Q-matrices and spherical geometry
- On totally nonpositive matrices associated with a triple negatively realizable
- On constructions of partially nonpositive matrices
- On the number of solutions to a class of linear complementarity problems
- On partially non-positive matrices
- Proper, reflecting and absorbing facts of complementary cones
- Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\)
- The \(N\)-matrix completion problem under digraphs assumptions.
- Full rank factorization in quasi-\(LDU\) form of totally nonpositive rectangular matrices
- On nonsingular sign regular matrices
- The equivalence of an LCP to a parametric linear program with a scalar parameter
- Ky Fan's \(N\)-matrices and linear complementarity problems
- Some perturbation results for the Linear Complementarity Problem
- The symmetric \(N\)-matrix completion problem
- \(N\)-matrix completion problem.
- On characterizing \(N\)-matrices using linear complementarity
- A field guide to the matrix classes found in the literature of the linear complementarity problem
- On the characterization of totally nonpositive matrices
- Geometry of convex cones and application to the Euclidean projection on the positive Weyl chamber
- Linear complementarity problems solvable by A single linear program
- Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality
- Computational complexity of LCPs associated with positive definite symmetric matrices
- The generalized linear complementarity problem revisited
- A fixed-point representation of the generalized complementarity problem
- A note on a characterization of \(P\)-matrices
- Degeneracy in linear complementarity problems: A survey
- \(Q\)-matrices and boundedness of solutions to linear complementarity problems
- Quasi-\(LDU\) factorization of nonsingular totally nonpositive matrices
This page was built for publication: On the Alass of Complementary Cones and Lemke’s Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5648147)