Bounds for the solution set of linear complementarity problems

DOI10.1016/0166-218X(87)90028-XMaRDI QIDQ1087474zbMATH OpenFDO

Authors Panos M. Pardalos, J. B. Rosen

Publication date 1987

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

lower and upper boundsnonconvex problemLinear Complementaritysolution norm

Mathematics Subject Classification ID

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

Recommendations

• Simple computable bounds for solutions of linear complementarity problems and linear programs
• scientific article; zbMATH DE number 617262
• scientific article; zbMATH DE number 579399
• Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
• Solution of linear complementarity problems using minimization with simple bounds

Cites work

• scientific article; zbMATH DE number 3687119 (Why is no real title available?)
• scientific article; zbMATH DE number 3562788 (Why is no real title available?)
• scientific article; zbMATH DE number 3312380 (Why is no real title available?)
• scientific article; zbMATH DE number 3361689 (Why is no real title available?)
• Bounds for error in the solution set of a perturbed linear program
• Global Optimization Approach to the Linear Complementarity Problem
• Note on a Fundamental Theorem in Quadratic Programming
• Simple computable bounds for solutions of linear complementarity problems and linear programs
• Some perturbation results for the Linear Complementarity Problem
• The complementarity problem: Theory and methods of solution

Cited in

(18)

• The numerical range theory and boundedness of solutions of the complementarity problem
• A characterization of Delsarte's linear programming bound as a ratio bound
• A combinatorial bound for linear programming and related problems
• scientific article; zbMATH DE number 617262 (Why is no real title available?)
• Solution of linear complementarity problems using minimization with simple bounds
• Linear complementarity problems solvable by integer programming
• Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
• Simple computable bounds for solutions of linear complementarity problems and linear programs
• A representation of the solution set of a class of linear complementarity problems
• scientific article; zbMATH DE number 579399 (Why is no real title available?)
• Enhanced intersection cutting-plane approach for linear complementarity problems
• Bounds of the solution set to the polynomial complementarity problem
• Simple bounds for solutions of monotone complementarity problems and convex programs
• The numerical range theory and boundedness of solutions of the complementarity problem
• Note on solving linear complementarity problems as jointly constrained bilinear programs
• The integer linear complementarity problem
• The bounds on components of the solution for consistent linear systems
• On the solution of bounded and unbounded mixed complementarity problems

This page was built for publication: Bounds for the solution set of linear complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087474)