期刊
SIAM JOURNAL ON NUMERICAL ANALYSIS
卷 54, 期 2, 页码 625-640出版社
SIAM PUBLICATIONS
DOI: 10.1137/140974237
关键词
global linear convergence; alternating direction method; piecewise linear multifunctions; alternating proximal gradient method; error bound
资金
- NSFC [11371102, 11371197, 11431002]
- NSFC Key Project [91330201]
The numerical success of the alternating direction method of multipliers (ADMM) inspires much attention in analyzing its theoretical convergence rate. While there are several results on the iterative complexity results implying sublinear convergence rate for the general case, there are only a few results for the special cases such as linear programming, quadratic programming, and nonlinear programming with strongly convex functions. In this paper, we consider the convergence rate of ADMM when applying to the convex optimization problems that the subdifferentials of the underlying functions are piecewise linear multifunctions, including LASSO, a well-known regression model in statistics, as a special case. We prove that due to its inherent polyhedral structure, a recent global error bound holds for this class of problems. Based on this error bound, we derive the linear rate of convergence for ADMM. We also consider the proximal based ADMM and derive its linear convergence rate.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据