An ADMM Algorithm for a Class of Total Variation Regularized Estimation Problems

Details An ADMM Algorithm for a Class of Total Variation Regularized Estimation Problems An ADMM Algorithm for a Class of Total Variation Regularized Estimation Problems

2012-03-08

arxiv.org/abs/1203.1828v1

Statistics

Machine Learning

Scientific paper

We present an alternating augmented Lagrangian method for convex optimization problems where the cost function is the sum of two terms, one that is separable in the variable blocks, and a second that is separable in the difference between consecutive variable blocks. Examples of such problems include Fused Lasso estimation, total variation denoising, and multi-period portfolio optimization with transaction costs. In each iteration of our method, the first step involves separately optimizing over each variable block, which can be carried out in parallel. The second step is not separable in the variables, but can be carried out very efficiently. We apply the algorithm to segmentation of data based on changes inmean (l_1 mean filtering) or changes in variance (l_1 variance filtering). In a numerical example, we show that our implementation is around 10000 times faster compared with the generic optimization solver SDPT3.

Affiliated with

Also associated with

No associations

Rating

An ADMM Algorithm for a Class of Total Variation Regularized Estimation Problems 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 An ADMM Algorithm for a Class of Total Variation Regularized Estimation Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An ADMM Algorithm for a Class of Total Variation Regularized Estimation Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-17540