Global error bound for the generalized linear complementarity problem over a polyhedral cone (Q1035916): Difference between revisions
From MaRDI portal
Latest revision as of 02:30, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global error bound for the generalized linear complementarity problem over a polyhedral cone |
scientific article |
Statements
Global error bound for the generalized linear complementarity problem over a polyhedral cone (English)
0 references
4 November 2009
0 references
In the article known error bounds for linear complementarity problems are extended to generalized linear complementarity problems (GLCP). To achieve the new bounds (under mild assumptions) GLCP is transformed into a problem with a bilevel structure with a standard convex program at the lower level. Based on this reformulation some characterizations of the solution set of GLCP are presented which finally are used to obtain the error bounds.
0 references
reformulation
0 references
solution structure
0 references
0 references
0 references
0 references
0 references
0 references
