Journal
ABSTRACT AND APPLIED ANALYSIS
Volume -, Issue -, Pages -Publisher
HINDAWI LTD
DOI: 10.1155/2013/183961
Keywords
-
Categories
Funding
- Natural Science Foundation of Jiangsu Province
- National Natural Science Foundation of China [71271112]
- university natural science research fund of jiangsu province [13KJD110002]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available