Matching pursuit [1]} considers an expansive list of potential dictionary functions and greedily adds the function that lowers the value of the objective function (Eq. (REF )) most. Matching pursuit adds one function at a time to the model.
