A Polymatroid Approach to Separable Convex Optimization with Linear Ascending Constraints

Akhil, PT and Singh, Rahul and Sundaresan, Rajesh (2014) A Polymatroid Approach to Separable Convex Optimization with Linear Ascending Constraints. In: 2014 TWENTIETH NATIONAL CONFERENCE ON COMMUNICATIONS (NCC), FEB 28-MAR 02, 2014, Kanpur, INDIA.

PDF NCC_2014.pdf - Published Version Restricted to Registered users only Download (234kB) | Request a copy

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.

Item Type:	Conference Proceedings
Series.:	National Conference on Communications NCC
Publisher:	IEEE
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	19 Jul 2015 09:29
Last Modified:	19 Jul 2015 09:29
URI:	http://eprints.iisc.ac.in/id/eprint/51850

Actions (login required)

View Item