Accelerated backpressure algorithm

Proceedings - IEEE Global Communications Conference, GLOBECOM

Volumn , Issue , 2013, Pages 2269-2275

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

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACKPRESSURE ALGORITHM; CONVERGENCE RATES; FEASIBILITY PROBLEM; LOCAL INFORMATION; NEWTON-LIKE ALGORITHM; NUMERICAL EXPERIMENTS; PACKET ARRIVALS; STOCHASTIC GRADIENT DESCENT ALGORITHM; STOCHASTICS; SUBGRADIENT DESCENT;

STOCHASTIC SYSTEMS;

EID: 84904087781     PISSN: 23340983     EISSN: 25766813     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2013.6831412     Document Type: Conference Paper

References (18)

1. 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.
2. L. Georgiadis, M. J. Neely, and L. Tassiulas. Resource allocation and crosslayer control in wireless networks. Foundations and Trends in Networking, 1:1-144, 2006.
3. M. J. Neely, E. Modiano, and C. E. Rohrs. Dynamic power allocation and routing for time varying wireless networks. IEEE Journal on Selected Areas in Communications, Special Issue on Wireless Ad-Hoc Networks, 23:89-103, 2005.
4. A. Nedíc and A. Ozdaglar. Distributed subradient methods for multi-agent optimization. IEEE Transactions on Automatic Control, forthcoming, 2008.
5. A. Ribeiro. Stochastic soft backpressure algorithms for routing and scheduling in wireless ad-hoc networks. In IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2009.
6. Bertsekas and Gafni. Projected newton methods and optimization of multicommodity flow. IEEE Transactions on Automatic Control, 28:1090-1096, 1983.
7. J. G. Klincewicz. A newton method for convex separable network flow problems. Bell Laboratories, 1983.
8. S. Authuraliya and S. Low. Optimization flow control with newton-like algorithm. Telecommunications Systems, 15:345-358, 2000.
9. A. Jadbabaie, A. Ozdaglar, and M. Zargham. A distributed newton method for network optimization. In Proceedings of IEEE CDC, 2009.
10. E. Wei, A. Ozdaglar, and A. Jadbabaie. A distributed newton method for network utility maximization. IEEE Transactions on Automatic Control (Accepted), 2011.
11. M. Zargham, A. Ribeiro, A. Ozdaglar, and A. Jadbabaie. Accelerated dual descent for network optimization. IEEE Transactions on Automatic Control, submitted.
12. M. Zargham, A. Ribeiro, and A. Jadbabaie. Network optimization under uncertainty. In Proceedings of IEEE CDC, 2012.
13. A. Ribeiro and G. B. Giannakis. Separation theorems of wireless networking. IEEE Transactions on Information Theory, 2007.
14. Sham M. Kakade, Shai Shalev-Shwartz, and Ambuj Tewari. On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization. Toyota Technological Institute, Chicago, USA, 2009.
15. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, Cambridge, UK, 2004.
16. M. Zargham, A. Ribeiro, and A. Jadbabaie. Accelerated dual descent for constrained convex network flow optimization. In Proceedings of IEEE CDC, 2013.
17. A. Berman and R. J. Plemmons. Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York, 1979.
18. M. Zargham, A. Ribeiro, A. Ozdaglar, and A. Jadbabaie. Accelerated dual descent for network optimization. In Proceedings of IEEE ACC, 2011.