Convex polynomial approximation in $R^d$ with Freud weights
Oleksandr Maizlish, Andriy Prymak

TL;DR
This paper proves that convex functions on multi-dimensional space can be approximated by convex polynomials under Freud weights, extending known one-dimensional results to higher dimensions and various norms using a new approach.
Contribution
It extends convex polynomial approximation results with Freud weights from one dimension to multiple dimensions and different Lp norms, employing a novel method.
Findings
Convex functions can be approximated by convex polynomials in weighted norms.
The approximation holds for all dimensions $d \\geq 1$ and for various $p$ norms.
The approach differs significantly from previous methods used in one-dimensional cases.
Abstract
We show that for multivariate Freud-type weights , , any convex function on satisfying if , or if , can be approximated in the weighted norm by a sequence of algebraic polynomials convex on such that as . This extends the previously known result for and obtained by the first author to higher dimensions and integral norms using a completely different approach.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials · Approximation Theory and Sequence Spaces · Mathematical Inequalities and Applications
