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

被引：0
|
作者：
V. N. Temlyakov
机构：
[1] University of South Carolina,Mathematics Department
[2] Steklov Mathematical Institute of Russian Academy of Sciences,undefined
来源：
Proceedings of the Steklov Institute of Mathematics | 2016年 / 293卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：325 / 337
页数：12
相关论文
共 50 条
  • [31] On the convergence rate and some applications of regularized ranking algorithms
    Kriukova, Galyna
    Pereverzyev, Sergei V.
    Tkachenko, Pavlo
    JOURNAL OF COMPLEXITY, 2016, 33 : 14 - 29
  • [32] Convergence Rate Comparison of Proximal Algorithms for Non-Smooth Convex Optimization With an Application to Texture Segmentation
    Briceno-Arias, L. M.
    Pustelnik, N.
    IEEE SIGNAL PROCESSING LETTERS, 2022, 29 : 1337 - 1341
  • [33] ON CONVERGENCE RATES OF LINEARIZED PROXIMAL ALGORITHMS FOR CONVEX COMPOSITE OPTIMIZATION WITH APPLICATIONS
    Hu, Yaohua
    Li, Chong
    Yang, Xiaoqi
    SIAM JOURNAL ON OPTIMIZATION, 2016, 26 (02) : 1207 - 1235
  • [34] CONVERGENCE RATES FOR GREEDY ALGORITHMS IN REDUCED BASIS METHODS
    Binev, Peter
    Cohen, Albert
    Dahmen, Wolfgang
    Devore, Ronald
    Petrova, Guergana
    Wojtaszczyk, Przemyslaw
    SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2011, 43 (03) : 1457 - 1472
  • [35] On the convergence of order-preserving weak greedy algorithms
    A. V. Sil’nichenko
    Mathematical Notes, 2008, 84 : 741 - 747
  • [36] On the convergence of greedy algorithms for initial segments of the Haar basis
    Dilworth, S. J.
    Odell, E.
    Schlumprecht, Th.
    Zsak, Andras
    MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 2010, 148 : 519 - 529
  • [37] Greedy algorithms in convex optimization on Banach spaces
    Temlyakov, Vladimir
    CONFERENCE RECORD OF THE 2014 FORTY-EIGHTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, 2014, : 1331 - 1335
  • [38] Entropy-based convergence rates of greedy algorithms
    Li, Yuwen
    Siegel, Jonathan W.
    MATHEMATICAL MODELS & METHODS IN APPLIED SCIENCES, 2024, 34 (05): : 779 - 802
  • [39] Greedy algorithms for classification - Consistency, convergence rates, and adaptivity
    Mannor, S
    Meir, R
    Zhang, T
    JOURNAL OF MACHINE LEARNING RESEARCH, 2004, 4 (04) : 713 - 742
  • [40] On the Convergence of Order-Preserving Weak Greedy Algorithms
    Sil'nichenko, A. V.
    MATHEMATICAL NOTES, 2008, 84 (5-6) : 741 - 747
12345