Iterative thresholding for sparse approximations

From MaRDI portal

Publication:734940

Jump to:navigation, search

DOI10.1007/s00041-008-9035-zzbMath1175.94060OpenAlexW1980454827MaRDI QIDQ734940

Thomas Blumensath, Michael 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

zbMATH Keywords

algorithms computational complexity numerical examples subset selection non-convex optimization conjugate gradient \(\ell_0\) regularization iterative thresholding matching pursuit iteration sparse signal expansions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13) Approximation algorithms (68W25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Sampling theory in information and communication theory (94A20)

Related Items

Optimality conditions for sparse nonlinear programming, A general extending and constraining procedure for linear iterative methods, Best subset selection via a modern optimization lens, Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations, Adaptive frame-based color image denoising, Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity, Minimizers of sparsity regularized Huber loss function, A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems, Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization, Minimum \( n\)-rank approximation via iterative hard thresholding, Compressed sensing by inverse scale space and curvelet thresholding, Multi-receivers and sparse-pixel pseudo-thermal light source for compressive ghost imaging against turbulence, Wavelet denoising via sparse representation, 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 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, Nonlinear regularization techniques for seismic tomography, Gradient projection Newton pursuit for sparsity constrained optimization, 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, 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, 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, Newton-type optimal thresholding algorithms for sparse optimization problems, Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries, Constraint matrix factorization for space variant PSFs field restoration, An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression, On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem, Projected gradient iteration for nonlinear operator equation, Linear-step solvability of some folded concave and singly-parametric sparse optimization problems, Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization, Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework, Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty, Iterative hard thresholding methods for \(l_0\) regularized convex cone programming, A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem, Toward a unified theory of sparse dimensionality reduction in Euclidean space, Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging, 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 \(\ell_1\) tail minimization, GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression, Sparse signal inversion with impulsive noise by dual spectral projected gradient method, Convergence of iterative hard-thresholding algorithm with continuation, 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 projected Landweber iteration for matrix rank minimization, Fast thresholding algorithms with feedbacks for sparse signal recovery, An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost, Sparse approximate reconstruction decomposed by two optimization problems, Gradient iteration with \(\ell _{p}\)-norm constraints, Iterative thresholding meets free-discontinuity problems, Ways to sparse representation: An overview, Homotopy method for matrix rank minimization based on the matrix hard thresholding method, Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems, The convergence guarantee of the iterative hard thresholding algorithm with suboptimal feedbacks for large systems, Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems, Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods, A penalty decomposition method for rank minimization problem with affine constraints, Model recovery for Hammerstein systems using the hierarchical orthogonal matching pursuit method, Approximately normalized iterative hard thresholding for nonlinear compressive sensing, The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\), Compressive sensing in signal processing: algorithms and transform domain formulations, On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms, Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions, A unified primal dual active set algorithm for nonconvex sparse recovery, Iterative hard thresholding for compressed sensing, Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery, Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case, Nonconvex sorted \(\ell_1\) minimization for sparse approximation, Iterative hard thresholding based on randomized Kaczmarz method, Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots, Model recovery for Hammerstein systems using the auxiliary model based orthogonal matching pursuit method, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD, COMPRESSED SENSING BY ITERATIVE THRESHOLDING OF GEOMETRIC WAVELETS: A COMPARING STUDY, CURVELET-WAVELET REGULARIZED SPLIT BREGMAN ITERATION FOR COMPRESSED SENSING, 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, Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem, Structured iterative hard thresholding with on- and off-grid applications, The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms, Partial gradient optimal thresholding algorithms for a class of sparse optimization problems, Weighted thresholding homotopy method for sparsity constrained optimization, Iterative Hard-Thresholding Applied to Optimal Control Problems with $L^0(\Omega)$ Control Cost, Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems, 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, The weighted majority algorithm, On solutions of sparsity constrained optimization, A note on the complexity of proximal iterative hard thresholding algorithm, Hierarchical isometry properties of hierarchical measurements, Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction, Global optimization for sparse solution of least squares problems, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, Tensor Completion in Hierarchical Tensor Representations, Unnamed Item, A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem, The Sparse MLE for Ultrahigh-Dimensional Feature Screening, Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms, Grouped variable selection with discrete optimization: computational and statistical perspectives, Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates, Saturation-Value Blind Color Image Deblurring with Geometric Spatial-Feature Prior, Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem, Nonlinear Iterative Hard Thresholding for Inverse Scattering, A wonderful triangle in compressed sensing, Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems, Heavy-ball-based hard thresholding algorithms for sparse signal recovery, A fixed-time converging neurodynamic approach with time-varying coefficients for \(l_1\)-minimization problem, A non-convex piecewise quadratic approximation of \(\ell_0\) regularization: theory and accelerated algorithm, A tight bound of modified iterative hard thresholding algorithm for compressed sensing., Scaled proximal gradient methods for sparse optimization problems, A survey on compressed sensing approach to systems and control, Proximal Mapping for Symmetric Penalty and Sparsity, An unbiased approach to compressed sensing, $ \newcommand{\e}{{\rm e}} \ell_{0}$ -minimization methods for image restoration problems based on wavelet frames, A tree-based dictionary learning framework, A projected gradient method for αℓ ₁ − βℓ ₂ sparsity regularization ^**, On Debiasing Restoration Algorithms: Applications to Total-Variation and Nonlocal-Means, Unnamed Item, $\ell _0$ Minimization for wavelet frame based image restoration, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, A Tight Bound of Hard Thresholding, Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT), Unnamed Item, On the Convergence of the SINDy Algorithm, On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm, The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy, Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems, Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms, Solving inverse problems using data-driven models, Nonconvex Optimization for 3-Dimensional Point Source Localization Using a Rotating Point Spread Function, 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, CLEAR: Covariant LEAst-Square Refitting with Applications to Image Restoration

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:734940&oldid=12641221"