NESTA
NESTA: A fast and accurate first-order method for sparse recovery Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the recent field of compressed sensing is already quite immense. This paper applies a smoothing technique and an accelerated first-order algorithm, both from {it Yu. Nesterov} [Math. Program. 103, No. 1 (A), 127--152 (2005; Zbl 1079.90102)], and demonstrates that this approach is ideally suited for solving large-scale compressed sensing reconstruction problems as (1) it is computationally efficient; (2) it is accurate and returns solutions with several correct digits; (3) it is flexible and amenable to many kinds of reconstruction problems; and (4) it is robust in the sense that its excellent performance across a wide range of problems does not depend on the fine tuning of several parameters. Comprehensive numerical experiments on realistic signals exhibiting a large dynamic range show that this algorithm compares favorably with recently proposed state-of-the-art methods. We also apply the algorithm to solve other problems for which there are fewer alternatives, such as total-variation minimization and convex programs seeking to minimize the $ell_1$ norm of $W_x$ under constraints, in which $W$ is not diagonal. The code is available online as a free package in the Matlab language.
Keywords for this software
References in zbMATH (referenced in 71 articles , 1 standard article )
Showing results 1 to 20 of 71.
Sorted by year (- De Asmundis, Roberta; di Serafino, Daniela; Landi, Germana: On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems (2016)
- Fountoulakis, Kimon; Gondzio, Jacek: A second-order method for strongly convex $\ell _1$-regularization problems (2016)
- Giryes, Raja: Sampling in the analysis transform domain (2016)
- Hager, William W.; Yashtini, Maryam; Zhang, Hongchao: An $\mathcal O(1/k)$ convergence rate for the variable stepsize Bregman operator splitting algorithm (2016)
- Li, Jueyou; Chen, Guo; Dong, Zhaoyang; Wu, Zhiyou: A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (2016)
- Pereyra, Marcelo: Proximal Markov chain Monte Carlo algorithms (2016)
- Shefi, Ron; Teboulle, Marc: A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (2016)
- Dassios, Ioannis; Fountoulakis, Kimon; Gondzio, Jacek: A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems (2015)
- He, Niao; Juditsky, Anatoli; Nemirovski, Arkadi: Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (2015)
- Landi, G.: A modified Newton projection method for $\ell _1$-regularized least squares image deblurring (2015)
- Lan, Guanghui: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (2015)
- Li, Xinxin; Yuan, Xiaoming: A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging (2015)
- Li, Yusheng; Xie, Xinchang; Yang, Zhouwang: Alternating direction method of multipliers for solving dictionary learning models (2015)
- Ouyang, Yuyuan; Chen, Yunmei; Lan, Guanghui; Pasiliao, Eduardo jun.: An accelerated linearized alternating direction method of multipliers (2015)
- Starck, Jean-Luc; Murtagh, Fionn; Fadili, Jalal M.: Sparse image and signal processing. Wavelets and related geometric multiscale analysis (2015)
- Andersen, Martin S.; Hansen, Per Christian: Generalized row-action methods for tomographic imaging (2014)
- Aybat, N.S.; Iyengar, G.: A unified approach for minimizing composite norms (2014)
- Bühlmann, Peter; Meier, Lukas; van de Geer, Sara: Discussion: “A significance test for the lasso” (2014)
- Buja, A.; Brown, L.: Discussion: “A significance test for the lasso” (2014)
- Cai, T.Tony; Yuan, Ming: Discussion: “A significance test for the lasso” (2014)