Accelerated Dual Descent for constrained convex network flow optimization

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2013, Pages 1037-1042

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

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; INVERSE PROBLEMS;

APPROXIMATE INVERSE; CONVERGENCE RATES; DISTRIBUTED SOLUTIONS; MATRIX SPLITTINGS; NETWORK FLOW OPTIMIZATIONS; NUMERICAL EXPERIMENTS; ORDERS OF MAGNITUDE; SUBGRADIENT DESCENT;

CONSTRAINED OPTIMIZATION;

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

References (22)

1. J. B. Orlin. Minimum convex cost dynamic network flows. Mathematics Of Operations Research, May 1984.
2. E. Miandoabchi R. Farahani. Graph Theory for Operations Research and Management. IGI Global, 2012.
3. R. T. Rockafellar. Network Flows and Monotropic Programming. Wiley, New York, NY, 1984.
4. D. P. Bertsekas. Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont, MA, 1998.
5. Michal Piro and Deepankar Medhi. Routing, Flow, and Capacity Design in Communication and Computer Networks. Elsevier, 2004.
6. Lin Xiao, M. Johansson, and S.P. Boyd. Simultaneous routing and resource allocation via dual decomposition. IEEE Transactions on Communications, 52(7):1136-1144, 2004.
7. A. Nedic and A. Ozdaglar. Distributed subgradient methods for multiagent optimization. IEEE Transactions on Automatic Control, 54, 2009.
8. I. Lobel and A. Ozdaglar. Distributed subgradient methods for convex optimization over random networks, IEEE Transactions on Automatic Control, 56, 2011.
9. N. Z. Shor. Minimization Methods for Non-differentiable Functions. Springer, 1985.
10. S. Boyd and L. Van den berghe. Convex Optimization. Cambridge University Press, Cambridge, UK, 2004.
11. Dimitri P. Bertsekas and Didier El-Baz. Distributed asynchronous relaxation methods for convex network flow problems. SIAM Journal of Optimization and Control, 1987.
12. M. Zargham, A. Ribeiro, A. Ozdaglar, and A. Jadbabaie. Accelerated dual descent for network optimization. In Proceedings of IEEE ACC, 2011.
13. M. Zargham, A. Ribeiro, A. Ozdaglar, and A. Jadbabaie. Accelerated dual descent for network optimization. IEEE Transactions on Automatic Control, (submitted).
14. A. V. Goldberg, E. Tardos, and R. E. Tarjan. Network Flow Algorithms. Springer-Verlag, Berlin, 1990.
15. J. Sun and H. Kuo. Applying a newton method to strictly convex separable network quadratic programs. SIAM Journal of Optimization, 8, 1998.
16. R. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, New York, 1985.
17. D.P. Bertsekas. Nonlinear Programming. Athena Scientific, Cambridge, Massachusetts, 1999.
18. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: Design, analysis, and applications. In Proceedings of IEEE INFOCOM, 2005.
19. M. Zargham, A. Ribeiro, and A. Jadbabaie. Network optimization under uncertainty. Proceedings of IEEE CDC, 2012.
20. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37:1936-1948, 1992.
21. M. J. Neely. Stochastic Network Optimization with Application to Communication and Queueing Systems. Morgan and Claypool, 2010.
22. M. Zargham, A. Ribeiro, and A. Jadbabaie. Accelerated backpressure algorithm. ArXiv: http://arxiv.org/abs/1302.1475, 2013.