The ADMM Algorithm for Distributed Quadratic Problems: Parameter Selection and Constraint Preconditioning
2016 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 64, no 2, 290-305 p.Article in journal (Refereed) PublishedText
This paper presents optimal parameter selection and preconditioning of the alternating direction method of multipliers (ADMM) algorithm for a class of distributed quadratic problems, which can be formulated as equality-constrained quadratic programming problems. The parameter selection focuses on the ADMM step-size and relaxation parameter, while the preconditioning corresponds to selecting the edge weights of the underlying communication graph. We optimize these parameters to yield the smallest convergence factor of the iterates. Explicit expressions are derived for the step-size and relaxation parameter, as well as for the corresponding convergence factor. Numerical simulations justify our results and highlight the benefits of optimal parameter selection and preconditioning for the ADMM algorithm.
Place, publisher, year, edition, pages
IEEE , 2016. Vol. 64, no 2, 290-305 p.
Distributed optimization, convergence rate, optimal step-size
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-180962DOI: 10.1109/TSP.2015.2480041ISI: 000367253400002OAI: oai:DiVA.org:kth-180962DiVA: diva2:898836
QC 201601292016-01-292016-01-262016-01-29Bibliographically approved