Rescaled pure greedy algorithm for convex optimization

DOI10.1007/s10092-019-0311-xzbMath1415.65137arXiv1505.03606OpenAlexW2963524597WikidataQ128088058 ScholiaQ128088058MaRDI QIDQ2424223

Zheming Gao, Guergana Petrova

Publication date: 24 June 2019

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.03606

zbMATH Keywords

convex optimizationrates of convergencegreedy algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items (3)

Rescaled pure greedy algorithm for Hilbert and Banach spaces ⋮ Biorthogonal greedy algorithms in convex optimization ⋮ Quadratic surface support vector machine with L1 norm regularization

Cites Work

• Unnamed Item
• Unnamed Item
• Convex optimization on Banach spaces
• Rescaled pure greedy algorithm for Hilbert and Banach spaces
• Greedy expansions in convex optimization
• Some remarks on greedy algorithms
• A unified way of analyzing some greedy algorithms
• Greedy approximation in convex optimization
• Greedy strategies for convex optimization
• On the generalized approximate weak Chebyshev greedy algorithm
• Greedy Approximation
• Uniformly convex functions on Banach spaces
• Sequential greedy approximation for certain convex optimization problems

This page was built for publication: Rescaled pure greedy algorithm for convex optimization