SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES

DOI10.1017/fms.2014.7zbMath1296.41030arXiv1303.6811OpenAlexW2963734283MaRDI QIDQ2879425

Vladimir N. Temlyakov

Publication date: 1 September 2014

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

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

zbMATH Keywords

sparse approximationgreedy algorithmsorthogonal matching pursuitLebesgue-type inequalitiesbest \(m\)-term approximation

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Geometry and structure of normed linear spaces (46B20) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Rate of convergence, degree of approximation (41A25) Spline approximation (41A15) Algorithms for approximation of functions (65D15)

Related Items

Constructive sparse trigonometric approximation for functions with small mixed smoothness, Lebesgue-type inequalities in greedy approximation, Efficiency of weak greedy algorithms for \(m\)-term approximations, Nonlinear trigonometric approximations of multivariate function classes, Unified error estimate for weak biorthogonal Greedy algorithms, Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries, Sparse Approximation by Greedy Algorithms, Orthogonal matching pursuit under the restricted isometry property, Dictionary descent in optimization, Greedy approximation in convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
• On performance of greedy algorithms
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• Greedy algorithm and \(m\)-term trigonometric approximation
• Nonlinear methods of approximation
• The thresholding greedy algorithm, greedy bases, and duality
• Greedy approximation with regard to non-greedy bases
• An example of an almost greedy uniformly bounded orthonormal basis for \(L_p(0,1)\)
• On Lebesgue-type inequalities for greedy approximation
• Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
• Sparse Approximation and Recovery by Greedy Algorithms
• Lebesgue-Type Inequalities for Greedy Approximation in Banach Spaces
• Quasi-greedy bases and Lebesgue-type inequalities
• Greed is Good: Algorithmic Results for Sparse Approximation
• On the existence of almost greedy bases in Banach spaces
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• Greedy algorithm for general biorthogonal systems
• Greedy algorithms in Banach spaces