2014/11/04 by Dinh, Si Tiep, Vui, Ha Huy, Son, Pham Tien · 1 citation
#FOS: Mathematics #Optimization and Control (math.OC)
paper · doi:10.48550/arxiv.1411.0859
Let F := (f1, …, fp) \colon \Bbb Rn → \Bbb Rp be a polynomial map, and suppose that S := \x ∈ \Bbb Rn : fi(x) ≤ 0, i = 1, …, p\ ≠ ∅. Let d := maxi = 1, …, p °fi and H(d, n, p) := d(6d - 3)n + p - 1. Under the assumption that the map F \colon \Bbb Rn → \Bbb Rp is convenient and non-degenerate at infinity, we show that there exists a constant c > 0 such that the following so-called \em Hölder-type global error bound result holds c d(x,S) ≤ [f(x)]+(2)/(H(2d, n, p)) + [f(x)]+ \textrm for all x ∈ ℝn, where d(x, S) denotes the Euclidean distance between x and S, f(x) := maxi = 1, …, p fi(x), and [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.