In this paper, we propose a method for solving the distributed optimization problem in which the objective function is the sum of separable convex functions with linear constraints. In our approach, the primal variable is partially updated to make the Method of Multiplier algorithm distributed which is based on the suitable scaling of constraint matrix. The algorithm is then viewed as a dynamical system the convergence analysis of which is done using the passivity concepts of nonlinear control theory. The convexity of the function is related to the passivity of the non-linear functions which is in feedback with the positive real linear system.
|Original language||English (US)|
|Title of host publication||2018 Annual American Control Conference, ACC 2018|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||6|
|State||Published - Aug 9 2018|
|Event||2018 Annual American Control Conference, ACC 2018 - Milwauke, United States|
Duration: Jun 27 2018 → Jun 29 2018
|Name||Proceedings of the American Control Conference|
|Other||2018 Annual American Control Conference, ACC 2018|
|Period||6/27/18 → 6/29/18|
Bibliographical noteFunding Information:
*This work was supported by NSF grants CNS-1239319 and CCF-1320643, and AFOSR grant FA 9550-15-1-0119. 1Abhishek Rawat is with the Department of Electrical and Computer Engineering, Iowa State University, Ames, IA 50011, USA email@example.com 2Nicola Elia is with faculty of Electrical Engineering, Iowa State University, Ames, IA 50011, USA firstname.lastname@example.org
© 2018 AACC.