期刊
ABSTRACT AND APPLIED ANALYSIS
卷 -, 期 -, 页码 -出版社
HINDAWI LTD
DOI: 10.1155/2013/183961
关键词
-
资金
- Natural Science Foundation of Jiangsu Province
- National Natural Science Foundation of China [71271112]
- university natural science research fund of jiangsu province [13KJD110002]
We consider a class of linearly constrained separable convex programming problems whose objective functions are the sum of three convex functions without coupled variables. For those problems, Han and Yuan (2012) have shown that the sequence generated by the alternating direction method of multipliers (ADMM) with three blocks converges globally to their KKT points under some technical conditions. In this paper, a new proof of this result is found under new conditions which are much weaker than Han and Yuan's assumptions. Moreover, in order to accelerate the ADMM with three blocks, we also propose a relaxed ADMM involving an additional computation of optimal step size and establish its global convergence under mild conditions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据