Constrained consensus and optimization in multi-agent networks

IEEE Transactions on Automatic Control

Volumn 55, Issue 4, 2010, Pages 922-938

  Nedic, Angelia ^a   Ozdaglar, Asuman ^b   Parrilo, Pablo A ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b USA   (United States)

Author keywords

Consensus; Constraints; Distributed optimization; Subgradient algorithms

Indexed keywords

ALTERNATING PROJECTION METHOD; CONSENSUS ALGORITHMS; CONSENSUS PROBLEMS; CONSTRAINED OPTIMIZATION PROBLEMS; CONSTRAINED PROBLEM; CONSTRAINT SET; CONVERGENCE RATES; CONVEX SET; DISTRIBUTED ALGORITHM; DISTRIBUTED OPTIMIZATION; GLOBAL OBJECTIVE; LOCAL AVERAGING; LOCAL CONSTRAINTS; MULTIAGENT NETWORKS; MULTIPLE AGENTS; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; STEPSIZE; SUB-GRADIENT ALGORITHM; SUBGRADIENT; TIME VARYING;

ALGORITHMS; DISCRETE COSINE TRANSFORMS; OPTIMAL SYSTEMS; SET THEORY; SIGNAL RECONSTRUCTION; TIME VARYING NETWORKS; TIME VARYING SYSTEMS;

CONSTRAINED OPTIMIZATION;

EID: 77950834661     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2010.2041686     Document Type: Article

References (30)

1. J. N. Tsitsiklis, "Problems in Decentralized Decision Making and Computation," Ph.D. dissertation, MIT, Cambridge, MA, 1984.
2. J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans, "Distributed asynchronous deterministic and stochastic gradient optimization algorithms," IEEE Trans. Autom. Control, vol.AC-31, no.9, pp. 803-812, Sep. 1986.
3. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1989.
4. T. Vicsek, A. Czirók, E. Ben-Jacob, I. Cohen, and O. Shochet, "Novel type of phase transitions in a system of self-driven particles," Phys. Rev. Lett., vol.75, no.6, pp. 1226-1229, 1995.
5. A. Jadbabaie, J. Lin, and S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Trans. Autom. Control, vol.48, no.6, pp. 988-1001, Jun. 2003.
6. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip algorithms: Design, analysis, and applications," in Proc. IEEE INFOCOM, 2005, pp. 1653-1664.
7. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE Trans. Autom. Control, vol.49, no.9, pp. 1520-1533, Sep. 2004.
8. M. Cao, D. A. Spielman, and A. S. Morse, "A lower bound on convergence of a distributed network consensus algorithm," in Proc. IEEE CDC, 2005, pp. 2356-2361.
9. A. Olshevsky and J. N. Tsitsiklis, "Convergence rates in distributed consensus and averaging," in Proc. IEEE CDC, 2006, pp. 3387-3392.
10. A. Olshevsky and J. N. Tsitsiklis, "Convergence speed in distributed consensus and averaging," SIAM J. Control Optim., vol.48, no.1, pp. 33-56, 2009.
11. J. R. Marden, G. Arslan, and J. S. Shamma, "Connections between cooperative control and potential games illustrated on the consensus problem," in Proc. Eur. Control Conf., 2007, pp. 4604-4611.
12. A. Nedić and A. Ozdaglar, "Distributed subgradient methods for multiagent optimization," IEEE Trans. Autom. Control, vol.54, no.1, pp. 48-61, Jan. 2009.
13. A. Nedić and A. Ozdaglar, "On the rate of convergence of distributed subgradient methods for multi-agent optimization," in Proc. IEEE CDC, 2007, pp. 4711-4716.
14. D. Blatt, A. O. Hero, and H. Gauchman, "A convergent incremental gradient method with constant stepsize," SIAM J. Optim., vol.18, no.1, pp. 29-51, 2007.
15. A. Nedić and D. P. Bertsekas, "Incremental subgradient method for nondifferentiable optimization," SIAM J. Optim., vol.12, pp. 109-138, 2001.
16. S. S. Ram, A. Nedić, and V. V. Veeravalli, Incremental Stochastic Sub- Gradient Algorithms for Convex Optimization 2008 [Online]. Available: http://arxiv.org/abs/0806.1092
17. B. Johansson, M. Rabi, and M. Johansson, "A simple peer-to-peer algorithm for distributed optimization in sensor networks," in Proc. 46th IEEE Conf. Decision Control, 2007, pp. 4705-4710.
18. F. Facchinei and J.-S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems. New York: Springer-Verlag, 2003.
19. J. von Neumann, Functional Operators. Princeton, NJ: Princeton Univ. Press, 1950.
20. N. Aronszajn, "Theory of reproducing kernels," Trans. Amer. Math. Soc., vol.68, no.3, pp. 337-404, 1950.
21. L. G. Gubin, B. T. Polyak, and E. V. Raik, "The method of projections for finding the common point of convex sets," U.S.S.R Comput. Math. Math. Phys., vol.7, no.6, pp. 1211-1228, 1967.
22. F. Deutsch, "Rate of convergence of the method of alternating projections," in Parametric Optimization and Approximation, B. Brosowski and F. Deutsch, Eds. Basel, Switzerland: Birkhäuser, 1983, vol.76, pp. 96-107.
23. F. Deutsch and H. Hundal, "The rate of convergence for the cyclic projections algorithm I: Angles between convex sets," J. Approx. Theory, vol.142, pp. 36-55, 2006. (Pubitemid 44309204)
24. V. D. Blondel, J. M. Hendrickx, A. Olshevsky, and J. N. Tsitsiklis, "Convergence in multiagent coordination, consensus, and flocking," in Proc. IEEE CDC, 2005, pp. 2996-3000.
25. A. Nedić, A. Olshevsky, A. Ozdaglar, and J. N. Tsitsiklis, "On distributed averaging algorithms and quantization effects," IEEE Transa. Autom. Control, vol.54, no.11, pp. 2506-2517, Nov. 2009.
26. J. Wolfowitz, "Products of indecomposable, aperiodic, stochastic matrices," Proc. Amer. Math. Soc., vol.14, no.4, pp. 733-737, 1963.
27. A. Nedić, A. Ozdaglar, and P. A. Parrilo, Constrained consensus and optimization in multi-agent networks Tech. Rep., 2008 [Online]. Available: http://arxiv.org/abs/0802.3922v2
28. D. P. Bertsekas, A. Nedić, and A. E. Ozdaglar, Convex Analysis and Optimization. Cambridge, MA: Athena Scientific, 2003.
29. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
30. A. Nedić and A. Ozdaglar, "Subgradient methods for saddle-point problems," J. Optim. Theory Appl., 2008.