The Polya algorithm for convex approximation
From MaRDI portal
Publication:1823409
DOI10.1016/0022-247X(89)90188-1zbMATH Open0681.41021MaRDI QIDQ1823409FDOQ1823409
Authors: David A. Legg, Douglas W. Townsend
Publication date: 1989
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Recommendations
Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)
Cites Work
- Title not available (Why is that?)
- The natural best \(L^ 1\)-approximation by nondecreasing functions
- The Polya algorithm on cylindrical sets
- Natural choice of \(L_ 1-\)approximants
- Existence of Best n-Convex Approximations
- Approximations in $L^p $ and Chebyshev Approximations
- The Polya algorithm in \(L_ \infty\) approximation
- On projections and monotony in \(L_p\)-spaces
- On the Existence and Characterization of Best Nonlinear Tchebycheff Approximations
Cited In (14)
- Reliable and Efficient Approximation of Polyconvex Envelopes
- Best \(L_ 1\) approximation by convex functions
- Title not available (Why is that?)
- The Polya algorithm on cylindrical sets
- Polya properties in
- The Pólya algorithm on tubular sets
- Rate of convergence of the Pólya algorithm from polyhedral sets
- The Pólya algorithm on convex sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Polya algorithm in \(L_{\infty}\) approximation
- Convex \(L^ p\) approximation
- A new approximation hierarchy for polynomial conic optimization
- Title not available (Why is that?)
This page was built for publication: The Polya algorithm for convex approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823409)