Convergence on thresholding-based algorithms for dictionary-sparse recovery
From MaRDI portal
Publication:6669595
DOI10.1007/s00041-024-10131-wMaRDI QIDQ6669595
Publication date: 22 January 2025
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
accelerationiterative hard thresholdingrestricted isometry propertyhard thresholding pursuitdictionary sparse recovery
Estimation in multivariate analysis (62H12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Unnamed Item
- Perturbations of measurement matrices and dictionaries in compressed sensing
- Compressed sensing with coherent and redundant dictionaries
- Iterative hard thresholding for compressed sensing
- Hard thresholding pursuit algorithms: number of iterations
- A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- A simple proof of the restricted isometry property for random matrices
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- Iterative hard thresholding for compressed data separation
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Greedy signal space methods for incoherence and beyond
- Greedy-like algorithms for the cosparse analysis model
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- Estimation in High Dimensions: A Geometric Perspective
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Split Bregman Methods and Frame Based Image Restoration
- Compressed Sensing and Redundant Dictionaries
- A Tight Bound of Hard Thresholding
- New Bounds for Restricted Isometry Constants With Coherent Tight Frames
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Matching pursuits with time-frequency dictionaries
- Microlocal Analysis of the Geometric Separation Problem
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Distributed Heavy-Ball: A Generalization and Acceleration of First-Order Methods With Gradient Tracking
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
- Analysis versus synthesis in signal priors
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Compressed Data Separation With Redundant Dictionaries
- Some methods of speeding up the convergence of iteration methods
- Dictionary-sparse recovery from heavy-tailed measurements
- Compressed sensing
- Adaptive greedy approximations
- Dictionary-sparse recovery via thresholding-based algorithms
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
This page was built for publication: Convergence on thresholding-based algorithms for dictionary-sparse recovery