Optimal Greedy Sparse Solver

There are 10s of greedy algorithms for solving y=Ax where x is sparse. But what do they actually solve?
3 Downloads
Updated 5 Mar 2026

View License

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://uk.mathworks.com/matlabcentral/fileexchange/183345-optimal-greedy-sparse-solver), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2025b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Version Published Release Notes
1.0.0