Rate of convergence of the discrete Pólya algorithm
From MaRDI portal
Publication:583535
DOI10.1016/0021-9045(90)90070-7zbMATH Open0692.41028OpenAlexW2101851340MaRDI QIDQ583535FDOQ583535
Authors: A. G. Egger, Robert Huotari
Publication date: 1990
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(90)90070-7
Recommendations
- Rate of convergence of the discrete Pólya-1 algorithm
- Rate of convergence of the linear discrete Pólya algorithm
- Rate of convergence of the linear discrete Pólya 1-algorithm
- scientific article; zbMATH DE number 1949107
- Rate of convergence of the Pólya algorithm from polyhedral sets
- scientific article; zbMATH DE number 1744825
- scientific article; zbMATH DE number 3915533
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Convergence rates of cascade algorithms
- scientific article; zbMATH DE number 1560334
Cites Work
- Dependence on p of the best \(L^ p\) approximation operator
- The Polya algorithm on cylindrical sets
- On the convergence of Polya's algorithm
- Natural choice of \(L_ 1-\)approximants
- Approximation of norms
- Linear Minimax Approximation as the Limit of Best $L_p $-Approximation
- Approximations in $L^p $ and Chebyshev Approximations
- The Pólya algorithm on convex sets
Cited In (16)
- On best \(p\)-approximation from affine subspaces: Asymptotic expansion
- Title not available (Why is that?)
- Title not available (Why is that?)
- The linear discrete Pólya algorithm
- The Pólya algorithm in sequence spaces
- Rate of convergence of the linear discrete Pólya algorithm
- Asymptotic behaviour of best \(l_p\)-approximations from affine subspaces
- Polya properties in
- Rate of convergence of the discrete Pólya-1 algorithm
- The Pólya algorithm on tubular sets
- Rate of convergence of the Pólya algorithm from polyhedral sets
- Asymptotic expression of the linear discrete best \(\ell_{p}\)-approximation
- On the von Neumann alternating algorithm in Hilbert space
- The discrete Pólya algorithm on finite spaces
- Leximin optimality and fuzzy set-theoretic operations.
- Large data limit for a phase transition model with the p-Laplacian on point clouds
This page was built for publication: Rate of convergence of the discrete Pólya algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583535)