Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
From MaRDI portal
Publication:3116420
DOI10.1137/100806278zbMath1242.65060OpenAlexW1977520307MaRDI QIDQ3116420
Publication date: 22 February 2012
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8fd4e02309879e95b427b7a7c09e1b9eea36f1b5
Iterative numerical methods for linear systems (65F10) Sampling theory in information and communication theory (94A20)
Related Items
A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery, Iterative algorithm for discrete structure recovery, Fast sparse reconstruction: Greedy inverse scale space flows, Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery, Sparsity Based Methods for Overparameterized Variational Problems, Structured Sparsity: Discrete and Convex Approaches, Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods, Proximal algorithm for minimization problems in \(l_0\)-regularization for nonlinear inverse problems, Suprema of Chaos Processes and the Restricted Isometry Property, A Greedy Algorithm for Sparse Precision Matrix Approximation, Gradient projection Newton pursuit for sparsity constrained optimization, The springback penalty for robust signal recovery, On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms, Generalized greedy alternatives, Generalizing CoSaMP to signals from a union of low dimensional linear subspaces, 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, Performance comparisons of greedy algorithms in compressed sensing, Improved bounds for the RIP of Subsampled Circulant matrices, A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems, A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms, Newton-type optimal thresholding algorithms for sparse optimization problems, HARFE: hard-ridge random feature expansion, Group sparse representation for restoring blurred images with Cauchy noise, Adaptive projected gradient thresholding methods for constrained \(l_0\) problems, Lasso trigonometric polynomial approximation for periodic function recovery in equidistant points, Restricted isometries for partial random circulant matrices, Unnamed Item, Unnamed Item, A simple homotopy proximal mapping algorithm for compressive sensing, Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems, Heavy-ball-based hard thresholding algorithms for sparse signal recovery, Binary generalized orthogonal matching pursuit, Sampling in the analysis transform domain, Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery, A tight bound of modified iterative hard thresholding algorithm for compressed sensing., Scaled proximal gradient methods for sparse optimization problems, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements, New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem, Greedy-like algorithms for the cosparse analysis model, Unnamed Item, Iterative hard thresholding methods for \(l_0\) regularized convex cone programming, Efficient projected gradient methods for cardinality constrained optimization, Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing, Convergence radius and sample complexity of ITKM algorithms for dictionary learning, Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion, A Tight Bound of Hard Thresholding, Matrix recipes for hard thresholding methods, Convergence of projected Landweber iteration for matrix rank minimization, Fast thresholding algorithms with feedbacks for sparse signal recovery, Sparse power factorization: balancing peakiness and sample complexity, Influences of preconditioning on the mutual coherence and the restricted isometry property of Gaussian/Bernoulli measurement matrices, Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm, Unnamed Item, The convergence guarantee of the iterative hard thresholding algorithm with suboptimal feedbacks for large systems, Duality and Convex Programming, Fusion frames and distributed sparsity, Stochastic greedy algorithms for multiple measurement vectors, Spectral Compressed Sensing via Projected Gradient Descent, Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables, Approximately normalized iterative hard thresholding for nonlinear compressive sensing, Dictionary-sparse recovery via thresholding-based algorithms, Nonconvex sorted \(\ell_1\) minimization for sparse approximation, Iterative hard thresholding based on randomized Kaczmarz method, Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems, Data-driven algorithm selection and tuning in optimization and signal processing, Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots, Hard thresholding pursuit algorithms: number of iterations, GPU accelerated greedy algorithms for compressed sensing, An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems, Stability and Robustness of Weak Orthogonal Matching Pursuits, Binary sparse signal recovery with binary matching pursuit *, Preserving injectivity under subgaussian mappings and its application to compressed sensing, Partial gradient optimal thresholding algorithms for a class of sparse optimization problems, Unnamed Item, A Lagrange-Newton algorithm for sparse nonlinear programming, Lasso Hyperinterpolation Over General Regions, Near oracle performance and block analysis of signal space greedy methods, Hierarchical compressed sensing, Greedy signal space methods for incoherence and beyond, Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints, Hierarchical isometry properties of hierarchical measurements
Uses Software
