Iterative thresholding for sparse approximations
From MaRDI portal
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)
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
Cites work
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 1465030 (Why is no real title available?)
- scientific article; zbMATH DE number 884923 (Why is no real title available?)
- An EM algorithm for wavelet-based image restoration
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic Decomposition by Basis Pursuit
- Complex wavelets for shift invariant analysis and filtering of signals
- Computer Vision - ECCV 2004
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Data compression and harmonic analysis
- De-noising by soft-thresholding
- Greed is Good: Algorithmic Results for Sparse Approximation
- Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
- Just relax: convex programming methods for identifying sparse signals in noise
- Matching pursuits with time-frequency dictionaries
- Matrix Analysis
- On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Signal Recovery by Proximal Forward-Backward Splitting
- Sparse Approximate Solutions to Linear Systems
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Wavelets and curvelets for image deconvolution: a combined approach
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
Cited in
(only showing first 100 items - show all)- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Newton method for \(\ell_0\)-regularized optimization
- Newton-type optimal thresholding algorithms for sparse optimization problems
- $\ell _0$ Minimization for wavelet frame based image restoration
- Iterative hard thresholding for compressed sensing
- An iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach space
- A projected gradient method for nonlinear inverse problems with \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- A note on the complexity of proximal iterative hard thresholding algorithm
- On solutions of sparsity constrained optimization
- Hierarchical compressed sensing
- Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions
- Sparse recovery of sound fields using measurements from moving microphones
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- Minimizers of sparsity regularized Huber loss function
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- An unbiased approach to 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
- Model recovery for Hammerstein systems using the auxiliary model based orthogonal matching pursuit method
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- A bisection method for computing the proximal operator of the \(\ell_p\)-norm for any \(0 < p < 1\) with application to Schatten \(p\)-norms
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Sparse approximate reconstruction decomposed by two optimization problems
- Wavelet denoising via sparse representation
- On collaborative compressive sensing systems: the framework, design, and algorithm
- On the convergence of the SINDy algorithm
- Ways to sparse representation: An overview
- Nonlinear Iterative Hard Thresholding for Inverse Scattering
- A fixed-time converging neurodynamic approach with time-varying coefficients for \(l_1\)-minimization problem
- Adaptive frame-based color image denoising
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- The trimmed Lasso: sparse recovery guarantees and practical optimization by the generalized soft-min penalty
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- An efficient duality-based approach for PDE-constrained sparse optimization
- Cardinality minimization, constraints, and regularization: a survey
- A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Spark-level sparsity and the \(\ell_1\) tail minimization
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- On choosing initial values of iteratively reweighted \(\ell_1\) algorithms for the piece-wise exponential penalty
- A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications
- A non-smooth and non-convex regularization method for limited-angle CT image reconstruction
- The weighted majority algorithm
- Iterative thresholding meets free-discontinuity problems
- Global optimization for sparse solution of least squares problems
- Global convergence of splitting methods for nonconvex composite optimization
- Proximal mapping for symmetric penalty and sparsity
- The sparse MLE for ultrahigh-dimensional feature screening
- Minimum n-rank approximation via iterative hard thresholding
- A tight bound of hard thresholding
- 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
- Grouped variable selection with discrete optimization: computational and statistical perspectives
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
- Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction
- 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})\)
- Numerical solution for sparse PDE constrained optimization
- Subspace Newton method for sparse group \(\ell_0\) optimization problem
- Quaternion-aware low-rank prior for blind color image deblurring
- Exterior-point optimization for sparse and low-rank optimization
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- On debiasing restoration algorithms: applications to total-variation and nonlocal-means
- Convergence of projected Landweber iteration for matrix rank minimization
- 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
- 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
- A tight bound of modified iterative hard thresholding algorithm for compressed sensing.
- Optimality conditions for sparse nonlinear programming
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
- A projected gradient method for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization
- A unified primal dual active set algorithm for nonconvex sparse recovery
- A tree-based dictionary learning framework
- Scaled proximal gradient methods for sparse optimization problems
- Iterative hard-thresholding applied to optimal control problems with \(L^0(\Omega)\) control cost
- Error bounds and stability in the _0 regularized for CT reconstruction from small projections
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
- Sparse signal recovery via generalized Gaussian function
- Constraint matrix factorization for space variant PSFs field restoration
- Nonlinear regularization techniques for seismic tomography
- Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
- 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
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- A survey on compressed sensing approach to systems and control
- A continuous exact \(\ell_0\) penalty (CEL0) for least squares regularized problem
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)
