Iterative hard thresholding for compressed sensing

DOI10.1016/J.ACHA.2009.04.002zbMath1174.94008arXiv0805.0510OpenAlexW2963322354MaRDI QIDQ734323

Thomas Blumensath, Michael E. Davies

Publication date: 20 October 2009

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

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

zbMATH Keywords

sampling theorysignal reconstructioniterative hard thresholdingsampling algorithmssparse inverse problem

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Sampling theory in information and communication theory (94A20)

Related Items (only showing first 100 items - show all)

Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence ⋮ An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems ⋮ Best subset selection via a modern optimization lens ⋮ Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity ⋮ Sparse high-dimensional linear regression. Estimating squared error and a phase transition ⋮ Iterative algorithm for discrete structure recovery ⋮ MOEA/D with chain-based random local search for sparse optimization ⋮ Minimum \( n\)-rank approximation via iterative hard thresholding ⋮ Recent development of dual-dictionary learning approach in medical image analysis and reconstruction ⋮ Observable dictionary learning for high-dimensional statistical inference ⋮ Conjugate gradient acceleration of iteratively re-weighted least squares methods ⋮ Design of wideband fractional-order differentiator using interlaced sampling method ⋮ Error bounds and stability in the \(\ell_0\) regularized for CT reconstruction from small projections ⋮ Robust sparse phase retrieval made easy ⋮ Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations ⋮ Gradient projection Newton pursuit for sparsity constrained optimization ⋮ The springback penalty for robust signal recovery ⋮ The essential ability of sparse reconstruction of different compressive sensing strategies ⋮ Sparse microwave imaging: principles and applications ⋮ Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain ⋮ Expander \(\ell_0\)-decoding ⋮ Generalized greedy alternatives ⋮ Adaptive multi-penalty regularization based on a generalized Lasso path ⋮ Generalizing CoSaMP to signals from a union of low dimensional linear subspaces ⋮ Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP ⋮ Existence and convergence analysis of \(\ell_{0}\) and \(\ell_{2}\) regularizations for limited-angle CT reconstruction ⋮ A globally convergent algorithm for nonconvex optimization based on block coordinate update ⋮ Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion ⋮ A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem ⋮ Efficient nonconvex sparse group feature selection via continuous and discrete optimization ⋮ Adaptive projected gradient thresholding methods for constrained \(l_0\) problems ⋮ Iterative hard thresholding for compressed data separation ⋮ Restricted isometries for partial random circulant matrices ⋮ Sampling in the analysis transform domain ⋮ Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods ⋮ Sparse Legendre expansions via \(\ell_1\)-minimization ⋮ Phase transitions for greedy sparse approximation algorithms ⋮ Fast overcomplete dictionary construction with probabilistic guarantees ⋮ Geological facies recovery based on weighted \(\ell_1\)-regularization ⋮ Interpolation via weighted \(\ell_{1}\) minimization ⋮ Projected gradient iteration for nonlinear operator equation ⋮ A characterization of proximity operators ⋮ New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem ⋮ Sparse signal recovery via ECME thresholding pursuits ⋮ Democracy in action: quantization, saturation, and compressive sensing ⋮ Compressive sensing of analog signals using discrete prolate spheroidal sequences ⋮ A note on the complexity of \(L _{p }\) minimization ⋮ An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration ⋮ Stability of 1-bit compressed sensing in sparse data reconstruction ⋮ Iterative hard thresholding methods for \(l_0\) regularized convex cone programming ⋮ Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming ⋮ A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem ⋮ Efficient projected gradient methods for cardinality constrained optimization ⋮ Optimal computational and statistical rates of convergence for sparse nonconvex learning problems ⋮ Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing ⋮ Learning semidefinite regularizers ⋮ Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations ⋮ Convergence radius and sample complexity of ITKM algorithms for dictionary learning ⋮ Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion ⋮ Sparse signal inversion with impulsive noise by dual spectral projected gradient method ⋮ Sparse signal recovery using a new class of random matrices ⋮ Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization ⋮ A non-smooth and non-convex regularization method for limited-angle CT image reconstruction ⋮ Convergence of fixed-point continuation algorithms for matrix rank minimization ⋮ Sparse approximate reconstruction decomposed by two optimization problems ⋮ Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction ⋮ Maximum correntropy adaptation approach for robust compressive sensing reconstruction ⋮ Gradient iteration with \(\ell _{p}\)-norm constraints ⋮ Learning general sparse additive models from point queries in high dimensions ⋮ An algebraic perspective on integer sparse recovery ⋮ A non-adapted sparse approximation of PDEs with stochastic inputs ⋮ Compressed sensing with coherent and redundant dictionaries ⋮ On support sizes of restricted isometry constants ⋮ Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem ⋮ Stochastic greedy algorithms for multiple measurement vectors ⋮ Convergent inexact penalty decomposition methods for cardinality-constrained problems ⋮ Approximately normalized iterative hard thresholding for nonlinear compressive sensing ⋮ Compressive sensing in signal processing: algorithms and transform domain formulations ⋮ Broken adaptive ridge regression and its asymptotic properties ⋮ Iterative hard thresholding for compressed sensing ⋮ Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case ⋮ Iterative hard thresholding based on randomized Kaczmarz method ⋮ Modified iterations for data-sparse solution of linear systems ⋮ Hard thresholding pursuit algorithms: number of iterations ⋮ Sparse estimation of Cox proportional hazards models via approximated information criteria ⋮ GPU accelerated greedy algorithms for compressed sensing ⋮ The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy ⋮ Galaxy image restoration with shape constraint ⋮ DANTE: deep alternations for training neural networks ⋮ Adaptive wavelet estimations for the derivative of a density in GARCH-type model ⋮ Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning ⋮ Structured iterative hard thresholding with on- and off-grid applications ⋮ Sparse methods for automatic relevance determination ⋮ Partial gradient optimal thresholding algorithms for a class of sparse optimization problems ⋮ A Lagrange-Newton algorithm for sparse nonlinear programming ⋮ Sparse regression at scale: branch-and-bound rooted in first-order optimization ⋮ Unbiasing in iterative reconstruction algorithms for discrete compressed sensing ⋮ Sparse recovery of sound fields using measurements from moving microphones ⋮ Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints ⋮ A note on the complexity of proximal iterative hard thresholding algorithm

Uses Software

• CoSaMP
• Unnamed Item

Cites Work

• Unnamed Item
• Iterative hard thresholding for compressed sensing
• Iterative thresholding for sparse approximations
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• Uniform uncertainty principle for Bernoulli and subgaussian ensembles
• Reconstruction and subgaussian operators in asymptotic geometric analysis
• Quantitative robust uncertainty principles and optimally sparse decompositions
• On sparse reconstruction from Fourier and Gaussian measurements
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Sampling signals with finite rate of innovation
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: Iterative hard thresholding for compressed sensing