The Polya algorithm for convex approximation
From MaRDI portal
Recommendations
Cites work
- Approximations in L^p and Chebyshev Approximations
- Existence of Best n-Convex Approximations
- scientific article; zbMATH DE number 3425889 (Why is no real title available?)
- 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 natural best L^ 1-approximation by nondecreasing functions
- The Polya algorithm in \(L_ \infty\) approximation
- The Polya algorithm on cylindrical sets
Cited in
(16)- The Polya algorithm on cylindrical sets
- The Pólya algorithm on tubular sets
- Best \(L_ 1\) approximation by convex functions
- A new approximation hierarchy for polynomial conic optimization
- Rate of convergence of the Pólya algorithm from polyhedral sets
- scientific article; zbMATH DE number 3879983 (Why is no real title available?)
- scientific article; zbMATH DE number 3907061 (Why is no real title available?)
- scientific article; zbMATH DE number 3909024 (Why is no real title available?)
- scientific article; zbMATH DE number 3956307 (Why is no real title available?)
- Polya properties in
- scientific article; zbMATH DE number 1303656 (Why is no real title available?)
- Reliable and Efficient Approximation of Polyconvex Envelopes
- scientific article; zbMATH DE number 4194391 (Why is no real title available?)
- The Pólya algorithm on convex sets
- Convex L^ p approximation
- The Polya algorithm in \(L_{\infty}\) approximation
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)