Convergence and rate of convergence of some greedy algorithms in convex optimization
From MaRDI portal
Publication:338510
DOI10.1134/S0081543816040222zbMath1355.90067arXiv1412.3297OpenAlexW2963199525MaRDI QIDQ338510
Publication date: 7 November 2016
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.3297
Related Items
Biorthogonal greedy algorithms in convex optimization, Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
Cites Work
- Unnamed Item
- Convex optimization on Banach spaces
- Greedy expansions in convex optimization
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Conditional gradient algorithms with open loop step size rules
- Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
- Greedy-type approximation in Banach spaces and applications
- Greedy approximation in convex optimization
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
- Greedy Approximation
- Universal approximation bounds for superpositions of a sigmoidal function
- Sequential greedy approximation for certain convex optimization problems
