An accelerated proximal alternating direction method of multipliers for robust fused Lasso

In the era of big data, much of the data is susceptible to noise with heavy-tailed distribution. Fused Lasso can effectively handle high dimensional sparse data with strong correlation between two adjacent variables under known Gaussian noise. However, it has poor robustness to nonGaussian noise with heavy-tailed distribution. Robust fused Lasso with l1 norm loss function can overcome the drawback of fused Lasso when noise is heavy-tailed distribution. But the key challenge for solving this model is nonsmoothness and its nonseparability. Therefore, in this paper, we first deform the robust fused Lasso into an easily solvable form, which changes the three-block objective function to a two-block form. Then, we propose an accelerated proximal alternating direction method of multipliers (APADMM) with an additional update step, which is base on a new PADMM that changes the Lagrangian multiplier term update. Furthermore, we give the O(1/K) nonergodic convergence rate analysis of the proposed APADMM. Finally, numerical results show that the proposed new PADMM and APADMM have better performance than other existing ADMM solvers.