Primal–dual algorithm for distributed constrained optimization
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 constraints assigned to the agents. Based on the augmented...
Uloženo v:
| Vydáno v: | Systems & control letters Ročník 96; s. 110 - 117 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.10.2016
|
| Témata: | |
| ISSN: | 0167-6911, 1872-7956 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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 constraints 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(1k) 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. |
|---|---|
| ISSN: | 0167-6911 1872-7956 |
| DOI: | 10.1016/j.sysconle.2016.07.009 |