AbstractLet X be a closed subset of I = [−1, 1], and let Bn(f) be the best uniform approximation to fϵ C[X] from the set of polynomials of degree at most n. An extended global Lipschitz constant is defined for f, and it is shown that this constant is asymptotically equivalent to the strong unicity constant. Estimates of the size of the local Lipschitz constant for f are given when the cardinality of the set of extremal points of f − Bn(f)is n + 2. Examples which illustrate that the local and extended global Lipschitz constants may have very different asymptotic behavior are constructed
AbstractThe purpose of this paper is to illustrate the significance of G. Freud's work on Lipschitz ...
We use a structural characterization of the metric projection PG(f), from the continuous function sp...
Global optimization methods based on Lipschitz bounds have been analyzed and applied widely to solve...
AbstractLet X be a closed subset of I = [−1, 1], and let Bn(f) be the best uniform approximation to ...
AbstractLet X be a closed subset of I= [− 1, 1], For f ϵ C[X], the local Lipschitz constant is defin...
AbstractLet X be a compact metric space, and let V= {F(a, x): a ϵ A} where A is an open subset of Rn...
AbstractFor each f continuous on the interval I, let Bn(f) denote the best uniform polynomial approx...
A characterization, using polynomials introduced by A. V. Kolushov, is given for the local Lipschitz...
A characterization, using polynomials introduced by A. V. Kolushov, is given for the local Lipschitz...
A characterization, using polynomials introduced by A. V. Kolushov, is given for the local Lipschitz...
AbstractA characterization, using polynomials introduced by A. V. Kolushov, is given for the local L...
AbstractLet f in C[− 1, 1] be given, and let n be a fixed nonnegative integer. For 0 & θ ⩽ 1 define ...
We use a structural characterization of the metric projection PG(f), from the continuous function sp...
We use a structural characterization of the metric projection PG(f), from the continuous function sp...
AbstractWe consider uniform polynomial approximation on [ −1, 1]. For the class of functions which a...
AbstractThe purpose of this paper is to illustrate the significance of G. Freud's work on Lipschitz ...
We use a structural characterization of the metric projection PG(f), from the continuous function sp...
Global optimization methods based on Lipschitz bounds have been analyzed and applied widely to solve...
AbstractLet X be a closed subset of I = [−1, 1], and let Bn(f) be the best uniform approximation to ...
AbstractLet X be a closed subset of I= [− 1, 1], For f ϵ C[X], the local Lipschitz constant is defin...
AbstractLet X be a compact metric space, and let V= {F(a, x): a ϵ A} where A is an open subset of Rn...
AbstractFor each f continuous on the interval I, let Bn(f) denote the best uniform polynomial approx...
A characterization, using polynomials introduced by A. V. Kolushov, is given for the local Lipschitz...
A characterization, using polynomials introduced by A. V. Kolushov, is given for the local Lipschitz...
A characterization, using polynomials introduced by A. V. Kolushov, is given for the local Lipschitz...
AbstractA characterization, using polynomials introduced by A. V. Kolushov, is given for the local L...
AbstractLet f in C[− 1, 1] be given, and let n be a fixed nonnegative integer. For 0 & θ ⩽ 1 define ...
We use a structural characterization of the metric projection PG(f), from the continuous function sp...
We use a structural characterization of the metric projection PG(f), from the continuous function sp...
AbstractWe consider uniform polynomial approximation on [ −1, 1]. For the class of functions which a...
AbstractThe purpose of this paper is to illustrate the significance of G. Freud's work on Lipschitz ...
We use a structural characterization of the metric projection PG(f), from the continuous function sp...
Global optimization methods based on Lipschitz bounds have been analyzed and applied widely to solve...