Trudy Matematicheskogo Instituta imeni V.A. Steklova
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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Trudy Mat. Inst. Steklova:
Year:
Volume:
Issue:
Page:
Find




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

Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2016, Volume 293, Pages 333–345
DOI: https://doi.org/10.1134/S0371968516020229 (Mi tm3722) 		 
This article is cited in 3 scientific papers (total in 3 papers)

Convergence and rate of convergence of some greedy algorithms in convex optimization

V. N. Temlyakovab

a Steklov Mathematical Institute of Russian Academy of Sciences, ul. Gubkina 8, Moscow, 119991 Russia
b Mathematics Department, University of South Carolina, 1523 Greene Street, Columbia, SC 29208, USA
Full-text PDF (207 kB) Citations (3) English version article
References:
PDF
HTML
DOI: https://doi.org/10.1134/S0371968516020229
Abstract: The paper gives a systematic study of the approximate versions of three greedy-type algorithms that are widely used in convex optimization. By an approximate version we mean the one where some of evaluations are made with an error. Importance of such versions of greedy-type algorithms in convex optimization and approximation theory was emphasized in previous literature.
Funding agency Grant number
National Science Foundation DMS-1160841
The research was supported by the NSF grant DMS-1160841.
Received: June 21, 2015
English version:
Proceedings of the Steklov Institute of Mathematics, 2016, Volume 293, Pages 325–337
DOI: https://doi.org/10.1134/S0081543816040222
Bibliographic databases:
Document Type: Article
UDC: 517.518.8
Language: Russian
Citation: V. N. Temlyakov, “Convergence and rate of convergence of some greedy algorithms in convex optimization”, Function spaces, approximation theory, and related problems of mathematical analysis, Collected papers. In commemoration of the 110th anniversary of Academician Sergei Mikhailovich Nikol'skii, Trudy Mat. Inst. Steklova, 293, MAIK Nauka/Interperiodica, Moscow, 2016, 333–345; Proc. Steklov Inst. Math., 293 (2016), 325–337
Citation in format AMSBIB
\Bibitem{Tem16}
\by V.~N.~Temlyakov
\paper Convergence and rate of convergence of some greedy algorithms in convex optimization
\inbook Function spaces, approximation theory, and related problems of mathematical analysis
\bookinfo Collected papers. In commemoration of the 110th anniversary of Academician Sergei Mikhailovich Nikol'skii
\serial Trudy Mat. Inst. Steklova
\yr 2016
\vol 293
\pages 333--345
\publ MAIK Nauka/Interperiodica
\publaddr Moscow
\mathnet{http://mi.mathnet.ru/tm3722}
\crossref{https://doi.org/10.1134/S0371968516020229}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=3628488}
\elib{https://elibrary.ru/item.asp?id=26344487}
\transl
\jour Proc. Steklov Inst. Math.
\yr 2016
\vol 293
\pages 325--337
\crossref{https://doi.org/10.1134/S0081543816040222}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000380722200022}
\elib{https://elibrary.ru/item.asp?id=27119809}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84979988395}
Linking options:
  • https://www.mathnet.ru/eng/tm3722
  • https://doi.org/10.1134/S0371968516020229
  • https://www.mathnet.ru/eng/tm/v293/p333
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Труды Математического института имени В. А. Стеклова Proceedings of the Steklov Institute of Mathematics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025