Iterative thresholding for sparse approximations
From MaRDI portal
Publication:734940
DOI10.1007/S00041-008-9035-ZzbMATH Open1175.94060OpenAlexW1980454827MaRDI QIDQ734940FDOQ734940
Authors: Thomas Blumensath, M. E. Davies 
Publication date: 14 October 2009
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17821312/BD_JFAA07.pdf
Recommendations
- Hard thresholding pursuit: an algorithm for compressive sensing
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Dictionary-sparse recovery via thresholding-based algorithms
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
algorithmscomputational complexitynumerical examplesconjugate gradientnon-convex optimization\(\ell_0\) regularizationsubset selectioniterative thresholdingmatching pursuit iterationsparse signal expansions
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Detection theory in information and communication theory (94A13) Approximation algorithms (68W25) Sampling theory in information and communication theory (94A20) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- Atomic Decomposition by Basis Pursuit
- Title not available (Why is that?)
- Matching pursuits with time-frequency dictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Just relax: convex programming methods for identifying sparse signals in noise
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Complex wavelets for shift invariant analysis and filtering of signals
- De-noising by soft-thresholding
- Signal Recovery by Proximal Forward-Backward Splitting
- An EM algorithm for wavelet-based image restoration
- Greed is Good: Algorithmic Results for Sparse Approximation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Computer Vision - ECCV 2004
- Sparse Approximate Solutions to Linear Systems
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Title not available (Why is that?)
- On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
- Data compression and harmonic analysis
- Wavelets and curvelets for image deconvolution: a combined approach
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
- Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
Cited In (only showing first 100 items - show all)
- Newton method for \(\ell_0\)-regularized optimization
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- An unbiased approach to compressed sensing
- Hierarchical compressed sensing
- Sparse recovery of sound fields using measurements from moving microphones
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
- Bias versus non-convexity in compressed sensing
- Sparse signal inversion with impulsive noise by dual spectral projected gradient method
- Gradient projection Newton pursuit for sparsity constrained optimization
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Sparse approximate reconstruction decomposed by two optimization problems
- On collaborative compressive sensing systems: the framework, design, and algorithm
- An efficient duality-based approach for PDE-constrained sparse optimization
- Spark-level sparsity and the \(\ell_1\) tail minimization
- A non-smooth and non-convex regularization method for limited-angle CT image reconstruction
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost
- On debiasing restoration algorithms: applications to total-variation and nonlocal-means
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- Convergence of projected Landweber iteration for matrix rank minimization
- A unified primal dual active set algorithm for nonconvex sparse recovery
- Iterative hard-thresholding applied to optimal control problems with \(L^0(\Omega)\) control cost
- Sparse signal recovery via generalized Gaussian function
- The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
- Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case
- Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization
- Proximal algorithm for minimization problems in \(l_0\)-regularization for nonlinear inverse problems
- Homotopy method for matrix rank minimization based on the matrix hard thresholding method
- Sparse kernel regression with coefficient-based \(\ell_q\)-regularization
- Existence and convergence analysis of \(\ell_{0}\) and \(\ell_{2}\) regularizations for limited-angle CT reconstruction
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
- Curvelet-wavelet regularized split Bregman iteration for compressed sensing
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
- Nonconvex optimization for 3-dimensional point source localization using a rotating point spread function
- Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion
- A penalty decomposition method for rank minimization problem with affine constraints
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- Structured iterative hard thresholding with on- and off-grid applications
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Weighted thresholding homotopy method for sparsity constrained optimization
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- CLEAR: covariant least-square refitting with applications to image restoration
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration
- An iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach space
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Iterative hard thresholding for compressed sensing
- Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions
- A note on the complexity of proximal iterative hard thresholding algorithm
- On solutions of sparsity constrained optimization
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- Minimizers of sparsity regularized Huber loss function
- Model recovery for Hammerstein systems using the auxiliary model based orthogonal matching pursuit method
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- On the convergence of the SINDy algorithm
- Ways to sparse representation: An overview
- Wavelet denoising via sparse representation
- Adaptive frame-based color image denoising
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- The sparse MLE for ultrahigh-dimensional feature screening
- The weighted majority algorithm
- Proximal mapping for symmetric penalty and sparsity
- Global convergence of splitting methods for nonconvex composite optimization
- A tight bound of hard thresholding
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- Iterative thresholding meets free-discontinuity problems
- Minimum \( n\)-rank approximation via iterative hard thresholding
- Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
- The convergence guarantee of the iterative hard thresholding algorithm with suboptimal feedbacks for large systems
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\)
- Compressed sensing by inverse scale space and curvelet thresholding
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Optimality conditions for sparse nonlinear programming
- Iterative hard thresholding based on randomized Kaczmarz method
- Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- Error bounds and stability in the \(\ell_0\) regularized for CT reconstruction from small projections
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- A continuous exact \(\ell_0\) penalty (CEL0) for least squares regularized problem
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization
- Gradient iteration with \(\ell _{p}\)-norm constraints
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Tensor completion in hierarchical tensor representations
- A general extending and constraining procedure for linear iterative methods
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
Uses Software
This page was built for publication: Iterative thresholding for sparse approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734940)
