Optimal group thresholding algorithms for group sparse optimization with convergence guarantee
From MaRDI portal
Cites work
- A proximal-gradient homotopy method for the sparse least-squares problem
- Compressed sensing: how sharp is the restricted isometry property?
- Constrained mix sparse optimization via hard thresholding pursuit
- Decoding by Linear Programming
- Greedy Algorithms for Joint Sparse Recovery
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Hard thresholding pursuit: an algorithm for compressive sensing
- Iterative thresholding for sparse approximations
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- Joint sparse recovery based on variances
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Model-Based Compressive Sensing
- New Bounds for Restricted Isometry Constants With Coherent Tight Frames
- On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Optimization with sparsity-inducing penalties
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sparse broadband beamformer design via proximal optimization Techniques
- Sparse least squares K-SVCR multi-class classification
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery
This page was built for publication: Optimal group thresholding algorithms for group sparse optimization with convergence guarantee
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7309216)
