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.

中文翻译：

---

广义多项式互补问题解集的误差界

摘要

本文给出了具有明确指数的广义多项式互补问题（GPCP）的解集的几个误差界。由于GPCP的解集是多项式相等和不等式系统的解集，因此可以直接应用针对多项式系统的误差范围的最新技术。从此开始，基于通过张量分解探究内在稀疏性，建立了GPCP解集的更好的错误约束结果。