Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
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

Matematicheskie Zametki, 2021, Volume 110, Issue 1, Pages 17–28
DOI: https://doi.org/10.4213/mzm13061 (Mi mzm13061) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Projection Greedy Algorithm

P. A. Borodinab, S. V. Konyaginac

a Laboratory "Multidimensional Approximation and Applications", Lomonosov Moscow State University
b Moscow Center for Fundamental and Applied Mathematics
c Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
Full-text PDF (463 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm13061
Abstract: We introduce and study a new type of greedy algorithms, namely, the projection greedy algorithm with respect to a given dictionary in a Hilbert space. We prove its convergence and estimate the rate of convergence for initial elements from the convex hull of the dictionary. Several specific examples of dictionaries are used to compare the introduced algorithm with the orthogonal greedy algorithm.
Keywords: greedy approximations, Hilbert space, rate of convergence.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 14.W03.31.0031
This work was supported by the Grant of the Government of the Russian Federation (grant no. 14.W03.31.0031).
Received: 01.03.2021
English version:
Mathematical Notes, 2021, Volume 110, Issue 1, Pages 16–25
DOI: https://doi.org/10.1134/S0001434621070026
Bibliographic databases:
Document Type: Article
UDC: 517.518.8
Language: Russian
Citation: P. A. Borodin, S. V. Konyagin, “Projection Greedy Algorithm”, Mat. Zametki, 110:1 (2021), 17–28; Math. Notes, 110:1 (2021), 16–25
Citation in format AMSBIB
\Bibitem{BorKon21}
\by P.~A.~Borodin, S.~V.~Konyagin
\paper Projection Greedy Algorithm
\jour Mat. Zametki
\yr 2021
\vol 110
\issue 1
\pages 17--28
\mathnet{http://mi.mathnet.ru/mzm13061}
\crossref{https://doi.org/10.4213/mzm13061}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4286373}
\transl
\jour Math. Notes
\yr 2021
\vol 110
\issue 1
\pages 16--25
\crossref{https://doi.org/10.1134/S0001434621070026}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000687705200002}
Linking options:
  • https://www.mathnet.ru/eng/mzm13061
  • https://doi.org/10.4213/mzm13061
  • https://www.mathnet.ru/eng/mzm/v110/i1/p17
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:446
    Full-text PDF :143
    References:45
    First page:35
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024