A distributed line search for network optimization

Proceedings of the American Control Conference

Volumn , Issue , 2012, Pages 472-477

  Zargham, Michael ^a   Ribeiro, Alejandro ^a   Jadbabaie, Ali ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION;

BACKTRACKING LINE SEARCH; DESCENT DIRECTIONS; GLOBAL INFORMATIONS; LINE SEARCH ALGORITHM; NEIGHBORHOOD INFORMATION; NEIGHBORING NODES; NETWORK OPTIMIZATION; NETWORK OPTIMIZATION PROBLEM;

INFORMATION USE;

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

References (20)

1. S. Authuraliya and S. Low, Optimization flow control with newton-like algorithm, Telecommunications Systems 15 (2000), 345-358.
2. Bertsekas and Gafni, Projected newton methods and optimization of multi-commodity flow, IEEE Transactions on Automatic Control 28 (1983), 1090-1096.
3. D.P. Bertsekas, Nonlinear programming, Athena Scientific, Cambridge, Massachusetts, 1999.
4. S. Boyd and L. Vandenberghe, Convex optimization, Cambridge University Press, Cambridge, UK, 2004.
5. M. Cao, D.A. Spielman, and A.S. Morse, A lower bound on convergence of a distributed network consensus algorithm, Proceedings of IEEE CDC, 2005.
6. R. Carli, F. Fagnani, A. Speranzon, and S. Zampieri, Communication constraints in coordinated consensus problems, Proceedings of IEEE ACC, 2006.
7. 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.
8. W. Hager and H. Zhang, A new conjugate gradient method with guaranteed descent and an efficient line search, SIAM journal of Optimization 16 (2005), 170-192.
9. A. Jadbabaie, A. Ozdaglar, and M. Zargham, A distributed newton method for network optimization, Proceedings of IEEE CDC, 2009.
10. 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.
11. J. G. Klincewicz, A newton method for convex separable network flow problems, Bell Laboratories (1983).
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. D. G. Luenberger, Linear and nonlinear programming, Klewer Academic Publishers, Boston, 2003.
14. A. Nedić and A. Ozdaglar, Approximate primal solutions and rate analysis for dual subgradient methods, SIAM Journal on Optimization, forthcoming (2008).
15. -, Subgradient methods in network resource allocation: Rate analysis, Proc. of CISS, 2008.
16. G. Di Pillo, On nonmonotone line search, Journal of Optimization Theory and its Applications 112, 315-330.
17. R. Srikant, Mathematics of Internet congestion control, Birkhauser, 2004.
18. M. Zargham, A. Ribeiro, A. Ozdaglar, and A. Jadbabaie, Accelerated dual descent for network optimization, Proceedings of IEEE ACC, 2011.
19. -, Accelerated dual descent for network optimization, IEEE Transactions on Automatic Control ((submitted)).
20. H. Zhang and W. Hager, a nonmonotone line search technique and its application to unconstrained optimization, SIAM journal of Optimization 14 (2004), 1043-1056.