Related papers: Optimal Polynomial Approximants in $H^p$

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…

Given a multivariate real (or complex) polynomial $p$ and a domain $\cal D$, we would like to decide whether an algorithm exists to evaluate $p(x)$ accurately for all $x \in {\cal D}$ using rounded real (or complex) arithmetic. Here…

We construct bivariate orthogonal polynomials (OPs) on algebraic curves of the form $y^m = \phi(x)$ in $\mathbb{R}^2$ where $m = 1, 2$ and $\phi$ is a polynomial of arbitrary degree $d$, in terms of univariate semiclassical OPs. We compute…

In this paper, we propose a verified numerical method for obtaining a sharp inclusion of the best constant for the embedding $H_{0}^{1}(\Omega) \hookrightarrow L^{p}(\Omega)$ on bounded convex domain in $\mathbb{R}^{2}$. We estimate the…

This paper deals with the approximation of discrete real-valued functions by first-degree splines (broken lines) with free knots for arbitrary $L_p$-norms ($1 \leq p \leq \infty)$. We prove the existence of best approximations und derive…

This paper studies the bounded approximation property (BAP) in quasi Banach spaces. In the first part of the paper we show that the kernel of any surjective operator $\ell_p\to X$ has the BAP when $X$ has it and $0<p\leq 1$, which is an…

In this paper, we provide tight lower bounds for the oracle complexity of minimizing high-order H\"older smooth and uniformly convex functions. Specifically, for a function whose $p^{th}$-order derivatives are H\"older continuous with…

This thesis explores algorithmic applications and limitations of convex relaxation hierarchies for approximating some discrete and continuous optimization problems. - We show a dichotomy of approximability of constraint satisfaction…

We establish existence of weighted Hardy and Rellich inequalities on the spaces $L_p(\Omega)$ where $\Omega= \Ri^d\backslash K$ with $K$ a closed convex subset of $\Ri^d$. Let $\Gamma=\partial\Omega$ denote the boundary of $\Omega$ and…

We give necessary and sufficient conditions for inhomogeneous Calder\'on-Zgymund operators to be bounded on the local hardy spaces $h^p(\mathbb{R}^n)$. We then give applications to local and truncated Riesz transforms, as well as…

Assume that $p\in(1,\infty]$ and $u=P_{h}[\phi]$, where $\phi\in L^{p}(\mathbb{S}^{n-1},\mathbb{R}^{n})$. Then for any $x\in \mathbb{B}^{n}$, we obtain the sharp inequalities $$ |u(x)|\leq…

We prove matching direct and inverse theorems for (algebraic) polynomial approximation with doubling weights $w$ having finitely many zeros and singularities (i.e., points where $w$ becomes infinite) on an interval and not too ``rapidly…

Let $\{F_n\}$ be the sequence of the Fej\'er kernels on the unit circle $\mathbb{T}$. The first author recently proved that if $X$ is a separable Banach function space on $\mathbb{T}$ such that the Hardy-Littlewood maximal operator $M$ is…

Among other things, it is shown that there exist Banach spaces $Z$ and $W$ such that $Z^{**}$ and $W$ have bases, and for every $p\in[1,2)$ there is an operator $T:W\to Z$ that is not $p$-nuclear but $T^{**}$ is $p$-nuclear.

Let $A_{p,r}^m(n)$ be the best constant that fulfills the following inequality: for every $m$-homogeneous polynomial $P(z) = \sum_{|\alpha|=m} a_{\alpha} z^{\alpha}$ in $n$ complex variables, $$\big( \sum_{|\alpha|=m} |a_{\alpha}|^{r}…

We obtain a new universal approximation theorem for continuous (possibly nonlinear) operators on arbitrary Banach spaces using the Leray-Schauder mapping. Moreover, we introduce and study a method for operator learning in Banach spaces…

We consider weighted $L^p$-Hardy inequalities involving the distance to the boundary of a domain in the $n$-dimensional Euclidean space with nonempty boundary. Using criticality theory, we give an alternative proof of the following result…

Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…

Let $\psi$ be a conformal map of the unit disk $\mathbb{D}$ onto an unbounded domain and, for $\alpha >0$, let ${F_\alpha }=\left\{ {z \in \mathbb{D}:\left| {\psi \left( z \right)} \right| = \alpha } \right\}$. If ${H^p}\left( \mathbb{D}…

This paper is concerned with the performance of Orthogonal Matching Pursuit (OMP) algorithms applied to a dictionary $\mathcal{D}$ in a Hilbert space $\mathcal{H}$. Given an element $f\in \mathcal{H}$, OMP generates a sequence of…