Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
DOI10.1137/090777761zbMath1256.65060arXiv0912.1185MaRDI QIDQ3095057
Publication date: 28 October 2011
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.1185
algorithms; convergence; numerical experiments; alternating direction method; augmented Lagrangian function; compressive sensing; \(\ell_1\)-norm minimization; first-order primal-dual algorithm; basis pursuit problem; constrained basis pursuit denoising problem; sparse solution recovery; unconstrained basis pursuit denoising problem
65F22: Ill-posedness and regularization problems in numerical linear algebra
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C06: Large-scale problems in mathematical programming
Related Items
Uses Software