On the generalized approximate weak Chebyshev greedy algorithm

DOI10.4064/SM8579-10-2016MaRDI QIDQ2985963zbMATH OpenOpenAlexFDO

Authors Anton Dereventsov

Publication date 10 May 2017

Published in Studia Mathematica (Search for Journal in Brave)

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

zbMATH Keywords

greedy algorithmBanach spacemodulus of smoothnessnonlinear approximationuniformly smooth Banach spaceweak Chebyshev greedy algorithmsmooth Banach spacegeneralized approximate weak Chebyshev greedy algorithm

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Geometry and structure of normed linear spaces (46B20)

Abstract: In this paper we study greedy approximation in Banach spaces. We discuss a modification of the Weak Chebyshev Greedy Algorithm, in which steps of the algorithm can be executed imprecisely. Such inaccuracies are represented by both absolute and relative errors, which provides more flexibility for numerical applications. We obtain the conditions on the error parameters that guarantee convergence of the algorithm in all uniformly smooth Banach spaces and prove that these conditions are sharp. Additionally, we discuss the conditions that need to be imposed on a Banach space to guarantee convergence of the Chebyshev Greedy Algorithm, and construct a smooth Banach space in which the algorithm diverges.

Recommendations

• Generalized approximate weak greedy algorithms
• On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces
• Approximate weak greedy algorithms
• On the convergence of approximate weak gready algorithms
• Efficiency of weak greedy algorithms for m-term approximations
• On convergence of weak greedy algorithms
• A criterion for convergence of weak greedy algorithms
• Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
• Lebesgue constants for the weak greedy algorithm
• Chebyshev's approximation algorithms and applications

Cited in

(8)

• Rescaled pure greedy algorithm for convex optimization
• A unified way of analyzing some greedy algorithms
• Generalized approximate weak greedy algorithms
• Greedy algorithms in Banach spaces
• On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces
• The weak Chebyshev X-greedy algorithm in the unweighted Bergman space
• On the convergence of approximate weak gready algorithms
• Approximate weak greedy algorithms

This page was built for publication: On the generalized approximate weak Chebyshev greedy algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985963)