Iterative thresholding for sparse approximations
From MaRDI portal
(Redirected from Publication:734940)
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)- Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- 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
- Iterative thresholding algorithm based on non-convex method for modified l_p-norm regularization minimization
- Sparse kernel regression with coefficient-based \(\ell_q\)-regularization
- Sparse signal recovery from phaseless measurements via hard thresholding pursuit
- Gradient iteration with \(\ell _{p}\)-norm constraints
- 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
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- scientific article; zbMATH DE number 7625159 (Why is no real title available?)
- From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing
- Tensor completion in hierarchical tensor representations
- Projected gradient iteration for nonlinear operator equation
- A general extending and constraining procedure for linear iterative methods
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- Best subset selection via a modern optimization lens
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Compressed sensing by iterative thresholding of geometric wavelets: a comparing study
- Sparsity-Based MIMO Radars
- Iterative thresholding algorithms
- Curvelet-wavelet regularized split Bregman iteration for compressed sensing
- Multi-receivers and sparse-pixel pseudo-thermal light source for compressive ghost imaging against turbulence
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- 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
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging
- Solve exactly an under determined linear system by minimizing least squares regularized with an _0 penalty
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- Structured iterative hard thresholding with on- and off-grid applications
- A penalty decomposition method for rank minimization problem with affine constraints
- Dynamic thresholding algorithm with memory for linear inverse problems
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization
- Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem
- Saturation-Value Blind Color Image Deblurring with Geometric Spatial-Feature Prior
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Weighted thresholding homotopy method for sparsity constrained optimization
- Convergence of iterative hard-thresholding algorithm with continuation
- Iterative Sparsification-Projection: Fast and Robust Sparse Signal Approximation
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- Hierarchical isometry properties of hierarchical measurements
- Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- Solving inverse problems using data-driven models
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model
- Convergence properties of stochastic proximal subgradient method in solving a class of composite optimization problems with cardinality regularizer
- Towards probabilistic robust and sparsity-free compressive sampling in civil engineering: a review
- GAITA: a Gauss-Seidel iterative thresholding algorithm for _q regularized least squares regression
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- CLEAR: covariant least-square refitting with applications to image restoration
- \(\ell_0\)-minimization methods for image restoration problems based on wavelet frames
- Low-rank tensor recovery using sequentially optimal modal projections in iterative hard thresholding (SeMPIHT)
- A wonderful triangle in compressed sensing
- Compressive sensing in signal processing: algorithms and transform domain formulations
- Model recovery for Hammerstein systems using the hierarchical orthogonal matching pursuit method
- 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
- 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
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)
