Related papers: Weak weight-semi-greedy Markushevich bases
The main results in this paper contribute to bring to the fore novel underlying connections between the contemporary concepts and methods springing from greedy approximation theory with the well established techniques of classical Banach…
This paper is a follow up to the previous author's paper on convex optimization. In that paper we began the process of adjusting greedy-type algorithms from nonlinear approximation for finding sparse solutions of convex optimization…
Starting from pointwise gradient estimates for the heat semigroup, we study three characterizations of weak lower curvature bounds on metric graphs. More precisely, we prove the equivalence between a weak notion of the Bakry-\'Emery…
Elton's near unconditionality and quasi-greediness for largest coefficients are two properties of bases that made their appearance in functional analysis from very different areas of research. One of our aims in this note is to show that,…
We analyse the problem of controllability for parameter-dependent linear finite-dimensional systems. The goal is to identify the most distinguished realisations of those parameters so to better describe or approximate the whole range of…
We present new results regarding Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA) in uniformly smooth Banach spaces. We improve earlier bounds in Temlyakov (Forum Math Sigma 2014), for dictionaries satisfying a new…
In this paper we study the almost sure conditional central limit theorem in its functional form for a class of random variables satisfying a projective criterion. Applications to strongly mixing processes and non irreducible Markov chains…
We generalize the matroid-theoretic approach to greedy algorithms to the setting of poset matroids, in the sense of Barnabei, Nicoletti and Pezzoli (1998) [BNP]. We illustrate our result by providing a generalization of Kruskal algorithm…
An interesting result due to Dilworth et al. was that if we enlarge greedy sums by a constant factor $\lambda > 1$ in the condition defining the greedy property, then we obtain an equivalence of the almost greedy property, a strictly weaker…
Chebyshev Greedy Algorithm is a generalization of the well known Orthogonal Matching Pursuit defined in a Hilbert space to the case of Banach spaces. We apply this algorithm for constructing sparse approximate solutions (with respect to a…
The rate of convergence of the classical Thresholding Greedy Algorithm with respect to bases is studied in this paper. We bound the error of approximation by the product of both norms -- the norm of $f$ and the $A_1$-norm of $f$. We obtain…
We generalize several theorems of R\'enyi, Parry, Dar\'oczy and K\'atai by characterizing the greedy and quasi-greedy expansions in non-integer bases.
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…
In this paper, we establish new advances in the theory started by T. Oikhberg in [15] where the author joins greedy approximation theory with the use of sequences with gaps. Concretely, we address and partially answer three open questions…
We survey several results concerning norming Markushevich bases (M-bases, for short), focusing in particular on two recent examples of a weakly compactly generated Banach space with no norming M-basis and of an Asplund space with norming…
We investigate the application of Weak Poincar\'e Inequalities (WPI) to Markov chains to study their rates of convergence and to derive complexity bounds. At a theoretical level we investigate the necessity of the existence of WPIs to…
We shall present a new characterization of greedy bases and 1-greedy bases in terms of certain functionals defined using distances to one dimensional subspaces generated by the basis. We also introduce a new property that unifies the…
We propose and analyze a weighted greedy scheme for computing deterministic sample configurations in multidimensional space for performing least-squares polynomial approximations on $L^2$ spaces weighted by a probability density function.…
We prove a weak-type estimate for a class of operators extending some of the almost orthogonality issues involved in the study of the bilinear Hilbert transform by Lacey and Thiele.
We show that, for quasi-greedy bases in Hilbert spaces, the associated conditionality constants grow at most as $O(\log N)^{1-\epsilon}$, for some $\epsilon>0$, answering a question by Temlyakov. We show the optimality of this bound with an…