RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Subscription
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Mat. Zametki, 2012, Volume 92, Issue 4, Pages 528–532 (Mi mz9091)  

Comparison of the Convergence Rate of Pure Greedy and Orthogonal Greedy Algorithms

A. V. Dereventsov

M. V. Lomonosov Moscow State University

Abstract: The following two types of greedy algorithms are considered: the pure greedy algorithm (PGA) and the orthogonal greedy algorithm (OGA). From the standpoint of estimating the rate of convergence on the entire class $\mathscr A_1(\mathscr D)$, the orthogonal greedy algorithm is optimal and significantly exceeds the pure greedy algorithm. The main result in the present paper is the assertion that the situation can also be opposite for separate elements of the class $\mathscr A_1(\mathscr D)$ (and even of the class $\mathscr A_0(\mathscr D)$): the rate of convergence of the orthogonal greedy algorithm can be significantly lower than the rate of convergence of the pure greedy algorithm.

Keywords: pure greedy algorithm, orthogonal greedy algorithm, dictionary, rate of convergence, Hilbert space, the classes $\mathscr A_1(\mathscr D)$ and $\mathscr A_0(\mathscr D)$

DOI: https://doi.org/10.4213/mzm9091

Full text: PDF file (420 kB)
References: PDF file   HTML file

English version:
Mathematical Notes, 2012, 92:4, 485–489

Bibliographic databases:

UDC: 517.518+519.65
Received: 01.12.2010
Revised: 22.03.2011

Citation: A. V. Dereventsov, “Comparison of the Convergence Rate of Pure Greedy and Orthogonal Greedy Algorithms”, Mat. Zametki, 92:4 (2012), 528–532; Math. Notes, 92:4 (2012), 485–489

Citation in format AMSBIB
\Bibitem{Der12}
\by A.~V.~Dereventsov
\paper Comparison of the Convergence Rate of Pure Greedy and Orthogonal Greedy Algorithms
\jour Mat. Zametki
\yr 2012
\vol 92
\issue 4
\pages 528--532
\mathnet{http://mi.mathnet.ru/mz9091}
\crossref{https://doi.org/10.4213/mzm9091}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3201586}
\zmath{https://zbmath.org/?q=an:1262.65060}
\elib{http://elibrary.ru/item.asp?id=20731610}
\transl
\jour Math. Notes
\yr 2012
\vol 92
\issue 4
\pages 485--489
\crossref{https://doi.org/10.1134/S0001434612090209}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000310228200020}
\elib{http://elibrary.ru/item.asp?id=20497531}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84867923872}


Linking options:
  • http://mi.mathnet.ru/eng/mz9091
  • https://doi.org/10.4213/mzm9091
  • http://mi.mathnet.ru/eng/mz/v92/i4/p528

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Математические заметки Mathematical Notes
    Number of views:
    This page:325
    Full text:73
    References:36
    First page:30

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020