Iterative thresholding for sparse approximations
From MaRDI portal
\(\ell_0\) regularizationalgorithmscomputational complexityconjugate gradientiterative thresholdingmatching pursuit iterationnon-convex optimizationnumerical examplessparse signal expansionssubset selection
Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13) Sampling theory in information and communication theory (94A20)
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
- 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
- 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?)
- 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)- The weighted majority algorithm
- Iterative thresholding algorithm based on non-convex method for modified l_p-norm regularization minimization
- 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
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
- An efficient duality-based approach for PDE-constrained sparse optimization
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- Spark-level sparsity and the _1 tail minimization
- A non-smooth and non-convex regularization method for limited-angle CT image reconstruction
- An FE-inexact heterogeneous ADMM for elliptic optimal control problems with L^1-control cost
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Model recovery for Hammerstein systems using the hierarchical orthogonal matching pursuit method
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Compressive sensing in signal processing: algorithms and transform domain formulations
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Sparse signal inversion with impulsive noise by dual spectral projected gradient method
- Optimality conditions for locally Lipschitz optimization with l₀-regularization
- Sparse approximate reconstruction decomposed by two optimization problems
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- A unified primal dual active set algorithm for nonconvex sparse recovery
- Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case
- 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
- 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
- Hierarchical compressed sensing
- 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
- Hierarchical isometry properties of hierarchical measurements
- Sparse signal recovery via generalized Gaussian function
- Bias versus non-convexity in compressed sensing
- Proximal algorithm for minimization problems in \(l_0\)-regularization for nonlinear inverse problems
- Gradient projection Newton pursuit for sparsity constrained optimization
- Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
- Convergence of projected Landweber iteration for matrix rank minimization
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- Ways to sparse representation: An overview
- Homotopy method for matrix rank minimization based on the matrix hard thresholding method
- The convergence guarantee of the iterative hard thresholding algorithm with suboptimal feedbacks for large systems
- A penalty decomposition method for rank minimization problem with affine constraints
- Model recovery for Hammerstein systems using the auxiliary model based orthogonal matching pursuit method
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
- Optimality conditions for sparse nonlinear programming
- Compressed sensing by inverse scale space and curvelet thresholding
- Convergence analysis of projected gradient descent for Schatten-p nonconvex matrix recovery
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- On solutions of sparsity constrained optimization
- A note on the complexity of proximal iterative hard thresholding algorithm
- Nonlinear regularization techniques for seismic tomography
- Newton method for \(\ell_0\)-regularized optimization
- Sparse signal recovery from phaseless measurements via hard thresholding pursuit
- The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Morozov's discrepancy principle for _1-_2 sparsity regularization
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Best subset selection via a modern optimization lens
- Adaptive frame-based color image denoising
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- A general extending and constraining procedure for linear iterative methods
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- Constraint matrix factorization for space variant PSFs field restoration
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- Minimum n-rank approximation via iterative hard thresholding
- Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions
- Compressed sensing by iterative thresholding of geometric wavelets: a comparing study
- Curvelet-wavelet regularized split Bregman iteration for compressed sensing
- Iterative hard-thresholding applied to optimal control problems with L^0() control cost
- Multi-receivers and sparse-pixel pseudo-thermal light source for compressive ghost imaging against turbulence
- A continuous exact _0 penalty (CEL0) for least squares regularized problem
- 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
- On debiasing restoration algorithms: applications to total-variation and nonlocal-means
- Global convergence of splitting methods for nonconvex composite optimization
- Tensor completion in hierarchical tensor representations
- An iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach space
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- A tight bound of hard thresholding
- Proximal mapping for symmetric penalty and sparsity
- Iterative Sparsification-Projection: Fast and Robust Sparse Signal Approximation
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- On collaborative compressive sensing systems: the framework, design, and algorithm
- $\ell _0$ Minimization for wavelet frame based image restoration
- The sparse MLE for ultrahigh-dimensional feature screening
- Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
- A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model
- Sparsity-Based MIMO Radars
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)
