Polynomial Approximation on Convex Subsets of Rn
نویسندگان
چکیده
Abstract. Let K be a closed bounded convex subset of Rn ; then by a result of the first author, which extends a classical theorem of Whitney there is a constantwm(K ) so that for every continuous function f on K there is a polynomial φ of degree at most m − 1 so that | f (x)− φ(x)| ≤ wm(K ) sup x,x+mh∈K |1h ( f ; x)|. The aim of this paper is to study the constant wm(K ) in terms of the dimension n and the geometry of K . For example, we show that w2(K ) ≤ 2 [log2 n] + 4 and that for suitable K this bound is almost attained. We place special emphasis on the case when K is symmetric and so can be identified as the unit ball of finite-dimensional Banach space; then there are connections between the behavior of wm(K ) and the geometry (particularly the Rademacher type) of the underlying Banach space. It is shown, for example, that if K is an ellipsoid then w2(K ) is bounded, independent of dimension, andw3(K ) ∼ log n. We also give estimates forw2 andw3 for the unit ball of the spaces `p where 1 ≤ p ≤ ∞.
منابع مشابه
Convexifying Positive Polynomials and Sums of Squares Approximation
We show that if a polynomial f ∈ R[x1, . . . , xn] is nonnegative on a closed basic semialgebraic set X = {x ∈ Rn : g1(x) ≥ 0, . . . , gr(x) ≥ 0}, where g1, . . . , gr ∈ R[x1, . . . , xn], then f can be approximated uniformly on compact sets by polynomials of the form σ0 + φ(g1)g1 + · · ·+ φ(gr)gr, where σ0 ∈ R[x1, . . . , xn] and φ ∈ R[t] are sums of squares of polynomials. In particular, if X...
متن کاملSummary of Ph.D. Dissertation: Global Optimization of Polynomial Functions and Applications
where f(x) is a real multivariate polynomial in x ∈ Rn and S is a feasible set defined by polynomial equalities or inequalities. In this thesis, we do not have any convexity/concavity assumptions on f(x) or S. The goal is to find the global minimum and global minimizers if any. Polynomial optimization of form (1.1) is quite general in practical applications. Many NP-hard problems like max cut, ...
متن کاملOn the Minimum Volume Covering Ellipsoid of Ellipsoids
We study the problem of computing a (1+ )-approximation to the minimum volume covering ellipsoid of a given set S of the convex hull of m full-dimensional ellipsoids in Rn. We extend the first-order algorithm of Kumar and Yıldırım that computes an approximation to the minimum volume covering ellipsoid of a finite set of points in Rn, which, in turn, is a modification of Khachiyan’s algorithm. F...
متن کاملOn lattices of convex sets in R
Properties of several sorts of lattices of convex subsets of Rn are examined. The lattice of convex sets containing the origin turns out, for n > 1, to satisfy a set of identities strictly between those of the lattice of all convex subsets of Rn and the lattice of all convex subsets of R. The lattices of arbitrary, of open bounded, and of compact convex sets in Rn all satisfy the same identitie...
متن کاملDetecting integral polyhedral functions
We study the class of real-valued functions on convex subsets of Rn which are computed by the maximum of finitely many affine functionals with integer slopes. We prove several results to the effect that this property of a function can be detected by sampling on small subsets of the domain. In so doing, we recover in a unified way some prior results of the first author (some joint with Liang Xia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000