论文部分内容阅读
In this talk,we consider the use of the proximal alternating direction method of multipliers to solve linearly constrained separable programming problems.We first review and develop some convergence and complexity analysis results of the algorithm for convex programming.