On dual convergence of the distributed Newton method for Network Utility Maximization

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2011, Pages 6612-6617

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

^a USA   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NEWTON-RAPHSON METHOD;

CONVERGENCE RATE IMPROVEMENT; DUAL DECOMPOSITION; LOCAL QUADRATIC CONVERGENCE; NETWORK UTILITY MAXIMIZATION; NETWORK UTILITY MAXIMIZATIONS (NUM); RATE OF CONVERGENCE; SECOND-ORDER ALGORITHMS; SECOND-ORDER METHODS;

ERRORS;

EID: 84860676109     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2011.6161134     Document Type: Conference Paper

References (21)

1. S. Athuraliya and S. Low. Optimization flow control with Newton-like algorithm. Journal of Telecommunication Systems, 15:345-358, 2000.
2. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
3. M. Chiang, S. H. Low, A. R. Calderbank, and J.C. Doyle. Layering as optimization decomposition: a mathematical theory of network architectures. Proceedings of the IEEE, 95(1):255-312, 2007.
4. R. Cottle, J. Pang, and R. Stone. The Linear Complementarity Problem. Academic Press, 1992.
5. A. Jadbabaie, J. Lin, and S. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 48(6):988-1001, 2003.
6. A. Jadbabaie, A. Ozdaglar, and M. Zargham. A Distributed Newton method for network optimization. Proc. of CDC, 2009.
7. F. Jarre. Interior-point methods for convex programming. Applied Mathematics and Optimization, 26:287-311, 1992.
8. F. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33-37, 1997.
9. F. P. Kelly, A. K. Maulloo, and D. K. Tan. Rate control for communication networks: shadow prices, proportional fairness, and stability. Journal of the Operational Research Society, 49:237-252, 1998.
10. S. H. Low and D. E. Lapsley. Optimization flow control, I: basic algorithm and convergence. IEEE/ACM Transaction on Networking, 7(6):861-874, 1999.
11. J. Mo and J Walrand. Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8(5), 2000.
12. A. Nedic and A. Ozdaglar. Convex Optimization in Signal Processing and Communications, chapter Cooperative distributed multi-agent optimization. Eds., Eldar, Y. and Palomar, D., Cambridge University Press, 2008.
13. Y. Nesterov and A. Nemirovskii. Interior-Point Polynomial Algorithms in Convex Programming. SIAM, 2001.
14. A. Olshevsky and J. Tsitsiklis. Convergence speed in distributed consensus and averaging. SIAM Journal on Control and Optimization, 48(1):33-35, 2009.
15. J. Papandriopoulos, S. Dey, and J. Evans. Optimal and distributed protocols for cross-layer design of physical and transport layers in MANETs. IEEE/ACM Transactions on Networking, 16(6):1392-1405, 2008.
16. J. N. Tsitsiklis. Problems in Decentralized Decision Making and Computation. PhD thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1984.
17. E. Wei, A. Ozdaglar, and A. Jadbabaie. A distributed Newton method for Network Utility Maximization, I: Algorithm. LIDS Report 2832, 2011.
18. E. Wei, A. Ozdaglar, and A. Jadbabaie. A distributed Newton method for Network Utility Maximization, II: Convergence. LIDS Report 2870, 2011.
19. E. Wei, M. Zargham, A. Ozdaglar, and A. Jadbabaie. On dual convergence of the distributed Newton method for Network Utility Maximization. LIDS Report 2868, 2011.
20. L. Xiao and S. Boyd. Optimal scaling of a gradient method for distributed resource allocation. Journal of Optimization Theory and Applications, 129(3):469-488, 2006.
21. M. Zargham, A. Ribeiro, A. Ozdaglar, and A. Jadbabaie. Accelerated dual descent for network optimization. Proceedings of the American Control Conference, 2011.