This paper presents an iterative greedy algorithm, namely gradient matching pursuit (gradMP), to solve a general sparsity-constrained optimization. Our algorithm generalizes the idea of the CoSaMP algorithm to handle the nonquadratic structure of the objective function together with the general form of the sparse constraint. | An iterative greedy algorithm for sparsity-constrained optimization