Polya properties in
From MaRDI portal
Publication:4029133
DOI10.1080/01630569208816465zbMath0768.41025OpenAlexW1963843337MaRDI QIDQ4029133
Publication date: 7 March 1993
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569208816465
Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)
Related Items (3)
Hoffman's error bounds and uniform Lipschitz continuity of best \(l_ p\)-approximations ⋮ Convergence of ‖πapproximations to the strict approximation in Rn ⋮ Leximin optimality and fuzzy set-theoretic operations.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Pólya algorithm on convex sets
- Rate of convergence of the discrete Pólya algorithm
- Maximum likelihood and best approximations
- The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
- Simultaneous equations models in applied search theory
- The Polya algorithm on cylindrical sets
- Natural choice of \(L_ 1-\)approximants
- The Polya algorithm for convex approximation
- Tchebycheff approximation in locally convex spaces
- Tchebycheff approximation in a compact metric space
- Linear Minimax Approximation as the Limit of Best $L_p $-Approximation
- Approximations in $L^p $ and Chebyshev Approximations
- Certain Problems in the Theory of Closest Approximation
This page was built for publication: Polya properties in