Greedy Algorithms promoting Group Sparsity
Approximate Greedy Solutions to the problem min||x(k)||_2,0 such that Ax = b
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
BOMP - Block Orthogonal Matching Pursuit
Proposed by Eldar & Bolcskei
GOMP - Group Orthogonal Matching Pursuit
Differeing from BOMP in the way, sparse group is chosen
StGOMP - Stagewise Group Orthogonal Matching Pursuit
Combining ideas from StOMP and BOMP. Selects multiple groups simultaneously.
ReGOMP - Regularized Group Orthogonal Matching Pursuit
Combining ROMP and GOMP.
Cite As
Angshul Majumdar (2026). Greedy Algorithms promoting Group Sparsity (https://in.mathworks.com/matlabcentral/fileexchange/22771-greedy-algorithms-promoting-group-sparsity), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired: Greedy Algorithms promoting Group Sparsity V2, CoSaMP and OMP for sparse recovery
General Information
- Version 1.0.0.0 (4.53 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
