Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
DOI10.1007/S00041-022-09984-WzbMATH Open1504.94051OpenAlexW4311445368MaRDI QIDQ2108537FDOQ2108537
Authors: 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
Recommendations
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
- A new linear convergence result for the iterative soft thresholding algorithm
- A new penalized least absolute deviation model for high dimensional sparse linear regression and an efficient sequential linear programming algorithm
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Information theory (general) (94A15) 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)
Cites Work
- Title not available (Why is that?)
- Best subset selection via a modern optimization lens
- Restricted eigenvalue properties for correlated Gaussian designs
- Matching pursuits with time-frequency dictionaries
- Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
- Decoding by Linear Programming
- Title not available (Why is that?)
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- The \(L_1\) penalized LAD estimator for high dimensional linear regression
- Compressed sensing
- Least absolute value regression: recent contributions
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Graph implementations for nonsmooth convex programs
- Adaptive greedy approximations
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Sparse Approximate Solutions to Linear Systems
- Iterative thresholding for sparse approximations
- The restricted isometry property and its implications for compressed sensing
- One-bit compressed sensing by linear programming
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Hard thresholding pursuit: an algorithm for compressive sensing
- Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
- Asymptotic analysis of high-dimensional LAD regression with Lasso smoother
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares
- Dimension reduction by random hyperplane tessellations
- Flavors of compressive sensing
- Noisy 1-bit compressive sensing: models and algorithms
- One-bit compressed sensing with partial Gaussian circulant matrices
- Rejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
- One-Bit Compressive Sensing With Projected Subgradient Method Under Sparsity Constraints
- Robust 1-bit compressed sensing via hinge loss minimization
- NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
- One-bit compressed sensing by greedy algorithms
Cited In (1)
Uses Software
This page was built for publication: Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108537)
