Heavy-ball-based relaxed optimal s-thresholding algorithms for solving compressed sensing problem
From MaRDI portal
Publication:7015239
Cites work
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Best subset selection via a modern optimization lens
- Decoding by Linear Programming
- Distributed Heavy-Ball: A Generalization and Acceleration of First-Order Methods With Gradient Tracking
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Federated learning for minimizing nonsmooth convex loss functions
- Greedy sparsity-constrained optimization
- Hard thresholding pursuit: an algorithm for compressive sensing
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- Ideal spatial adaptation by wavelet shrinkage
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Iteratively consistent one-bit phase retrieval
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Optimality of robust online learning
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Some methods of speeding up the convergence of iteration methods
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
This page was built for publication: Heavy-ball-based relaxed optimal \(\mathrm{s}\)-thresholding algorithms for solving compressed sensing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7015239)
