A distributed newton method for network utility maximization-i: Algorithm

IEEE Transactions on Automatic Control

Volumn 58, Issue 9, 2013, Pages 2162-2175

  Wei, Ermin ^a   Ozdaglar, Asuman ^a   Jadbabaie, Ali ^b  

^a USA   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

distributed Newton method; Distributed optimization; Network Utility Maximization (NUM); superlinear rate of convergence

Indexed keywords

CONVERGENCE RATE IMPROVEMENT; DISTRIBUTED INFORMATION; DISTRIBUTED OPTIMIZATION; FAST CONVERGING ALGORITHMS; FIRST-ORDER METHODS; NETWORK UTILITY MAXIMIZATIONS (NUM); OBJECTIVE FUNCTION VALUES; RATE OF CONVERGENCE;

APPROXIMATION THEORY; NEWTON-RAPHSON METHOD;

ALGORITHMS;

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

References (32)

1. S. Athuraliya and S. Low, "Optimization flow control with Newtonlike algorithm," J. Telecommun. Syst., vol. 15, pp. 345-358, 2000 (Pubitemid 33220159)
2. D. P. Bertsekas and E. M. Gafni, "Projected newton methods and optimization of multicommodity flows," IEEE Trans. Automat. Control, vol. 28, no. 12, 1983
3. N. Biggs, Algebraic Graph Theory, 2nd ed. Cambridge: Cambridge Univ. Press, 1993
4. V. D. Blondel, J. M. Hendrickx, A. Olshevsky, and J. N. Tsitsiklis, "Convergence in multiagent coordination, consensus, and flocking," in Proc. IEEE CDC, 2005
5. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge: Cambridge Univ. Press, 2004
6. G. H. Bradley, G. G. Brown, and G. W. Graves, "Design and implementation of large scale primal transshipment algorithms," Management Sci., vol. 24, no. 1, pp. 1-34, 1977
7. M. Chiang, S. H. Low, A. R. Calderbank, and J. C. Doyle, "Layering as optimization decomposition: A mathematical theory of network architectures," Proc. IEEE, vol. 95, no. 1, pp. 255-312, 2007
8. F. R. K. Chung, Spectral Graph Theory (CBMS Regional Conference Series inMathematics) No. 92, AmericanMathematical Society, 1997
9. R. Cottle, J. Pang, and R. Stone, The Linear Complementarity Problem. New York: Academic Press, 1992
10. R. Freund and F. Jarre, "A qmr-based interior point algorithm for solving linear programs," Mathemat. Prog., no. 76, pp. 183-210, 1996
11. A. Jadbabaie, J. Lin, and S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Trans. Automat. Control, vol. 48, no. 6, pp. 988-1001, 2003
12. A. Jadbabaie, A. Ozdaglar, and M. Zargham, "A distributed newton method for network optimization," in Proc. of CDC, 2009
13. F. Jarre, "Interior-point methods for convex programming," Appl. Mathemat. Optimization, vol. 26, pp. 287-311, 1992
14. F. P. Kelly, "Charging and rate control for elastic traffic," Euro. Trans. Telecommun., vol. 8, pp. 33-37, 1997
15. F. P. Kelly, A. K. Maulloo, and D. K. Tan, "Rate control for communication networks: Shadow prices, proportional fairness, and stability," J. Operational Research Society, vol. 49, pp. 237-252, 1998 (Pubitemid 128610018)
16. J. G. Klincewicz, "A newton method for convex separable network flow problems," Networks, vol. 13, pp. 427-442, 1983
17. S. H. Low and D. E. Lapsley, "Optimization flow control, I: Basic algorithm and convergence," IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 861-874, 1999 (Pubitemid 30553383)
18. A. Nedic and A. Ozdaglar, "Cooperative distributed multi-agent optimization," in Convex Optimization in Signal Processing and Communications, Y. Eldar and D. Palomar, Eds. Cambridge: Cambridge Univ. Press, 2008
19. A. Nedic and A. Ozdaglar, "Distributed subgradientmethods formultiagent optimization," IEEE Trans. Automat. Control,, vol. 54, no. 1, pp. 48-61, Jan. 2009
20. A. Nedic and A. Ozdaglar, "Convergence rate for consensus with delays," J. Global Optimization, vol. 47, no. 3, pp. 437-456, 2010
21. Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming. Philadelphia: SIAM, 2001
22. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE Trans. Automat. Control, vol. 49, no. 9, pp. 1520-1533, 2004
23. A. Olshevsky and J. N. Tsitsiklis, "Convergence speed in distributed consensus and averaging," SIAM J. Control Optimization, vol. 48, no. 1, pp. 33-35, 2009
24. C. Paige and M. Saunders, "Solution of sparse indefinite systems of linear equations," SIAM J. Numerical Analysis, vol. 12, no. 4, pp. 617-629, 1975
25. Y. Saad, Iterative Methods for Sparse Linear Systems, 2nd ed. Philadelphia, PA, USA: SIAM, 2003
26. R. Srikant, The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications). Boston: Birkhäuser, 2004
27. J. N. Tsitsiklis, "Problems in Decentralized Decision Making and Computation," Ph.D. thesis, Dept. Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, 1984
28. J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans, "Distributed asynchronous deterministic and stochastic gradient optimization algorithms," IEEE Trans. Automat. Control, vol. 31, no. 9, pp. 803-812, 1986 (Pubitemid 16629805)
29. R. Varga, Gershgorin and His Circles. Berlin: Springer Series in Computational Mathematics, 2004
30. E.Wei, A. Ozdaglar, and A. Jadbabaie, "A distributed Newton method for network utility maximization I, Algorithm," LIDS Report 2832 [Online]. Available: http://www.mit.edu/~erminwei/Publication.html 2011
31. E.Wei, A. Ozdaglar, and A. Jadbabaie, "A distributed Newton method for network utility maximization II, Convergence," LIDS Report 2870 [Online]. Available: http://www.mit.edu/~erminwei/Publication.html 2011
32. E. Wei, M. Zargham, A. Ozdaglar, and A. Jadbabaie, "On dual convergence of the distributed Newton method for Network Utility Maximization," in Proc. 50th IEEE Conf. Decision and Control/European Control Conference, 2011