Hölder-Type Global Error Bounds for Non-degenerate Polynomial Systems

preprint2014arXivOpen access

Abstract

Let F:=(f1,…,fp) ⁣:Rn→RpF := (f_1, \ldots, f_p) \colon {\Bbb R}^n \to {\Bbb R}^p be a polynomial map, and suppose that S:={x∈Rn : fi(x)≤0,i=1,…,p}≠∅.S := \{x \in {\Bbb R}^n \ : \ f_i(x) \le 0, i = 1, \ldots, p\} \ne \emptyset. Let d:=max⁡i=1,…,p°fid := \max_{i = 1, \ldots, p} °f_i and H(d,n,p):=d(6d−3)n+p−1.\mathcal{H}(d, n, p) := d(6d - 3)^{n + p - 1}. Under the assumption that the map F ⁣:Rn→RpF \colon {\Bbb R}^n \rightarrow {\Bbb R}^p is convenient and non-degenerate at infinity, we show that there exists a constant c>0c > 0 such that the following so-called {\em Hölder-type global error bound result} holds cd(x,S)≤[f(x)]+2H(2d,n,p)+[f(x)]+ for all x∈Rn,c d(x,S) \le [f(x)]_+^{\frac{2}{\mathcal{H}(2d, n, p)}} + [f(x)]_+ \quad \textrm{ for all } \quad x \in \mathbb{R}^n, where d(x,S)d(x, S) denotes the Euclidean distance between xx and S,S, f(x):=max⁡i=1,…,pfi(x),f(x) := \max_{i = 1, \ldots, p} f_i(x), and [f(x)]+:=max⁡{f(x),0}.[f(x)]_+ := \max \{f(x), 0 \}. The class of polynomial maps (with fixed Newton polyhedra), which are non-degenerate at infinity, is generic in the sense that it is an open and dense semi-algebraic set. Therefore, Hölder-type global error bounds hold for a large class of polynomial maps, which can be recognized relatively easily from their combinatoric data.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.