A polymatroid approach to separable convex optimization with linear ascending constraints

Author

Akhil, P.T. ; Singh, Rajdeep ; Sundaresan, R.

Author_Institution

ECE Dept., Indian Inst. of Sci., Bangalore, India

fYear

2014

fDate

Feb. 28 2014-March 2 2014

Firstpage

1

Lastpage

5

Abstract

We revisit a problem studied by Padakandla and Sundaresan [SIAM J. Optim., August 2009] on the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation problems in wireless communication settings. It is also a special case of an optimization of a separable convex function over the bases of a specially structured polymatroid. We give an alternative proof of the correctness of the algorithm of Padakandla and Sundaresan. In the process we relax some of their restrictions placed on the objective function.

Keywords

optimisation; resource allocation; wireless channels; core optimization; linear ascending constraints; polymatroid approach; resource allocation problems; separable convex function; separable convex optimization; structured polymatroid; wireless communication; Convex functions; Educational institutions; Electronic mail; Linear programming; Optimization; Resource management; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications (NCC), 2014 Twentieth National Conference on

Conference_Location

Kanpur

Type

conf

DOI

10.1109/NCC.2014.6811290

Filename

6811290