Lebesgue-Type Inequalities for Greedy Approximation in Banach Spaces

@article{Savu2013LebesgueTypeIF,
  title={Lebesgue-Type Inequalities for Greedy Approximation in Banach Spaces},
  author={Daniel Savu and Vladimir N. Temlyakov},
  journal={IEEE Transactions on Information Theory},
  year={2013},
  volume={59},
  pages={1098-1106}
}
We study sparse representations and sparse approximations with respect to incoherent dictionaries. We address the problem of designing and analyzing greedy methods of approximation. A key question in this regard is: How to measure efficiency of a specific algorithm? Answering this question, we prove the Lebesgue-type inequalities for algorithms under consideration. A very important new ingredient of the paper is that we perform our analysis in a Banach space instead of a Hilbert space. It is… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

and V

  • D. L. Donoho, M. Elad
  • N. Temlyakov, “On Lebesgue-type inequalities for…
  • 2007
Highly Influential
5 Excerpts

approximations,” in Foundations of Computational Mathematics, Santander 2005, ser. London Mathematical Society Lecture Notes Series 331

  • V. N. Temlyakov, “Greedy
  • 2006
Highly Influential
5 Excerpts

On the optimality of orthogonal greedy algorithm forcoherent dictionaries , preprint

  • D. Savu
  • 2010

On Lebesguetype inequalities for greedy approximation

  • M. Elad, V. N. Temlyakov
  • J . Approx . Theory .
  • 2007

Similar Papers

Loading similar papers…