English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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.

Error bounds for the solution sets of generalized polynomial complementarity problems