Multidimensional Newton-Raphson consensus for distributed convex optimization

Proceedings of the American Control Conference

Volumn , Issue , 2012, Pages 1079-1084

  Zanella, Filippo ^a   Varagnolo, Damiano ^a   Cenedese, Angelo ^a   Pillonetto, Gianluigi ^a   Schenato, Luca ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

consensus algorithms; multi agent systems; multidimensional convex optimization; multidimensional distributed optimization; Newton Raphson methods

Indexed keywords

CONVEX OPTIMIZATION; COST FUNCTIONS; NEWTON-RAPHSON METHOD;

COMMUNICATION BANDWIDTH; CONSENSUS ALGORITHMS; CONVERGENCE SPEED; DISTRIBUTED OPTIMIZATION; LIMITED COMMUNICATION; MULTI-AGENTS SYSTEMS; OPTIMIZATION STRATEGY; TIME-SCALES;

MULTI AGENT SYSTEMS;

EID: 84869452559     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acc.2012.6314602     Document Type: Conference Paper

References (28)

1. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Athena Scientific, 1997.
2. D. P. Bertsekas, Network Optimization: Continuous and Discrete Models. Belmont, Massachusetts: Athena Scientific, 1998.
3. K. C. Kiwiel, "Convergence of approximate and incremental subgradient methods for convex optimization," SIAM J. on Optim., vol. 14, no. 3, pp. 807-840, 2004.
4. B. Johansson, "On distributed optimization in networked systems," Ph.D. dissertation, KTH Electrical Engineering, 2008.
5. A. Nedić and D. P. Bertsekas, "Incremental subgradient methods for nondifferentiable optimization," SIAM J. on Optim., vol. 12, no. 1, pp. 109-138, 2001.
6. D. Blatt, A. Hero, and H. Gauchman, "A convergent incremental gradient method with a constant step size," SIAM J. on Optim., vol. 18, no. 1, pp. 29-51, 2007.
7. S. S. Ram, A. Nedić, and V. Veeravalli, "Incremental stochastic subgradient algorithms for convex optimzation," SIAM J. on Optim., vol. 20, no. 2, pp. 691-717, 2009.
8. A. Nedić, A. Ozdaglar, and P. A. Parrilo, "Constrained consensus and optimization in multi-agent networks," IEEE TAC, vol. 55, no. 4, pp. 922-938, 2010.
9. L. Xiao, M. Johansson, and S. Boyd, "Simultaneous routing and resource allocation via dual decomposition," IEEE Trans. on Comm., vol. 52, no. 7, pp. 1136-1144, 2004.
10. I. D. Schizas, A. Ribeiro, and G. B. Giannakis, "Consensus in ad hoc WSNs with noisy links-part I: Distributed estimation of deterministic signals," IEEE Trans. on Sig. Proc., vol. 56, pp. 350-364, 2008.
11. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, "Distributed optimization and statistical learning via the alternating direction method of multipliers," Stanford Statistics Dept., Tech. Rep., 2010.
12. C. Fischione, "F-Lipschitz optimization with Wireless Sensor Networks applications," IEEE TAC, vol. to appear, pp.-, 2011.
13. C. Fischione and U. Jönsson, "Fast-Lipschitz optimization with Wireless Sensor Networks applications," in IPSN, 2011.
14. J. Van Ast, R. Babška, and B. D. Schutter, "Particle swarms in optimization and control," in IFAC World Congress, 2008.
15. E. Alba and J. M. Troya, "A survey of parallel distributed genetic algorithms," Complexity, vol. 4, no. 4, pp. 31-52, 1999.
16. F. Zanella, D. Varagnolo, A. Cenedese, G. Pillonetto, and L. Schenato, "Newton-Raphson consensus for distributed convex optimization," in IEEE Conference on Decision and Control, 2011.
17. F. Garin and L. Schenato, Networked Control Systems. Springer, 2011, ch. A survey on distributed estimation and control applications using linear consensus algorithms, pp. 75-107.
18. P. Kokotović, H. K. Khalil, and J. O'Reilly, Singular Perturbation Methods in Control: Analysis and Design, ser. Classics in applied mathematics. SIAM, 1999, no. 25.
19. H. K. Khalil, Nonlinear Systems, 3rd ed. Prentice Hall, 2001.
20. Y. C. Ho, L. Servi, and R. Suri, "A class of center-free resource allocation algorithms," Large Scale Systems, vol. 1, pp. 51-62, 1980.
21. L. Xiao and S. Boyd, "Optimal scaling of a gradient method for distributed resource allocation," J. Opt. Theory and Applications, vol. 129, no. 3, pp. 469-488, 2006.
22. K. Tanabe, "Global analysis of continuous analogues of the Levenberg-Marquardt and Newton-Raphson methods for solving nonlinear equations," Inst. of Stat. Math., vol. 37, pp. 189-203, 1985.
23. R. Hauser and J. Nedić, "The continuous Newton-Raphson method can look ahead," SIAM J. on Opt., vol. 15, pp. 915-925, 2005.
24. S. Athuraliya and S. H. Low, "Optimization flow control with newtonlike algorithm," Telecommunication Systems, vol. 15, no. 3-4, pp. 345-358, 2000.
25. M. Zargham, A. Ribeiro, A. Ozdaglar, and A. Jadbabaie, "Accelerated dual descent for network optimization," in ACC, 2011.
26. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.
27. S. Becker and Y. L. Cun, "Improving the convergence of backpropagation learning with second order models," University of Toronto, Tech. Rep. CRG-TR-88-5, September 1988.
28. G. H. Golub and C. F. Van Loan, Matrix Computations. Johns Hopkins University Press, 1996, sec. 4.2.