The Polya algorithm on cylindrical sets
From MaRDI portal
DOI10.1016/0021-9045(88)90027-5zbMATH Open0663.41026OpenAlexW2000749750MaRDI QIDQ1114102FDOQ1114102
Authors: Robert Huotari, David A. Legg, Douglas W. Townsend
Publication date: 1988
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(88)90027-5
Recommendations
Cites Work
Cited In (13)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniform Lipschitz continuity of best \(l_p\)-approximations by polyhedral sets
- Best \(L_ 1\) approximation by convex functions
- The linear discrete Pólya algorithm
- A polynomial-time algorithm for computing the yolk in fixed dimension
- Polya properties in
- The Pólya algorithm on tubular sets
- Rate of convergence of the Pólya algorithm from polyhedral sets
- Rate of convergence of the discrete Pólya algorithm
- The Pólya algorithm on convex sets
- The Polya algorithm for convex approximation
- Continuities of metric projection and geometric consequences
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)