Accelerated dual descent for network optimization

Proceedings of the American Control Conference

Volumn , Issue , 2011, Pages 2663-2668

  Zargham, Michael ^a   Ribeiro, Alejandro ^a   Ozdaglar, Asuman ^b   Jadbabaie, Ali ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b USA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INVERSE PROBLEMS; NEWTON-RAPHSON METHOD;

DISTRIBUTED IMPLEMENTATION; DISTRIBUTED OPTIMIZATION; MATRIX SPLITTINGS; NETWORK OPTIMIZATION; NETWORK OPTIMIZATION PROBLEM; ORDERS OF MAGNITUDE; SUPERLINEAR CONVERGENCE; TAYLOR APPROXIMATION;

CONVERGENCE OF NUMERICAL METHODS;

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

References (20)

1. S. Authuraliya and S. H. Low, Optimization flow control with newtonlike algorithm, Telecommunications Systems 15 (2000), 345-358.
2. Bertsekas and Gafni, Projected newton methods and optimization of multi-commodity flow, 1983, pp. 1090-1096.
3. D.P. Bertsekas, Nonlinear programming, Athena Scientific, Cambridge, Massachusetts, 1999.
4. D.P. Bertsekas, A. Nediaposc, and A.E. Ozdaglar, Convex analysis and optimization, Athena Scientific, Cambridge, Massachusetts, 2003.
5. S. Boyd and L. Vandenberghe, Convex optimization, Cambridge University Press, Cambridge, UK, 2004.
6. 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 (2007), no. 1, 255-312.
7. A. Jadbabaie, J. Lin, and S. Morse, Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE Transactions on Automatic Control 48 (2003), no. 6, 988-1001.
8. A. Jadbabaie, A. Ozdaglar, and M. Zargham, A distributed newton method for network optimization, Proceedings of IEEE CDC, 2009.
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 (1998), 237-252. (Pubitemid 128610018)
10. J. G. Klincewicz, A newton method for convex separable network flow problems, Bell Laboratories (1983).
11. H. J. Landau and A. M. Odlyzko, Bounds for eigenvalues of certain stochastic matrices, Linear Algebra and its Applications 38 (1981), 5-15.
12. S. Low and D.E. Lapsley, Optimization flow control, I: Basic algorithm and convergence, IEEE/ACM Transactions on Networking 7 (1999), no. 6, 861-874.
13. A. Nedić and A. Ozdaglar, Approximate primal solutions and rate analysis for dual subgradient methods, SIAM Journal on Optimization, forthcoming (2008).
14. -, Distributed subradient methods for multi-agent optimization, IEEE Transactions on Automatic Control, forthcoming (2008).
15. -, Subgradient methods in network resource allocation: Rate analysis, Proc. of CISS, 2008.
16. A. Ribeiro, Ergodic stochastic optimization algorithms for wireless communication and networking, IEEE Transactions on Signal Processing (2009).
17. A. Ribeiro and G. B. Giannakis, Separation theorems of wireless networking, IEEE Transactions on Information Theory (2007).
18. R. Srikant, Mathematics of Internet congestion control, Birkhauser, 2004.
19. E. Wei, A. Ozdaglar, and A. Jadbabaie, A distributed newton method for network utility maximization, LIDS Technical Report 2832 (2010).
20. M. Zargham, A. Ribeiro, A. Ozdaglar, and A. Jadbabaie, Accelerated dual descent for network optimization, arXiv.org (2011).