Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
From MaRDI portal
Publication:2108537
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)
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
Cites work
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares
- Adaptive greedy approximations
- Asymptotic analysis of high-dimensional LAD regression with Lasso smoother
- Best subset selection via a modern optimization lens
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Compressed sensing
- Decoding by Linear Programming
- Dimension reduction by random hyperplane tessellations
- Flavors of compressive sensing
- Graph implementations for nonsmooth convex programs
- Hard thresholding pursuit: an algorithm for compressive sensing
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Least absolute value regression: recent contributions
- Matching pursuits with time-frequency dictionaries
- NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
- Noisy 1-bit compressive sensing: models and algorithms
- One-Bit Compressive Sensing With Projected Subgradient Method Under Sparsity Constraints
- One-bit compressed sensing by greedy algorithms
- One-bit compressed sensing by linear programming
- One-bit compressed sensing with partial Gaussian circulant matrices
- Rejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
- Restricted eigenvalue properties for correlated Gaussian designs
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
- Robust 1-bit compressed sensing via hinge loss minimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Sparse Approximate Solutions to Linear Systems
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Stable signal recovery from incomplete and inaccurate measurements
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The \(L_1\) penalized LAD estimator for high dimensional linear regression
- The restricted isometry property and its implications for compressed sensing
- Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
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)
