Related papers: Lebesgue-type inequalities in greedy approximation

When developing robust preconditioners for multiphysics problems, fractional functions of the Laplace operator often arise and need to be inverted. Rational approximation in the uniform norm can be used to convert inverting those fractional…

For the classical maximum coverage problem, the greedy algorithm achieves a worst-case $1-1/e$ approximation, which is optimal unless $\text{P} = \text{NP}$. The notion of coverage appears in a wide range of optimization tasks, where…

Since Tinhofer proposed the MinGreedy algorithm for maximum cardinality matching in 1984, several experimental studies found the randomized algorithm to perform excellently for various classes of random graphs and benchmark instances. In…

We present factorizations of weighted Lebesgue, Ce\-s\` aro and Copson spaces, for weights satisfying the conditions which assure the boundedness of the Hardy's integral operator between weighted Lebesgue spaces. Our results enhance, among…

In this paper, we prove the Hardy-Leray inequality and related inequalities in variable Lebesgue spaces. Our proof is based on a version of the Stein-Weiss inequality in variable Lebesgue spaces derived from two weight inequalities due to…

Kernel-based schemes are state-of-the-art techniques for learning by data. In this work we extend some ideas about kernel-based greedy algorithms to exponential-polynomial splines, whose main drawback consists in possible overfitting and…

Let $L:=-\Delta+V$ be the Schr\"{o}dinger operator on $\mathbb{R}^n$ with $n\geq 3$, where $V$ is a non-negative potential which belongs to certain reverse H\"{o}lder class $RH_q(\mathbb{R}^n)$ with $q\in (n/2,\,\infty)$. In this article,…

Bayesian Reinforcement Learning (RL) is capable of not only incorporating domain knowledge, but also solving the exploration-exploitation dilemma in a natural way. As Bayesian RL is intractable except for special cases, previous work has…

We study sparse approximate solutions to convex optimization problems. It is known that in many engineering applications researchers are interested in an approximate solution of an optimization problem as a linear combination of elements…

We recently introduced a scale of kernel-based greedy schemes for approximating the solutions of elliptic boundary value problems. The procedure is based on a generalized interpolation framework in reproducing kernel Hilbert spaces and was…

Let $X$ be a ball quasi-Banach function space on ${\mathbb R}^n$ and assume that the Hardy--Littlewood maximal operator satisfies the Fefferman--Stein vector-valued maximal inequality on $X$, and let $q\in[1,\infty)$ and $d\in(0,\infty)$.…

The goal of this paper is to study the performance of the Thresholding Greedy Algorithm (TGA) when we increase the size of greedy sums by a constant factor $\lambda\geqslant 1$. We introduce the so-called $\lambda$-almost greedy and…

It is well-known that to establish the almost everywhere convergence of a sequence of operators on $L_1$-space, it is sufficient to obtain a weak $(1,1)$-type inequality for the maximal operator corresponding to the sequence of operators.…

Let $X$ be a ball quasi-Banach function space on ${\mathbb R}^n$. In this article, assuming that the powered Hardy--Littlewood maximal operator satisfies some Fefferman--Stein vector-valued maximal inequality on $X$ and is bounded on the…

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]…

The main goal of this paper is to provide a complete characterization of the weak-type boundedness of the Hardy-Littlewood maximal operator, $M$, on weighted Lorentz spaces $\Lambda^p_u(w)$, whenever $p>1$. This solves a problem left open…

Let $X$ be a ball quasi-Banach function space on ${\mathbb R}^n$. In this article, assuming that the powered Hardy--Littlewood maximal operator satisfies some Fefferman--Stein vector-valued maximal inequality on $X$ as well as it is bounded…

We consider the $X$-Greedy Algorithm and the Dual Greedy Algorithm in a finite-dimensional Banach space with a strictly monotone basis as the dictionary. We show that when the dictionary is an initial segment of the Haar basis in $L_p[0,1]$…

We establish existence, uniqueness and optimal regularity results for very weak solutions to certain nonlinear elliptic boundary value problems. We introduce structural asymptotic assumptions of Uhlenbeck type on the nonlinearity, which are…

Submodular functions are a broad class of set functions, which naturally arise in diverse areas. Many algorithms have been suggested for the maximization of these functions. Unfortunately, once the function deviates from submodularity, the…