AI Chat AI Image Generator AI Video Text to Speech

Chebushev Greedy Algorithm in convex optimization

12/04/2013

∙

by Vladimir Temlyakov, et al.

∙

∙

Chebyshev Greedy Algorithm is a generalization of the well known Orthogonal Matching Pursuit defined in a Hilbert space to the case of Banach spaces. We apply this algorithm for constructing sparse approximate solutions (with respect to a given dictionary) to convex optimization problems. Rate of convergence results in a style of the Lebesgue-type inequalities are proved.

page 1

page 2

page 3

page 4

research

∙ 03/27/2013

Sparse approximation and recovery by greedy algorithms in Banach spaces

We study sparse approximation by greedy algorithms. We prove the Lebesgu...

0 Vladimir Temlyakov, et al. ∙

research

∙ 12/10/2014

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

The paper gives a systematic study of the approximate versions of three ...

0 Vladimir Temlyakov, et al. ∙

research

∙ 01/15/2020

Biorthogonal greedy algorithms in convex optimization

The study of greedy approximation in the context of convex optimization ...

0 Anton Dereventsov, et al. ∙

research

∙ 03/20/2012

On the Equivalence between Herding and Conditional Gradient Algorithms

We show that the herding procedure of Welling (2009) takes exactly the f...

0 Francis Bach, et al. ∙

research

∙ 09/12/2022

The Weak Chebyshev Greedy Algorithm (WCGA) in L^p (log L)^α spaces

We present some new results concerning Lebesgue-type inequalities for th...

0 Gustavo Garrigós, et al. ∙

research

∙ 06/28/2021

Improved Convergence Rates for the Orthogonal Greedy Algorithm

We analyze the orthogonal greedy algorithm when applied to dictionaries ...

0 Jonathan W. Siegel, et al. ∙

research

∙ 11/04/2015

Dictionary descent in optimization

The problem of convex optimization is studied. Usually in convex optimiz...

0 Vladimir Temlyakov, et al. ∙