Accelerated dual descent for network flow optimization

IEEE Transactions on Automatic Control

Volumn 59, Issue 4, 2014, Pages 905-920

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

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Department of Electrical Engineering and Computer Science   (United States)

Author keywords

Convex functions; decentralized control; networks; optimization

Indexed keywords

ALGORITHMS; DECENTRALIZED CONTROL; FUNCTIONS; NETWORKS (CIRCUITS); NEWTON-RAPHSON METHOD;

CONVEX FUNCTIONS; DISTRIBUTED OPTIMIZATION; DISTRIBUTED SOLUTIONS; LINE SEARCH ALGORITHM; NETWORK FLOW OPTIMIZATIONS; NUMERICAL EXPERIMENTS; ORDERS OF MAGNITUDE; TAYLOR APPROXIMATION;

OPTIMIZATION;

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

References (40)

1. D. P. Bertsekas, Network Optimization: Continuous and Discrete Models. Belmont, MA, USA: Athena Scientific, 1998.
2. R. T. Rockafellar, Network Flows and Monotropic Programming. New York, NY, USA: Wiley, 1984.
3. J. B. Orlin, "Minimum convex cost dynamic network flows," Math. Operat. Res., pp. 190-207, May 1984.
4. E. Miandoabchi and R. Farahani, Graph Theory for Operations Research and Management. Hershey, PA, USA: IGI Global, 2012.
5. A. V. Goldberg, E. Tardos, and R. E. Tarjan, Network Flow Algorithms. Berlin, Germany: Springer-Verlag, 1990.
6. V. Kolmogorov and A. Shioura, "New algorithms for the dual of the convex cost network flow problem with application to computer vision," Mathematical Programming, Tech. Rep., 2007.
7. Y. Wu, A. Ribeiro, and G. B. Giannakis, "Robust routing in wireless multi-hop networks," in Proc. Conf. Inf. Sci. Syst., 2007.
8. L. Xiao, M. Johansson, and S. P. Boyd, "Simultaneous routing and resource allocation via dual decomposition," IEEE Trans. Commun., vol. 52, no. 7, pp. 1136-1144, 2004.
9. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
10. M. J. Neely, Stochastic Network Optimization with Application to Communication and Queueing Systems. San Rafael, CA, USA: Morgan & Claypool, 2010.
11. M. Zargham, A. Ribeiro, and A. Jadbabaie, "Accelerated dual descent for constrained convex network flow optimization," in Proc. IEEE CDC, 2013.
12. J. Sun and H. Kuo, "Applying a newton method to strictly convex separable network quadratic programs," SIAM J. Optimiz., vol. 8, pp. 728-745, 1998.
13. M. Zargham, A. Ribeiro, and A. Jadbabaie, "Accelerated backpressure algorithm," in Proc. IEEE Global Commun. Conf., 2013.
14. A. Nedic and A. Ozdaglar, "Distributed subgradientmethods formultiagent optimization," IEEE Trans. Autom. Control, vol. 54, no. 1, pp. 4711-4716, Jan. 2009.
15. I. Lobel and A. Ozdaglar, "Distributed subgradient methods for convex optimization over randomnetworks," IEEE Trans. Autom. Control, vol. 56, no. 6, pp. 1291-1306, Jun. 2011.
16. N. Z. Shor,MinimizationMethods for Non-Differentiable Functions. New York, NY, USA: Springer, 1985.
17. D. P. Bertsekas and D. El Baz, "Distributed asynchronous relaxation methods for convex network flow problems," SIAM J. Optimiz. Control, vol. 25, pp. 74-85, 1987. (Pubitemid 17513617)
18. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U. K.: Cambridge Univ. Press, 2004.
19. Bertsekas and Gafni, "Projected newton methods and optimization of multicommodity flow," IEEE Trans. Autom. Control, vol. AC-28, no. 12, pp. 1090-1096, Dec. 1983. (Pubitemid 14503204)
20. J. G. Klincewicz, "A Newton Method for Convex Separable Network Flow Problems," Bell Laboratories, 1983.
21. S. Authuraliya and S. Low, "Optimization flow control with newtonlike algorithm," Telecomm. Syst., vol. 15, pp. 345-358, 2000. (Pubitemid 33220159)
22. A. Jadbabaie, A. Ozdaglar, and M. Zargham, "A distributed newton method for network optimization," in Proc. IEEE CDC, 2009, pp. 2736-2741.
23. P. Tseng, "On accelerated proximal gradient methods for convex-concave optimization," SIAM J. Optimiz., 2008 [Online]. Available: http://pages. cs. wisc. edu/ brecht/cs726docs/Tseng. APG. pdf, submitted for publication
24. Y. Saad, Iterative Methods for Sparse Linear Systems. Philadelphia, PA, USA: SIAM, 2003.
25. D. Watkins, The Matrix Eigenvalue Problem. Philadelphia, PA,USA: SIAM, 2007.
26. R. Horn and C. R. Johnson, Matrix Analysis. NewYork,NY,USA: Cambridge Univ. Press, 1985.
27. M. Zargham, A. Ribeiro, and A. Jadbabaie, "A distributed line search for network optimization," in Proc. IEEE ACC, 2012, pp. 472-477.
28. C. T. Kelley, "Solving nonlinear equations with newton's method," SIAM Fundamentals of Algorithms, vol. 1, 2003.
29. F. J. Bonnans, C. J. Gilbert, C. Lemarchal, and C. A. Sagastizbal, Numerical Optimization: Theoretical and Practical Aspects. Berlin, Germany: Springer-Verlag, 2006.
30. D. P. Bertsekas, Nonlinear Programming. Cambridge, MA, USA: Athena Scientific, 1999.
31. A. Nedi and A. Ozdaglar, "Approximate primal solutions and rate analysis for dual subgradient methods," SIAM J. Optimiz., vol. 19, pp. 1757-1780, 2008.
32. A. Nedi and A. Ozdaglar, "Subgradient methods in network resource allocation: Rate analysis," in Proc. CISS, 2008.
33. F. Chung, Spectral Graph Theory. Providence, RI, USA: Amer. Math. Soc., 1997.
34. H. Landau and A. Odlyzko, "Bounds for eigenvalues of certain stochastic matrices," Linear Algebra Applicat., vol. 38, pp. 5-15, 1981.
35. M. E. Newman, "The structure and function of complex networks," SIAM Rev., vol. 45, pp. 167-256, 2003.
36. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, pp. 440-442, 1998. (Pubitemid 28292183)
37. R. Olfati-Saber, "Ultrafast consensus in small-world networks," in Proc. IEEE ACC, 2005, pp. 2371-2378. (Pubitemid 41188970)
38. A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems," SIAM J. Imaging Sci., vol. 2, no. 1, pp. 183-202, 2009.
39. A. I. Chen and A. Ozdaglar, "A fast distributed proximal-gradient method," in Proc. Allerton Conf. Commun., Control, Comput., 2012.
40. M. Zargham, A. Ribeiro, and A. Jadbabaie, "Network optimization under uncertainty," in Proc. IEEE CDC, 2012, pp. 7470-7475.