A Simplified Form of Block-Iterative Operator Splitting and an Asynchronous Algorithm Resembling the Multi-Block Alternating Direction Method of Multipliers
- 357 Downloads
This paper develops what is essentially a simplified version of the block-iterative operator splitting method already proposed by the author and P. Combettes, but with more general initialization conditions. It then describes one way of implementing this algorithm asynchronously under a computational model inspired by modern high-performance computing environments, which consist of interconnected nodes each having multiple processor cores sharing a common local memory. The asynchronous implementation framework is then applied to derive an asynchronous algorithm which resembles the alternating direction method of multipliers with an arbitrary number of blocks of variables. Unlike earlier proposals for asynchronous variants of the alternating direction method of multipliers, the algorithm relies neither on probabilistic control nor on restrictive assumptions about the problem instance, instead making only standard convex-analytic regularity assumptions. It also allows the proximal parameters to range freely between arbitrary positive bounds, possibly varying with both iterations and subproblems.
KeywordsAsynchronous algorithm Convex optimization Alternating direction method of multipliers (ADMM)
Mathematics Subject Classification47H05 47N10 90C25 65Y05
This work was supported in part by National Science Foundation (NSF) Grants 1115638 and 1617617, Computing and Communications Foundations, CISE directorate. The author would also like to thank Patrick Combettes, as this work grew out the same discussions with him that led to the joint work .
- 1.Fortin, M., Glowinski, R.: On decomposition-coordination methods using an augmented Lagrangian. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems, Studies in Mathematics and its Applications, vol. 15, pp. 97–146. North-Holland Publishing Co., Amsterdam (1983)Google Scholar
- 7.Zhang, R., Kwok, J.: Asynchronous distributed ADMM for consensus optimization. In: Jebara, T., Xing, E.P. (eds.) Proceedings of the 31st International Conference on Machine Learning (ICML-14) pp. 1701–1709. (2014)Google Scholar
- 10.Combettes, P.L., Eckstein, J.: Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions. Math. Program. (2016). doi: 10.1007/s10107-016-1044-0
- 11.Chen, C., Sun, R., Ye, Y.: On convergence of the multi-block alternating direction method of multipliers. In: Proceedings of the 8th International Congress on Industrial and Applied Mathematics, pp. 3–15. Higher Ed. Press, Beijing (2015)Google Scholar
- 16.Combettes, P.L.: Féjer monotonicity in convex optimization. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 106–114. Springer, Berlin (2001)Google Scholar
- 19.Rockafellar, R.T.: Convex analysis. Princeton Mathematical Series, No. 28. Princeton University Press, Princeton, NJ (1970)Google Scholar