Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
type: Item
instance of: scholarly article
title: Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
zbMATH Open document ID: 1504.94051
author: Yanyan Li
published in: The Journal of Fourier Analysis and Applications
publication date: 2022-12-19T00:00:00Z
Mathematics Subject Classification ID: 94A12
Mathematics Subject Classification ID: 94A15
Mathematics Subject Classification ID: 94A08
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 7634436
zbMATH Keywords: sparsity
zbMATH Keywords: non-smooth optimization
zbMATH Keywords: hard thresholding
zbMATH Keywords: least absolute deviation
zbMATH Keywords: one-bit compressed sensing
describes a project that uses: CoSaMP
describes a project that uses: CVX
MaRDI profile type: Publication
full work available at URL: s00041-022-09984-w
OpenAlex ID: W4311445368
cites work: A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares
cites work: Sparsity constrained nonlinear optimization: optimality conditions and algorithms
cites work: Best subset selection via a modern optimization lens
cites work: Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
cites work: Iterative hard thresholding for compressed sensing
cites work: Iterative thresholding for sparse approximations
cites work: Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
cites work: Q4821526
cites work: The restricted isometry property and its implications for compressed sensing
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: Decoding by Linear Programming
cites work: Subspace Pursuit for Compressive Sensing Signal Reconstruction
cites work: Adaptive greedy approximations
cites work: One-bit compressed sensing with partial Gaussian circulant matrices
cites work: Compressed sensing
cites work: Noisy 1-bit compressive sensing: models and algorithms
cites work: Flavors of Compressive Sensing
cites work: Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
cites work: NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
cites work: Q3057789
cites work: Robust 1-bit compressed sensing via hinge loss minimization
cites work: Graph Implementations for Nonsmooth Convex Programs
cites work: Rejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons''
cites work: Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
cites work: Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
cites work: One-Bit Compressive Sensing With Projected Subgradient Method Under Sparsity Constraints
cites work: One-Bit Compressed Sensing by Greedy Algorithms
cites work: Matching pursuits with time-frequency dictionaries
cites work: Q4806224
cites work: Sparse Approximate Solutions to Linear Systems
cites work: CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
cites work: One-bit compressed sensing by linear programming
cites work: Dimension reduction by random hyperplane tessellations
cites work: Restricted eigenvalue properties for correlated Gaussian designs
cites work: Least absolute value regression: recent contributions
cites work: The \(L_1\) penalized LAD estimator for high dimensional linear regression
cites work: Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
DOI: 10.1007/S00041-022-09984-W
description: scientific article; zbMATH DE number 7634436