Error bounds for the solution sets of generalized polynomial complementarity problems

Abstract

ABSTRACT In this paper, several error bounds for the solution sets of the generalized polynomial complementarity problems (GPCPs) with explicit exponents are given. As the solution set of a GPCP is the solution set of a system of polynomial equalities and inequalities, the state-of-art results in error bounds for polynomial systems can be applied directly. Starting from this, a much better error bound result for the solution set of a GPCP based on exploring the intrinsic sparsity via tensor decomposition is established.