Mathematics – Optimization and Control
Scientific paper
2009-11-03
Mathematics
Optimization and Control
22 pages, 1 figure
Scientific paper
In this article, we propose an algorithm, NESTA-LASSO, for the LASSO problem, i.e., an underdetermined linear least-squares problem with a 1-norm constraint on the solution. We prove under the assumption of the restricted isometry property (RIP) and a sparsity condition on the solution, that NESTA-LASSO is guaranteed to be almost always locally linearly convergent. As in the case of the algorithm NESTA proposed by Becker, Bobin, and Candes, we rely on Nesterov's accelerated proximal gradient method, which takes O(e^{-1/2}) iterations to come within e > 0 of the optimal value. We introduce a modification to Nesterov's method that regularly updates the prox-center in a provably optimal manner, and the aforementioned linear convergence is in part due to this modification. In the second part of this article, we attempt to solve the basis pursuit denoising BPDN problem (i.e., approximating the minimum 1-norm solution to an underdetermined least squares problem) by using NESTA-LASSO in conjunction with the Pareto root-finding method employed by van den Berg and Friedlander in their SPGL1 solver. The resulting algorithm is called PARNES. We provide numerical evidence to show that it is comparable to currently available solvers.
Gu Ming
Lim Lek-Heng
Wu Cinna Julie
No associations
LandOfFree
PARNES: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with PARNES: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PARNES: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-256217