Non-Convex Analysis and Synthesis Priors

Algorithms for non-convex sparsity promoting analysis and synthesis priors

LpAnanlysis
Algorithm for solving problems of the form:
min ||Ax||_p s.t. ||y-Hx||_2 < err

LpSynthesis
Algorithm for solving problems of the form:
min ||x||_p s.t. ||y-Hx||_2 < err

LpplusTV
min ||x||_p + TVlambda*TV(A'x) s.t. ||y-Hx||_2 < err

All of them are efficient first-order algorithms. They do not have restrictions on the operators H or A.