Part I of this paper presented a method for primal decomposition of large convex separable programs into a sequence of smaller subproblems. In this part, additional theory and development of a ...

We study the convergence of a proximal-like minimization algorithm using Bregman functions. We extend the convergence results by Censor and Zenios (1992) and by Chen and Teboulle (1993) by showing ...