Adaptive projected gradient thresholding methods for constrained l₀ problems
From MaRDI portal
Adaptive projected gradient thresholding methods for constrained \(l 0\) problems
Recommendations
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- A gradient projection method for the sparse signal reconstruction in compressive sensing
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- A box constrained gradient projection algorithm for compressed sensing
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A hybrid optimization approach to index tracking
- An efficient optimization approach for a cardinality-constrained index tracking problem
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic Decomposition by Basis Pursuit
- Cardinality versus \(q\)-norm constraints for index tracking
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing
- Hard thresholding pursuit: an algorithm for compressive sensing
- Iterative hard thresholding for compressed sensing
- Least angle regression. (With discussion)
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- On the convergence of an active-set method for \(\ell_1\) minimization
- Optimality conditions and a smoothing trust region Newton method for nonlipschitz optimization
- Pathwise coordinate optimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Approximation via Penalty Decomposition Methods
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Stable signal recovery from incomplete and inaccurate measurements
Cited in
(4)- Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares
- Efficient projected gradient methods for cardinality constrained optimization
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares
This page was built for publication: Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892792)
