Global error bound for the generalized linear complementarity problem over a polyhedral cone
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.
scientific article; zbMATH DE number 5625109