Related papers: Maximal inequalities, frames and greedy algorithms

We obtain Lebesgue-type inequalities for the greedy algorithm for arbitrary complete seminormalized biorthogonal systems in Banach spaces. The bounds are given only in terms of the upper democracy functions of the basis and its dual. We…

Greedy algorithms which use only function evaluations are applied to convex optimization in a general Banach space $X$. Along with algorithms that use exact evaluations, algorithms with approximate evaluations are treated. A priori upper…

In this paper we study greedy approximation in Banach spaces. We discuss a modification of the Weak Chebyshev Greedy Algorithm, in which steps of the algorithm can be executed imprecisely. Such inaccuracies are represented by both absolute…

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 suggest a new greedy strategy for convex optimization in Banach spaces and prove its convergent rates under a suitable behavior of the modulus of uniform smoothness of the objective function.

We construct two counterexamples that resolve long-standing open problems on greedy approximation theory with respect to bases, posed in [F. Albiac et al., Dissertationes Math. 560 (2021)] and restated in [F. Albiac, J. L. Ansorena, V.…

In this paper we propose a unified way of analyzing a certain kind of greedy-type algorithms in Banach spaces. We define a class of the Weak Biorthogonal Greedy Algorithms that contains a wide range of greedy algorithms. In particular, we…

Let $X$ be a Banach space and $(e_n)_{n=1}^\infty$ be a basis. For a function $f$ in a large collection $\mathcal{F}$ (closed under composition), we define and characterize $f$-greedy and $f$-almost greedy bases. We study relations among…

A net $(x_\alpha)$ in a vector lattice $X$ is said to be {unbounded order convergent} (or uo-convergent, for short) to $x\in X$ if the net $(\abs{x_\alpha-x}\wedge y)$ converges to 0 in order for all $y\in X_+$. In this paper, we study…

A novel and detailed convergence analysis is presented for a greedy algorithm that was previously introduced for operator reconstruction problems in the field of quantum mechanics. This algorithm is based on an offline/online decomposition…

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…

A well-known theorem due to R. C. James states that a Banach space is reflexive if and only if every bounded linear functional attains its norm. In this note we study Banach lattices on which every (real-valued) lattice homomorphism attains…

We continue the study initiated in [F. Albiac and P. Wojtaszczyk, Characterization of $1$-greedy bases, J. Approx. Theory 138 (2006), no. 1, 65-86] of properties related to greedy bases in the case when the constants involved are sharp,…

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…

Using methods of descriptive set theory, in particular, the determinacy of infinite games of perfect information, we answer several questions from the literature regarding different notions of bases in Banach spaces and lattices. For the…

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…

This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a quantitative study of new types of greedy-like bases that have recently arisen in the context of nonlinear $m$-term approximation in Banach…

We show that a very simple modification of the Pure Greedy Algorithm for approximating functions by sparse sums from a dictionary in a Hilbert or more generally a Banach space has optimal convergence rates on the class of convex…

The aim of this paper is to show that almost greedy bases induce tighter embeddings in superreflexive Banach spaces than in general Banach spaces. More specifically, we show that an almost greedy basis in a superreflexive Banach space…

Greedy algorithms are a fundamental category of algorithms in mathematics and computer science, characterized by their iterative, locally optimal decision-making approach, which aims to find global optima. In this review, we will discuss…