Geometry and topology of continuous best and near best approximations
Let \(M\) be a given subset of the normed space \(X\) and for any \(x\in X\) let \(P_M(x)\) be the (possibly empty) set of all its best approximations. An \(\varepsilon\)-near best approximation of \(X\) by \(M\) is a function \(\phi:X\rightarrow M\) such that \(\|x-\phi(x)\|\leq d(x,M)+\varepsilon.\) The authors show that if \(X\) is strictly convex, \(M\) is closed, boundedly compact and for each \(\varepsilon > 0\) there exists a continuous \(\varepsilon\)-near approximation \(\phi:X\rightarrow M,\) then \(M\) is a Chebyshev set. Sufficient conditions implying the connectedness of \(P_M(x)\) are given. They obtain upper bounds, (depending on the modulus of convexity of \(X\)), for the Chebyshev radius of \(P_M(x)\) with respect to a convenient point \(x^\prime(x).\)
- Continuities of metric projection and geometric consequences
- scientific article; zbMATH DE number 3423018 (Why is no real title available?)
- scientific article; zbMATH DE number 50199 (Why is no real title available?)
- scientific article; zbMATH DE number 3466042 (Why is no real title available?)
- scientific article; zbMATH DE number 3235051 (Why is no real title available?)
- scientific article; zbMATH DE number 3237219 (Why is no real title available?)
- scientific article; zbMATH DE number 3251775 (Why is no real title available?)
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- Optimal nonlinear approximation
- A note on Approximation of bounded sets
- Best approximation by linear combinations of characteristic functions of half-spaces.
- On the nonuniqueness and instability of solutions of tracking-type optimal control problems
- Probabilistic lower bounds for approximation by shallow perceptron networks
- A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves
- scientific article; zbMATH DE number 5300034 (Why is no real title available?)
- Minimization of Error Functionals over Perceptron Networks
- Integral combinations of Heavisides
- Best approximation of finite sets in normed linear spaces
- Some comparisons of complexity in dictionary-based and linear computational models
- Approximative compactness of linear combinations of characteristic functions
This page was built for publication: Geometry and topology of continuous best and near best approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583970)