Related papers: The Weak Chebyshev Greedy Algorithm (WCGA) in $L^p…

Let $0 < \theta \leqslant 1$. A sequence of positive integers $(b_n)_{n=1}^\infty$ is called a weak greedy approximation of $\theta$ if $\sum_{n=1}^{\infty}1/b_n = \theta$. We introduce the weak greedy approximation algorithm (WGAA), which,…

We continue the study of Lebesgue-type parameters for various greedy algorithms in quasi-Banach spaces. First, we introduce a parameter that can be used with the quasi-greedy parameter to obtain the exact growth of the Lebesgue parameter…

Given a Banach space X and one of its compact sets F, we consider the problem of finding a good n dimensional space X_n \subset X which can be used to approximate the elements of F. The best possible error we can achieve for such an…

The study of greedy approximation in the context of convex optimization is becoming a promising research direction as greedy algorithms are actively being employed to construct sparse minimizers for convex functions with respect to given…

We present various estimates for the Lebesgue constants of the thresholding greedy algorithm, in the case of general bases in Banach spaces. We show the optimality of these estimates in some situations. Our results recover and slightly…

In this paper we continue the study of Lebesgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgue-type parameters associated with them. We prove that this…

We dominate non-integral singular operators by adapted sparse operators and derive optimal norm estimates in weighted spaces. Our assumptions on the operators are minimal and our result applies to an array of situations, whose prototype are…

Let G be a locally compact abelian group, $\omega:G\to (0,\infty)$ be a weight, and ($\Phi$,$\Psi$) be a complementary pair of strictly increasing continuous Young functions. We show that for the weighted Orlicz algebra $L^\Phi_\omega(G)$,…

In this effort we introduce and analyze a novel reduced basis approach, used to construct an approximating subspace for a given set of data. Our technique, which we call the Natural Greedy Algorithm (NGA), is based on a recursive approach…

We give the full solution of the following problem: obtain sharp inequalities between the moduli of smoothness $\omega_\alpha(f,t)_q$ and $\omega_\beta(f,t)_p$ for $0<p<q\le \infty$. A similar problem for the generalized $K$-functionals and…

In this paper, the authors characterize Sobolev spaces $W^{\alpha,p}({\mathbb R}^n)$ with the smoothness order $\alpha\in(0,2]$ and $p\in(\max\{1, \frac{2n}{2\alpha+n}\},\infty)$, via the Lusin area function and the Littlewood-Paley…

We analyze the orthogonal greedy algorithm when applied to dictionaries $\mathbb{D}$ whose convex hull has small entropy. We show that if the metric entropy of the convex hull of $\mathbb{D}$ decays at a rate of $O(n^{-\frac{1}{2}-\alpha})$…

We introduce and study the notion of weak semi-greedy systems -which is inspired in the concepts of semi-greedy and Branch semi-greedy systems and weak thresholding sets-, and prove that in the context Markushevich bases in infinite…

In this article we obtain an "off-diagonal" version of the Fefferman-Stein vector-valued maximal inequality on weighted Lebesgue spaces with variable exponents. As an application of this result and the atomic decomposition developed in [12]…

Let $L$ be a one-to-one operator of type $\omega$ having a bounded $H_\infty$ functional calculus and satisfying the $k$-Davies-Gaffney estimates with $k\in{\mathbb N}$. In this paper, the authors introduce the weak Hardy space…

Approximation of high-dimensional functions is a problem in many scientific fields that is only feasible if advantageous structural properties, such as sparsity in a given basis, can be exploited. A relevant tool for analysing sparse…

Sparse signal recovery deals with finding the sparsest solution of an under-determined linear system $\vx = \mQ\vs$. In this paper, we propose a novel greedy approach to addressing the challenges from such a problem. Such an approach is…

We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N- term error of approximation times a function of N which depends on the democracy…

We show that for quasi-greedy bases in real Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N-term error of approximation times a constant which depends on the democracy functions and the…

The purpose of this paper is to introduce $\omega$-Chebyshev-greedy and $\omega$-partially greedy approximation classes and to study their relation with $\omega$-approximation spaces, where the latter are a generalization of the classical…