Unified error estimate for weak biorthogonal greedy algorithms

DOI10.1142/S0219691322500102MaRDI QIDQ5097875zbMATH OpenFDO

Authors Bing Jiang, Wenhui Zhang, Pei-Xin Ye

Publication date 1 September 2022

Published in International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219691322500102

zbMATH Keywords

error estimate\(K\)-functionalweak rescaled pure greedy algorithmweak biorthogonality greedy algorithm

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Geometry and structure of normed linear spaces (46B20) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Recommendations

• The rate of convergence of weak greedy approximations over orthogonal dictionaries
• A unified way of analyzing some greedy algorithms
• Weak greedy algorithms
• Greedy algorithms in Banach spaces
• Efficiency of the weak Rescaled Pure Greedy Algorithm

Cites work

• scientific article; zbMATH DE number 3626044 (Why is no real title available?)
• scientific article; zbMATH DE number 1215245 (Why is no real title available?)
• A unified way of analyzing some greedy algorithms
• Adaptive algorithms of nonlinear approximation with finite terms
• Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
• Approximation and learning by greedy algorithms
• Efficiency of the weak Rescaled Pure Greedy Algorithm
• Generalized approximate weak greedy algorithms
• Greedy algorithms in Banach spaces
• Greedy strategies for convex optimization
• Rates of convex approximation in non-Hilbert spaces
• Rescaled pure greedy algorithm for Hilbert and Banach spaces
• Some remarks on greedy algorithms
• Sparse approximation and recovery by greedy algorithms in Banach spaces
• Sparse signals recovery from noisy measurements by orthogonal matching pursuit

Cited in

(4)

• A unified way of analyzing some greedy algorithms
• Reproducing property of bounded linear operators and kernel regularized least square regressions
• Approximation properties of some vector weak biorthogonal greedy algorithms
• Optimality of the rescaled pure greedy learning algorithms

This page was built for publication: Unified error estimate for weak biorthogonal greedy algorithms

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