cr.sparse.cvx.adm.yall1.solve_bp

cr.sparse.cvx.adm.yall1.solve_bp(A, b, x0, z0, w, nonneg, gamma, tolerance, max_iters)

Solves the problem \(\min \| x \|_1 \, \\text{s.t.}\, A x = b\) using ADMM

This function implements eq 2.29 of the paper.