Skip to main content
SpringerLink
Log in

Convergence of orthogonal greedy algorithm with errors in projectors

  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

A model of orthogonal greedy algorithm is proposed. This model allows one to consider computational errors and to study the stability of this algorithm with respect to errors in projections onto subspaces. A criterion for the convergence of orthogonal greedy expansion to the expanded element is given in terms of computational errors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. H. Friedman and W. Stueuzle, “Projection Pursuit Regression,” J. Amer. Statist. Assoc. 76, 817 (1981).

    Article  MathSciNet  Google Scholar 

  2. L. K. Jones, “On a Conjecture of Huber Concerning the Convergence of PP-Regression,” Ann. Statist. 15, 880 (1987).

    Article  MathSciNet  MATH  Google Scholar 

  3. S. Mallat and Z. Zhang, “Matching Pursuit with Time-Frequency Dictionaries,” IEEE Trans. Signal Process. 41, 3397 (1993).

    Article  MATH  Google Scholar 

  4. R. A. DeVore and V. N. Temlyakov, “Some Remarks on Greedy Algorithms,” Adv. Comput. Math. 5, 173 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  5. V. N. Temlyakov, “Weak Greedy Algorithms,” Adv. Comput. Math. 12, 213 (2000).

    Article  MathSciNet  MATH  Google Scholar 

  6. V. V. Galatenko and E. D. Livshits, “Generalized Approximate Weak Greedy Algorithms,” Matem. Zametki 78(2), 186 (2005) [Math. Notes 78 (1–2), 170 (2005)].

    MathSciNet  Google Scholar 

  7. R. Gribonval and M. Nielsen, “Approximate Weak Greedy Algorithms,” Adv. Comput. Math. 14, 361 (2001).

    Article  MathSciNet  MATH  Google Scholar 

  8. V. V. Galatenko, “Convergence of Weak Orthogonal Greedy Approximations,” in Proc. Voronezh Winter School “Modern Methods of the Theory of Functions and Related Problems,” (Voronezh, 2011), pp. 62–63.

    Google Scholar 

  9. V. V. Dubinin, Greedy Algorithms and Applications, Ph. D. Thesis. Univ. South Carolina, 1997.

    Google Scholar 

  10. S. B. Stechkin, “Absolute Convergence of Orthogonal Series,” Doklady Akad, Nauk SSSR 102, 37 (1955).

    MATH  Google Scholar 

  11. A. Barron, “Universal Approximation Bounds for Superposition of n Sigmoidal Functions,” IEEE Trans. Inf. Theory 39, 930 (1993).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow State University, Leninskie Gory, Moscow, 119991, Russia

    N. N. Fedotov

Authors
  1. N. N. Fedotov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © N.N. Fedotov. 2013. published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2013. Vol. 68, No. 1, pp. 21–26.

About this article

Cite this article

Fedotov, N.N. Convergence of orthogonal greedy algorithm with errors in projectors. Moscow Univ. Math. Bull. 68, 37–41 (2013). https://doi.org/10.3103/S0027132213010075

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132213010075

Keywords

Search

Navigation