Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints

DOI10.1007/S00041-022-09984-WzbMath1504.94051OpenAlexW4311445368MaRDI QIDQ2108537

Yanyan Li

Publication date: 19 December 2022

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00041-022-09984-w

zbMATH Keywords

least absolute deviationsparsitynon-smooth optimizationhard thresholdingone-bit compressed sensing

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15)

Related Items (1)

Matrix recovery from nonconvex regularized least absolute deviations

Uses Software

• CVX
• CoSaMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Best subset selection via a modern optimization lens
• The \(L_1\) penalized LAD estimator for high dimensional linear regression
• Iterative hard thresholding for compressed sensing
• Iterative thresholding for sparse approximations
• Noisy 1-bit compressive sensing: models and algorithms
• The restricted isometry property and its implications for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares
• Rejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
• Dimension reduction by random hyperplane tessellations
• One-Bit Compressed Sensing by Linear Programming
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
• Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
• Graph Implementations for Nonsmooth Convex Programs
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
• Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
• Flavors of Compressive Sensing
• Least absolute value regression: recent contributions
• Sparse Approximate Solutions to Linear Systems
• Matching pursuits with time-frequency dictionaries
• Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Robust 1-bit compressed sensing via hinge loss minimization
• One-bit compressed sensing with partial Gaussian circulant matrices
• NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
• One-Bit Compressive Sensing With Projected Subgradient Method Under Sparsity Constraints
• One-Bit Compressed Sensing by Greedy Algorithms
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• Adaptive greedy approximations

This page was built for publication: Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints