Bounds for the solution set of linear complementarity problems (Q1087474)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounds for the solution set of linear complementarity problems |
scientific article; zbMATH DE number 3989124
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds for the solution set of linear complementarity problems |
scientific article; zbMATH DE number 3989124 |
Statements
Bounds for the solution set of linear complementarity problems (English)
0 references
1987
0 references
We give here bounds for the feasible domain and the solution norm of Linear Complementarity Problems (LCP). These bounds are motivated by formulating the LPC as a global quadratic optimization problem and are characterized by the eigenstructure of the corresponding matrix. We prove boundedness of the feasible domain when the quadratic problem is concave, and give easily computable bounds for the solution norm for the convex case. We also obtain lower and upper bounds for the solution norm of the general nonconvex problem.
0 references
Linear Complementarity
0 references
lower and upper bounds
0 references
solution norm
0 references
nonconvex problem
0 references
0 references
0.823518693447113
0 references
0.7978048324584961
0 references
