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
相关论文
共 17 条
[1]  
Barron A. R.(1993)Universal approximation bounds for superpositions of a sigmoidal function IEEE Trans. Inf. Theory 39 930-945
[2]  
Clarkson K. L.(2010)Coresets, sparse greedy approximation, and the Frank–Wolfe algorithm ACM Trans. Algorithms 6 63-444
[3]  
Dunn J. C.(1978)Conditional gradient algorithms with open loop step size rules J. Math. Anal. Appl. 62 432-110
[4]  
Harshbarger S.(1956)An algorithm for quadratic programming Nav. Res. Logist. Q. 3 95-613
[5]  
Frank M.(1992)A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training Ann. Stat. 20 608-2832
[6]  
Wolfe P.(2010)Trading accuracy for sparsity in optimization problems with sparsity constraints SIAM J. Optim. 20 2807-145
[7]  
Jones L. K.(1999)Greedy algorithms and J. Approx. Theory 98 117-292
[8]  
Shalev-Shwartz S.(2005)-term approximation with regard to redundant dictionaries Constr. Approx. 21 257-270
[9]  
Srebro N.(2014)Greedy-type approximation in Banach spaces and applications Tr. Mat. Inst. im. V.A. Steklova, Ross. Akad. Nauk 284 252-890
[10]  
Zhang T.(2011)Greedy expansions in convex optimization Adv. Neural Inf. Process. Syst. 24 882-691
12