This work is devoted to the study of a proximal decomposition algorithm for solving convex symmetric cone optimization with separable structures. The algorithm considered is based on the decomposition method proposed by Chen and Teboulle (1994), and the proximal generalized distance defined by Auslender and Teboulle (2006). Under suitable assumptions, first a class of proximal distances is constructed, therefore some examples are given. Second, it is proven that each limit point of the primal-dual sequences generated by the algorithm solves the problem. Finally, the global convergence is established.

## Article

View A Proximal Multiplier Method for Convex Separable Symmetric Cone Optimization