Related papers: Maximal inequalities, frames and greedy algorithms
We consider learning a convex combination of basis models, and present some new theoretical and empirical results that demonstrate the effectiveness of a greedy approach. Theoretically, we first consider whether we can use linear, instead…
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…
We investigate the problem of improving the greedy-type constant of a basis by means of an equivalent renorming of the ambient Banach space. Our main result shows that if a Banach space admits an unconditional and bidemocratic basis whose…
The general problem addressed in this work is the development of a systematic study of the thresholding greedy algorithm for general biorthogonal systems (also known as Markushevich bases) in quasi-Banach spaces from a functional-analytic…
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…
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…
Let $S$ be a non-empty, closed subspace of a locally compact group $G$ that is a subsemigroup of $G$. Suppose that $X, Y$, and $Z$ are Banach lattices that are vector sublattices of the order dual $\mathrm{C}_{\mathrm{c}}(S,\mathbb R)^\sim$…
Garling sequence spaces admit a renorming with respect to which their standard unit vector basis is 1-greedy. We also discuss some additional properties of these Banach spaces related to uniform convexity and superreflexivity. In…
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient greedy algorithm and derive its formal approximation…
In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…
The general theory of greedy approximation with respect to arbitrary dictionaries is well developed in the case of real Banach spaces. Recently, some of results proved for the Weak Chebyshev Greedy Algorithm (WCGA) in the case of real…
In this paper we study the norm-attainment of positive operators between Banach lattices. By considering an absolute version of James boundaries, we prove that: If $E$ is a reflexive Banach lattice whose order is given by a basis and $F$ is…
A net $(x_\alpha)$ in a vector lattice $X$ is unbounded order convergent to $x \in X$ if $\lvert x_\alpha - x\rvert \wedge u$ converges to $0$ in order for all $u\in X_+$. This convergence has been investigated and applied in several recent…
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…
In this article, we present a greedy algorithm based on a tensor product decomposition, whose aim is to compute the global minimum of a strongly convex energy functional. We prove the convergence of our method provided that the gradient of…
We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA), a generalization of the Weak Orthogonal Matching Pursuit to the case of a Banach space. The main…
Our aim is to investigate the properties of existence and uniqueness of greedy bases in Banach spaces. We show the non-existence of greedy basis in some Nakano spaces and Orlicz sequence spaces and produce the first-known examples of…
The "classical" (weak) greedy algorithm is widely used within model order reduction in order to compute a reduced basis in the offline training phase: An a posteriori error estimator is maximized and the snapshot corresponding to the…
We present and analyse an approach to image reconstruction problems with imperfect forward models based on partially ordered spaces - Banach lattices. In this approach, errors in the data and in the forward models are described using order…
We define and study greedy matchings in vertex-ordered bipartite graphs. It is shown that each vertex-ordered bipartite graph has a unique greedy matching. The proof uses (a weak form of) Newman's lemma. The vertex ordering is called a…