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, 2004, Volume 76, Issue 4, Pages 628–632 (Mi mz579)  

This article is cited in 10 scientific papers (total in 10 papers)

Brief Communications

Rate of Convergence of Greedy Algorithms

A. V. Sil'nichenko

M. V. Lomonosov Moscow State University

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

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

English version:
Mathematical Notes, 2004, 76:4, 582–586

Bibliographic databases:

Received: 12.05.2004

Citation: A. V. Sil'nichenko, “Rate of Convergence of Greedy Algorithms”, Mat. Zametki, 76:4 (2004), 628–632; Math. Notes, 76:4 (2004), 582–586

Citation in format AMSBIB
\Bibitem{Sil04}
\by A.~V.~Sil'nichenko
\paper Rate of Convergence of Greedy Algorithms
\jour Mat. Zametki
\yr 2004
\vol 76
\issue 4
\pages 628--632
\mathnet{http://mi.mathnet.ru/mz579}
\crossref{https://doi.org/10.4213/mzm579}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2113039}
\zmath{https://zbmath.org/?q=an:1132.41345}
\transl
\jour Math. Notes
\yr 2004
\vol 76
\issue 4
\pages 582--586
\crossref{https://doi.org/10.1023/B:MATN.0000043488.98673.79}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000224874900032}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-5044222895}


Linking options:
  • http://mi.mathnet.ru/eng/mz579
  • https://doi.org/10.4213/mzm579
  • http://mi.mathnet.ru/eng/mz/v76/i4/p628

    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

    This publication is cited in the following articles:
    1. E. D. Livshits, “On the recursive greedy algorithm”, Izv. Math., 70:1 (2006), 87–108  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib
    2. E. D. Livshits, “Optimality of the greedy algorithm for some function classes”, Sb. Math., 198:5 (2007), 691–709  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
    3. M. G. Grigoryan, A. A. Sargsyan, “Non-linear approximation of continuous functions by the Faber-Schauder system”, Sb. Math., 199:5 (2008), 629–653  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
    4. E. D. Livshits, “Lower bounds for the rate of convergence of greedy algorithms”, Izv. Math., 73:6 (2009), 1197–1215  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
    5. M. G. Grigoryan, “Modifications of functions, Fourier coefficients and nonlinear approximation”, Sb. Math., 203:3 (2012), 351–379  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib
    6. A. V. Dereventsov, “Comparison of the Convergence Rate of Pure Greedy and Orthogonal Greedy Algorithms”, Math. Notes, 92:4 (2012), 485–489  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib
    7. Proc. Steklov Inst. Math., 280 (2013), 227–239  mathnet  crossref  crossref  mathscinet  isi  elib  elib
    8. M. G. Grigoryan, K. A. Navasardyan, “Universal functions in ‘correction’ problems guaranteeing the convergence of Fourier–Walsh series”, Izv. Math., 80:6 (2016), 1057–1083  mathnet  crossref  crossref  mathscinet  adsnasa  isi  elib
    9. Petrova G., “Rescaled pure greedy algorithm for Hilbert and Banach spaces”, Appl. Comput. Harmon. Anal., 41:3 (2016), 852–866  crossref  mathscinet  zmath  isi  elib  scopus
    10. A. S. Orlova, “The rate of convergence of weak greedy approximations over orthogonal dictionaries”, Moscow University Mathematics Bulletin, 72:2 (2017), 84–87  mathnet  crossref  mathscinet  isi
  • Математические заметки Mathematical Notes
    Number of views:
    This page:246
    Full text:103
    References:34
    First page:1

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