Fast sparse reconstruction: Greedy inverse scale space flows
From MaRDI portal
Publication:3450035
DOI10.1090/mcom/3004zbMath1327.65067OpenAlexW1765379299MaRDI QIDQ3450035
Xiaoqun Zhang, Michael Moeller
Publication date: 2 November 2015
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3004
algorithmnumerical examplessparse solutionsunderdetermined linear systemsadaptive inverse scale space methodsorthogonal matching pursuit method
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Iterative numerical methods for linear systems (65F10) Methods of successive quadratic programming type (90C55)
Related Items
A Greedy Algorithm for Sparse Precision Matrix Approximation, An Algorithm Solving Compressive Sensing Problem Based on Maximal Monotone Operators
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A unified primal-dual algorithm framework based on Bregman iteration
- Iterative hard thresholding for compressed sensing
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Nonlinear inverse scale space methods
- Stability and Robustness of Weak Orthogonal Matching Pursuits
- Multiscale Methods for Polyhedral Regularizations
- Linearized Bregman iterations for compressed sensing
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- A Subband Adaptive Iterative Shrinkage/Thresholding Algorithm
- Orthonormal Expansion $\ell_{1}$-Minimization Algorithms for Compressed Sensing
- Matching pursuits with time-frequency dictionaries
- An adaptive inverse scale space method for compressed sensing
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- A dual split Bregman method for fast $\ell ^1$ minimization
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Compressed sensing
