Characterizations of bounded solutions of linear complementarity problems

DOI10.1007/BFB0120987MaRDI QIDQ3948898zbMATH OpenOpenAlexFDO

Authors O. L. Mangasarian

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

zbMATH Keywords

stabilityexistence of solutionslinear complementarity problemboundedness of solutionssolution setSlater constraint qualificationcopositive-plus matricesnondegenerate vertex solution

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited in

(21)

• A simple characterization of solutions sets of convex programs
• Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
• Error bounds for nondegenerate monotone linear complementarity problems
• The numerical range theory and boundedness of solutions of the complementarity problem
• Some new existence, sensitivity and stability results for the nonlinear complementarity problem
• On cone orderings and the linear complementarity problem
• Application of disjunctive programming to the linear complementarity problem
• A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix
• Hidden Z-matrices with positive principal minors
• Generalized linear complementarity problems
• Robustness and nondegenerateness for linear complementarity problems
• Stability of the linear complementarity problem at a solution point
• \(Q\)-matrices and boundedness of solutions to linear complementarity problems
• A Variable-Complexity Norm Maximization Problem
• Generalized linear complementarity problems treated without fixed-point theory
• Matrices and the linear complementarity problem
• Sufficient matrices belong to \(L\).
• Stable monotone variational inequalities
• The numerical range theory and boundedness of solutions of the complementarity problem
• A finite improvement algorithm for the linear complementarity problem
• The equivalence of an LCP to a parametric linear program with a scalar parameter

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)