We study various approximation classes associated with m-term approximation by elements from a (possibly redundant) dictionary in a Banach space. The standard approximation class associated with the best m-term approximation is compared to new classes defined by considering m-term approximation with algorithmic con-straints: thresholding and Chebychev approximation classes are studied respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space, and we prove that assuming a certain structure of the dictionary is sufficient and (almost) necessary to obtain stronger results. We give examples of cla...
AbstractWe study the efficiency of greedy type algorithms with regard to redundant dictionaries in H...
By solving a linear inverse problem under a sparsity constraint, one can successfully recover the co...
International audienceTen years ago, Mallat and Zhang proposed the Matching Pursuit algorithm : sinc...
ABSTRACT. We study various approximation classes associated with m-term approximation by elements fr...
International audienceWe study various approximation classes associated with m-term approximation by...
We study various approximation classes associated with $m$-term approximation by elements from a (po...
We study various approximation classes associated with m-term approximation by elements from a (poss...
In this paper, which is the sequel to [16], we study inverse estimates of the Bernstein type for non...
In this paper we study inverse estimates of the Bernstein type for nonlinear approximation with stru...
International audienceIn this paper, which is the sequel to [R. Gribonval and M. Nielsen. Nonlinear ...
We study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach space. I...
We study nonlinear approximation in the Triebel-Lizorkin spaces with dictionaries formed by dilating...
Abstract. This paper is a survey which also contains some new results on the nonlinear approximation...
Abstract. We study nonlinear m-term approximation with regard to a redundant dictionary D in a Hilbe...
AbstractWe study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach ...
AbstractWe study the efficiency of greedy type algorithms with regard to redundant dictionaries in H...
By solving a linear inverse problem under a sparsity constraint, one can successfully recover the co...
International audienceTen years ago, Mallat and Zhang proposed the Matching Pursuit algorithm : sinc...
ABSTRACT. We study various approximation classes associated with m-term approximation by elements fr...
International audienceWe study various approximation classes associated with m-term approximation by...
We study various approximation classes associated with $m$-term approximation by elements from a (po...
We study various approximation classes associated with m-term approximation by elements from a (poss...
In this paper, which is the sequel to [16], we study inverse estimates of the Bernstein type for non...
In this paper we study inverse estimates of the Bernstein type for nonlinear approximation with stru...
International audienceIn this paper, which is the sequel to [R. Gribonval and M. Nielsen. Nonlinear ...
We study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach space. I...
We study nonlinear approximation in the Triebel-Lizorkin spaces with dictionaries formed by dilating...
Abstract. This paper is a survey which also contains some new results on the nonlinear approximation...
Abstract. We study nonlinear m-term approximation with regard to a redundant dictionary D in a Hilbe...
AbstractWe study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach ...
AbstractWe study the efficiency of greedy type algorithms with regard to redundant dictionaries in H...
By solving a linear inverse problem under a sparsity constraint, one can successfully recover the co...
International audienceTen years ago, Mallat and Zhang proposed the Matching Pursuit algorithm : sinc...