Primal-dual algorithm for distributed constrained optimization

From MaRDI portal
Publication:325079

DOI10.1016/J.SYSCONLE.2016.07.009zbMATH Open1347.93019arXiv1510.08580OpenAlexW2963550797MaRDI QIDQ325079FDOQ325079


Authors: Jinlong Lei, Hai-Tao Fang, Hanfu Chen Edit this on Wikidata


Publication date: 17 October 2016

Published in: Systems \& Control Letters (Search for Journal in Brave)

Abstract: The paper studies a distributed constrained optimization problem, where multiple agents connected in a network collectively minimize the sum of individual objective functions subject to a global constraint being an intersection of the local constraint sets assigned to the agents. Based on the augmented Lagrange method, a distributed primal-dual algorithm with a projection operation included is proposed to solve the problem. It is shown that with appropriately chosen constant step size, the local estimates derived at all agents asymptotically reach a consensus at an optimal solution. In addition, the value of the cost function at the time-averaged estimate converges with rate O(frac1k) to the optimal value for the unconstrained problem. By these properties the proposed primal-dual algorithm is distinguished from the existing algorithms for distributed constrained optimization. The theoretical analysis is justified by numerical simulations.


Full work available at URL: https://arxiv.org/abs/1510.08580




Recommendations




Cites Work


Cited In (35)





This page was built for publication: Primal-dual algorithm for distributed constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325079)