On convergence of an augmented Lagrangian decomposition method for sparse convex-optimization

A decomposition method for large-scale convex optimization problems with block-angular structure and many linking constraints is analysed. The method is based on separable approximation of the augemented Lagrangian function. Weak global convergence of the method is proved and speed of convergence analysed. It is shown that convergence properties of the method are heavily dependent on sparsity of the linking constraints. Application to large-scale linear programming and stochastic programming is discussed.