A continuous-time decentralized optimization scheme with positivity constraints

In this paper we introduce a continuous-time version of a recently proposed decentralized multi-agent optimization scheme. In this scheme, a number of networked agents cooperate in locating the optimum of the sum of their individual objective functions. Each agent has access only to its own objective function and its neighbors' estimates of the collective optimum. Under mild assumptions, we derive explicit expressions for a lower bound on the algorithm's convergence rate and an upper bound on the agents' ultimate estimation error, in terms of relevant problem parameters. We build on the analytic techniques we previously introduced, in which we treat the evolution of the mean and deviation of agents' estimates as two coupled dynamic subsystems, and provide a Lyapunov argument for the practical asymptotic stability of their interconnection. More generally, this approach turns out to be useful in deriving sharper convergence results under weaker assumptions in the continuous-time case, as well as in providing an elegant way to account for the effects of positive projections that might need to be employed by each agent in some applications. Finally, we propose an application of this scheme to the design of fully decentralized dual resource allocation algorithms.

[1]  Ιωαννησ Τσιτσικλησ,et al.  PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION , 1984 .

[2]  Fernando Paganini,et al.  Krasovskii's method in the stability of network control , 2009, 2009 American Control Conference.

[3]  Lacra Pavel,et al.  Lyapunov analysis of a distributed optimization scheme , 2011, International Conference on NETwork Games, Control and Optimization (NetGCooP 2011).

[4]  Minghui Zhu,et al.  On distributed optimization under inequality constraints via Lagrangian primal-dual methods , 2010, Proceedings of the 2010 American Control Conference.

[5]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[6]  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).

[7]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

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

[9]  Lacra Pavel,et al.  An analytic framework for decentralized extremum seeking control , 2012, 2012 American Control Conference (ACC).

[10]  Choon Yik Tang,et al.  Zero-gradient-sum algorithms for distributed convex optimization: The continuous-time case , 2011, Proceedings of the 2011 American Control Conference.

[11]  Martin J. Wainwright,et al.  Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling , 2010, IEEE Transactions on Automatic Control.

[12]  P. Olver Nonlinear Systems , 2013 .

[13]  Asuman E. Ozdaglar,et al.  Constrained Consensus and Optimization in Multi-Agent Networks , 2008, IEEE Transactions on Automatic Control.

[14]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[15]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..