Optimal Greedy Sparse Solver
There are 10s of greedy algorithms for solving y=Ax where x is sparse. But what do they actually solve?
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
OMP, StOMP, SWOMP, ROMP, CoSAMP, Bayesian OMP, OLS, etc. are few of the popular solvers for sparse recovery: y=Ax where x is sparse.
In this work, we re-engineer our way back from the algorithms to a unifying objective. And then directly solve the objective. This is more optimal than all greedy algorithms in a sense.
Cite As
Angshul Majumdar (2026). Optimal Greedy Sparse Solver (https://in.mathworks.com/matlabcentral/fileexchange/183345-optimal-greedy-sparse-solver), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0 (11.6 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0 |
