Distributed convex optimization in networks of agents with single-integrator dynamics

In this paper, distributed convex optimization problem over undirected dynamical networks is studied. Here, networked agents are supposed to rendezvous at a point that is the solution of a global convex optimization problem with some local inequality constraints. To this end, all agents shall cooperate with their neighbors to seek the optimum point of the network's global objective function. A consensus-based distributed optimization algorithm is proposed, which combines an interior-point optimization algorithm with a nonlinear consensus protocol to find the optimum value of a convex objective function. We tackle this problem by addressing its subproblems, namely a consensus problem and a convex optimization problem. Firstly, we propose a saturation protocol for the consensus subproblem. Then, to solve the distributed optimization part, we implement an updating rule, which yields the optimum value of the global objective function, with the help of local estimators in a distributed way. Convergence analysis for the proposed protocol based on the Lyapunov stability theory for time-varying nonlinear systems is included. A simulation example is given at the end to illustrate the effectiveness of the proposed algorithm.

[1]  Yongcan Cao,et al.  Distributed Average Tracking of Multiple Time-Varying Reference Signals With Bounded Derivatives , 2012, IEEE Transactions on Automatic Control.

[2]  Stephen P. Boyd,et al.  Distributed optimization for cooperative agents: application to formation flight , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[3]  G. Tao.  A simple alternative to the Barbalat lemma , 1997, IEEE Trans. Autom. Control..

[4]  Sonia Martínez,et al.  Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication , 2014, Autom..

[5]  Feng Liu,et al.  Distributed gradient algorithm for constrained optimization with application to load sharing in power systems , 2015, Syst. Control. Lett..

[6]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.

[7]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[8]  Jing Wang,et al.  A control perspective for centralized and distributed convex optimization , 2011, IEEE Conference on Decision and Control and European Control Conference.

[9]  Lihua Xie,et al.  Distributed constrained optimal consensus of multi-agent systems , 2016, Autom..

[10]  Fernando Paganini,et al.  Stability of primal-dual gradient dynamics and applications to network optimization , 2010, Autom..

[11]  Magnus Egerstedt,et al.  Continuous-time proportional-integral distributed optimisation for networked systems , 2013, 1309.6613.

[12]  Choon Yik Tang,et al.  Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case , 2011, IEEE Transactions on Automatic Control.

[13]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[14]  Marios M. Polycarpou,et al.  A Robust Adaptive Nonlinear Control Design , 1993, 1993 American Control Conference.

[15]  P. Olver.  Nonlinear Systems , 2013 .

[16]  Shengyuan Xu,et al.  Distributed Primal–Dual Subgradient Method for Multiagent Optimization via Consensus Algorithms , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).