Trudy Instituta Matematiki i Mekhaniki UrO RAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
Find




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

Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2010, Volume 16, Number 4, Pages 228–236 (Mi timm656)  
Realizability of greedy algorithms

E. D. Livshits

EverNote Corp.
Full-text PDF (163 kB)
References:
PDF
HTML
Abstract: A purely greedy algorithm and an orthogonally greedy algorithm are studied. It is established that the set of objective functions for which a greedy algorithm can be realized properly has second category for discrete dictionaries.
Keywords: best m-term approximation, greedy algorithms, category.
Received: 29.12.2009
English version:
Proceedings of the Steklov Institute of Mathematics (Supplementary issues), 2011, Volume 273, Issue 1, Pages S107–S115
DOI: https://doi.org/10.1134/S0081543811050117
Bibliographic databases:
Document Type: Article
UDC: 517.518.8+519.651.3
Language: Russian
Citation: E. D. Livshits, “Realizability of greedy algorithms”, Trudy Inst. Mat. i Mekh. UrO RAN, 16, no. 4, 2010, 228–236; Proc. Steklov Inst. Math. (Suppl.), 273, suppl. 1 (2011), S107–S115
Citation in format AMSBIB
\Bibitem{Liv10}
\by E.~D.~Livshits
\paper Realizability of greedy algorithms
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2010
\vol 16
\issue 4
\pages 228--236
\mathnet{http://mi.mathnet.ru/timm656}
\elib{https://elibrary.ru/item.asp?id=15318503}
\transl
\jour Proc. Steklov Inst. Math. (Suppl.)
\yr 2011
\vol 273
\issue , suppl. 1
\pages S107--S115
\crossref{https://doi.org/10.1134/S0081543811050117}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000305481300011}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-79959284617}
Linking options:
  • https://www.mathnet.ru/eng/timm656
  • https://www.mathnet.ru/eng/timm/v16/i4/p228
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Trudy Instituta Matematiki i Mekhaniki UrO RAN
    Statistics & downloads:
    Abstract page:252
    Full-text PDF :97
    References:44
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024