Mathematics – Optimization and Control
Scientific paper
2011-06-27
Mathematics
Optimization and Control
Scientific paper
In this paper, we propose and analyze an accelerated linearized Bregman (ALB) method for solving the basis pursuit and related sparse optimization problems. This accelerated algorithm is based on the fact that the linearized Bregman (LB) algorithm is equivalent to a gradient descent method applied to a certain dual formulation. We show that the LB method requires $O(1/\epsilon)$ iterations to obtain an $\epsilon$-optimal solution and the ALB algorithm reduces this iteration complexity to $O(1/\sqrt{\epsilon})$ while requiring almost the same computational effort on each iteration. Numerical results on compressed sensing and matrix completion problems are presented that demonstrate that the ALB method can be significantly faster than the LB method.
Goldfarb Donald
Huang Bo
Ma Shiqian
No associations
LandOfFree
Accelerated Linearized Bregman Method 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 Accelerated Linearized Bregman Method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Accelerated Linearized Bregman Method will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-638560