ITERATION METHODS TO COMPUTE THE SEPARABLE CONVEX MINIMIZATION PROBLEMS
In this paper, the iteration method to compute the multi-block separable convex minimization problem with linear constraints. The condition of the problem is derived, and global convergences of the algorithm are proved.
iteration method, global convergence, linear constraints.
