Characterizations of bounded solutions of linear complementarity problems
From MaRDI portal
Publication:3948898
Cited in
(21)- Hidden Z-matrices with positive principal minors
- A Variable-Complexity Norm Maximization Problem
- The numerical range theory and boundedness of solutions of the complementarity problem
- Stable monotone variational inequalities
- A finite improvement algorithm for the linear complementarity problem
- Sufficient matrices belong to \(L\).
- Matrices and the linear complementarity problem
- The equivalence of an LCP to a parametric linear program with a scalar parameter
- On cone orderings and the linear complementarity problem
- Stability of the linear complementarity problem at a solution point
- Generalized linear complementarity problems
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
- Application of disjunctive programming to the linear complementarity problem
- Some new existence, sensitivity and stability results for the nonlinear complementarity problem
- A simple characterization of solutions sets of convex programs
- A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix
- Robustness and nondegenerateness for linear complementarity problems
- The numerical range theory and boundedness of solutions of the complementarity problem
- Generalized linear complementarity problems treated without fixed-point theory
- Q-matrices and boundedness of solutions to linear complementarity problems
- Error bounds for nondegenerate monotone linear complementarity problems
This page was built for publication: Characterizations of bounded solutions of linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3948898)