Generalized greedy alternatives
DOI10.1016/J.ACHA.2018.10.005zbMATH Open1498.65090OpenAlexW2693978734MaRDI QIDQ2175011FDOQ2175011
Authors: François-Xavier Dupé, Sandrine Anthoine
Publication date: 27 April 2020
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2018.10.005
Recommendations
- Generalized approximate weak greedy algorithms
- On generalizations of the optimal choice problem
- Generalized Nash's choice
- Greedy approximations
- Greedy in Approximation Algorithms
- Greedy approximation
- Greedy approximation
- Greedy strategies for convex optimization
- A class of greedy algorithms for the generalized assignment problem
- Sufficient conditions for the optimality of the greedy algorithm in greedoids
Hilbert spacenon-convex optimizationgreedy algorithmsparse representationPoisson denoisingzeros-finding
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Programming in abstract spaces (90C48)
Cites Work
- Matching pursuits with time-frequency dictionaries
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Greed is Good: Algorithmic Results for Sparse Approximation
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Greedy approximation
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Greedy sparsity-constrained optimization
- Hyers-Ulam-Rassias stability of functional equations in nonlinear analysis
- Trading accuracy for sparsity in optimization problems with sparsity constraints
- The asymptotic behavior of the composition of two resolvents
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Convex analysis and monotone operator theory in Hilbert spaces
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Optimal Inversion of the Anscombe Transformation in Low-Count Poisson Image Denoising
- Hard thresholding pursuit: an algorithm for compressive sensing
- Generalized sampling and infinite-dimensional compressed sensing
- The Baillon-Haddad theorem revisited
Cited In (3)
Uses Software
This page was built for publication: Generalized greedy alternatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175011)