Approximate weak greedy algorithms

DOI10.1023/A:1012255021470zbMath0985.41014OpenAlexW1606103777MaRDI QIDQ5950886

Morten Nielsen, Rémi Gribonval

Publication date: 18 December 2001

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012255021470

zbMATH Keywords

greedy algorithmsnonlinear approximation

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items (10)

Rescaled pure greedy algorithm for Hilbert and Banach spaces ⋮ Biorthogonal greedy algorithms in convex optimization ⋮ Sharp sufficient condition for the convergence of greedy expansions with errors in coefficient computation ⋮ Convergence of orthogonal greedy algorithm with errors in projectors ⋮ Greedy expansions in Banach spaces ⋮ The Absolute Stability of Orthorecursive Expansions in Redundant Systems of Subspaces ⋮ \(L^p\)-convergence of greedy algorithm by generalized Walsh system ⋮ A unified way of analyzing some greedy algorithms ⋮ Efficiency of the weak Rescaled Pure Greedy Algorithm ⋮ Generalized approximate weak greedy algorithms

This page was built for publication: Approximate weak greedy algorithms