Let X be a subset of \({\mathbb{R}}^ n\) consisting of m points and let F consist of all real-valued functions on X. For each g in F the \(\ell_ p\)-norm is defined by \(\| g\|_ p=(\sum_{x\in X}| g(x)|^ p)^{1/p}\) and \(\| g\|_{\infty}=\max_{x\in X}(| g(x)|).\) Suppose K is a closed convex subset of F, \(f\in F\) and \(f_ p\) is a unique best \(\ell_ p\)-approximation to f by elements of K. The Polya algorithm is the construction of a best \(\ell_{\infty}\)-approximation as the limit of the \(f_ p\) as \(p\to \infty\). \textit{J. Descloux} [J. Soc. Industr. Appl. Math. 11, 1017-1026 (1963; Zbl 0125.310)] showed that this limt exists for every f in F when K is a subspace of F. In the present paper Descloux's theorem is generalized to a certain class of closed convex subsets of F. This class contains all closed convex bodies which are smooth and rotund.
- Uniform Lipschitz continuity of best \(l_p\)-approximations by polyhedral sets
- The Pólya algorithm on tubular sets
- Continuities of metric projection and geometric consequences
- The Polya algorithm for convex approximation
- Best \(L_ 1\) approximation by convex functions
- The linear discrete Pólya algorithm
- Rate of convergence of the Pólya algorithm from polyhedral sets
- scientific article; zbMATH DE number 3985841 (Why is no real title available?)
- Polya properties in
- scientific article; zbMATH DE number 1303656 (Why is no real title available?)
- scientific article; zbMATH DE number 2012152 (Why is no real title available?)
- The Pólya algorithm on convex sets
- Rate of convergence of the discrete Pólya algorithm
- A polynomial-time algorithm for computing the yolk in fixed dimension
This page was built for publication: The Polya algorithm on cylindrical sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114102)
