Characterizations of bounded solutions of linear complementarity problems
From MaRDI portal
Publication:3948898
DOI10.1007/BFb0120987zbMath0487.90088OpenAlexW812070605MaRDI QIDQ3948898
Publication date: 1982
Published in: Optimality and Stability in Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120987
stabilitylinear complementarity problemexistence of solutionssolution setboundedness of solutionsSlater constraint qualificationcopositive-plus matricesnondegenerate vertex solution
Related Items
\(Q\)-matrices and boundedness of solutions to linear complementarity problems, A Variable-Complexity Norm Maximization 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, Matrices and the linear complementarity problem, Some new existence, sensitivity and stability results for the nonlinear complementarity problem, Generalized linear complementarity problems, The numerical range theory and boundedness of solutions of the complementarity problem, The numerical range theory and boundedness of solutions of the complementarity problem, The equivalence of an LCP to a parametric linear program with a scalar parameter, Sufficient matrices belong to \(L\)., Application of disjunctive programming to the linear complementarity problem, Stability of the linear complementarity problem at a solution point, Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem, Hidden Z-matrices with positive principal minors, Error bounds for nondegenerate monotone linear complementarity problems, On cone orderings and the linear complementarity problem, A finite improvement algorithm for the linear complementarity problem, Generalized linear complementarity problems treated without fixed-point theory, Stable monotone variational inequalities
