Constrained Consensus and Optimization in Multi-Agent Networks

We present distributed algorithms that can be used by multiple agents to align their estimates with a particular value over a network with time-varying connectivity. Our framework is general in that this value can represent a consensus value among multiple agents or an optimal solution of an optimization problem, where the global objective function is a combination of local agent objective functions. Our main focus is on constrained problems where the estimates of each agent are restricted to lie in different convex sets. To highlight the effects of constraints, we first consider a constrained consensus problem and present a distributed "projected consensus algorithm" in which agents combine their local averaging operation with projection on their individual constraint sets. This algorithm can be viewed as a version of an alternating projection method with weights that are varying over time and across agents. We establish convergence and convergence rate results for the projected consensus algorithm. We next study a constrained optimization problem for optimizing the sum of local objective functions of the agents subject to the intersection of their local constraint sets. We present a distributed "projected subgradient algorithm" which involves each agent performing a local averaging operation, taking a subgradient step to minimize its own objective function, and projecting on its constraint set. We show that, with an appropriately selected stepsize rule, the agent estimates generated by this algorithm converge to the same optimal solution for the cases when the weights are constant and equal, and when the weights are time-varying but all agents have the same constraint set.

[1]  F. Deutsch.  Rate of Convergence of the Method of Alternating Projections , 1984 .

[2]  Boris Polyak,et al.  The method of projections for finding the common point of convex sets , 1967 .

[3]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

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

[5]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[6]  Dimitri P. Bertsekas,et al.  Incremental Subgradient Methods for Nondifferentiable Optimization , 2001, SIAM J. Optim..

[7]  John N. Tsitsiklis,et al.  Problems in decentralized decision making and computation , 1984 .

[8]  J.N. Tsitsiklis,et al.  Convergence Rates in Distributed Consensus and Averaging , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[9]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.

[10]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[11]  J.N. Tsitsiklis,et al.  Convergence in Multiagent Coordination, Consensus, and Flocking , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[12]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[13]  J. Wolfowitz.  Products of indecomposable, aperiodic, stochastic matrices , 1963 .

[14]  Connections between cooperative control and potential games illustrated on the consensus problem , 2007, 2007 European Control Conference (ECC).

[15]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[17]  M. Cao,et al.  A Lower Bound on Convergence of a Distributed Network Consensus Algorithm , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[18]  Frank Deutsch,et al.  The rate of convergence for the cyclic projections algorithm I: Angles between convex sets , 2006, J. Approx. Theory.

[19]  John N. Tsitsiklis,et al.  On distributed averaging algorithms and quantization effects , 2007, 2008 47th IEEE Conference on Decision and Control.

[20]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[21]  Angelia Nedic,et al.  Incremental Stochastic Subgradient Algorithms for Convex Optimization , 2008, SIAM J. Optim..

[22]  C. Badea,et al.  The rate of convergence in the method of alternating projections , 2010, 1006.2047.

[23]  Alfred O. Hero,et al.  A Convergent Incremental Gradient Method with a Constant Step Size , 2007, SIAM J. Optim..

[24]  N. Aronszajn.  Theory of Reproducing Kernels. , 1950 .

[25]  Vicsek,et al.  Novel type of phase transition in a system of self-driven particles. , 1995, Physical review letters.

[26]  Angelia Nedic,et al.  On the rate of convergence of distributed subgradient methods for multi-agent optimization , 2007, 2007 46th IEEE Conference on Decision and Control.

[27]  Mikael Johansson,et al.  A simple peer-to-peer algorithm for distributed optimization in sensor networks , 2007, 2007 46th IEEE Conference on Decision and Control.

[28]  John N. Tsitsiklis,et al.  Convergence Speed in Distributed Consensus and Averaging , 2009, SIAM J. Control. Optim..

[29]  Angelia Nedic,et al.  Subgradient Methods for Saddle-Point Problems , 2009, J. Optimization Theory and Applications.