Network utility maximization with nonconcave utilities using sum-of-squares method

Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05

Volumn 2005, Issue , 2005, Pages 1867-1874

  Fazel, Maryam ^a   Chiang, Mung ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b Princeton University   (United States)

Author keywords

Algebraic geometry; Network utility; Nonconvex optimization; Rate allocation; Sum of squares method

Indexed keywords

CONCAVE FUNCTIONS; DISTRIBUTED RATE ALLOCATION; NETWORK UTILITY MAXIMIZATION PROBLEM; SUM-OF-SQUARES METHOD;

ALGORITHMS; COMPUTER SIMULATION; DATA TRANSFER; FUNCTION EVALUATION; OPTIMIZATION; PROBLEM SOLVING;

COMPUTER NETWORKS;

EID: 33646415424     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2005.1582432     Document Type: Conference Paper

References (20)

1. D. P. Bertsekas, Nonlinear Programming, Athena Scientific, 1999.
2. S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004.
3. M. Chiang, S. Zhang, and P. Hande, "Distributed rate allocation for inelastic flows: Optimization framework, optimality conditions, and optimal algorithms," Proc. IEEE Infocom, Miami, FL, March 2005.
4. D. Handelman, "Representing polynomials by positive linear functions on compact convex polyhedra," Pacific J. Math., vol. 132, pp. 35-62, 1988.
5. D. Henrion, J.B. Lasserre, "Detecting global optimality and extracting solutions in GloptiPoly," Research report, LAAS-CNRS, 2003.
6. F. P. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: shadow prices, proportional fairness and stability," Journal of Operations Research Society, vol. 49, no. 3, pp.237-252, March 1998.
7. J.B. Lasserre, "Global optimization with polynomials and the problem of moments," SIAM J. Optim., vol. 11, no. 3, pp. 796-817, 2001.
8. J.B. Lasserre, "Polynomial programming: LP-relaxations also converge," SIAM J. Optimization, vol. 15, no. 2, pp. 383-393, 2004.
9. J. W. Lee, R. R. Mazumdar, and N. Shroff, "Non-convex optimization and rate control for multi-class services in the Internet," Proc. IEEE Infocom, Hong Kong, China, March 2004.
10. S. H. Low, "A duality model of TCP and queue management algorithms," IEEE/ACM Tran. Networking, vol. 11, no. 4, pp. 525-536, Aug. 2003.
11. P. A. Parrilo, Structured semidefinite programs and semi-algebraic geometry methods in robustness and optimization," PhD thesis, Caltech, May 2002.
12. P. A. Parrilo, "Semidefinite programming relaxations for semi-algebraic problems," Math. Program., vol. 96, pp.293-320, 2003.
13. S. Prajna, A. Papachristodoulou, P. A. Parrilo, "SOSTOOLS: Sum of squares optimization toolbox for Matlab, available from http://www.cds.caltech. edu/sostools, 2002-04.
14. M. Putinar, "Positive polynomials on compact semi-algebraic sets," Indiana University Mathematics Journal, vol. 42, no. 3, pp. 969-984, 1993.
15. R. T. Rockafellar, Network Flows and Monotropic Programming, Athena Scientific, 1998.
16. R. T. Rockafellar, "Lagrange multipliers and optimality," SIAM Review, vol. 35, pp. 183-283, 1993.
17. K. Schmüdgen, "The k-moment problem for compact semialgebraic sets," Math. Ann., vol. 289, pp. 203-206, 1991.
18. S. Shenker, "Fundamental design issues for the future Internet," IEEE J. Sel. Area Comm., vol. 13, no. 7, pp. 1176-1188, Sept. 1995.
19. N. Z. Shor, "Quadratic optimization problems," Soviet J. Comput. Systems Sci., vol 25, pp. 1-11, 1987.
20. G. Stengle, "A Nullstellensatz and a Positivstellensatz in semialgebraic geometry," Math. Ann., vol. 207, pp.87-97, 1974.