The Polya algorithm for convex approximation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3425889 (Why is no real title available?)
- Approximations in $L^p $ and Chebyshev Approximations
- Existence of Best n-Convex Approximations
- Natural choice of \(L_ 1-\)approximants
- On projections and monotony in \(L_p\)-spaces
- On the Existence and Characterization of Best Nonlinear Tchebycheff Approximations
- The Polya algorithm in \(L_ \infty\) approximation
- The Polya algorithm on cylindrical sets
- The natural best \(L^ 1\)-approximation by nondecreasing functions
Cited in
(14)- scientific article; zbMATH DE number 3956307 (Why is no real title available?)
- A new approximation hierarchy for polynomial conic optimization
- scientific article; zbMATH DE number 3909024 (Why is no real title available?)
- The Polya algorithm in \(L_{\infty}\) approximation
- scientific article; zbMATH DE number 3907061 (Why is no real title available?)
- Reliable and Efficient Approximation of Polyconvex Envelopes
- Best \(L_ 1\) approximation by convex functions
- 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
- The Polya algorithm on cylindrical sets
- Polya properties in
- Convex \(L^ p\) approximation
- scientific article; zbMATH DE number 3879983 (Why is no real title available?)
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)