Algorithms for separable convex optimization with linear ascending constraints

Akhil, PT and Sundaresan, Rajesh (2018) Algorithms for separable convex optimization with linear ascending constraints. In: SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 43 (9).

PDF Sad_Aca_Pro_Eng_Sci_43-9_2018.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

The paper considers the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation scenarios, and is a special case of an optimization of a separable convex function over the bases of a polymatroid with a certain structure. The paper generalizes a prior algorithm to a wider class of separable convex objective functions that need not be smooth or strictly convex. The paper also summarizes the state-of-the-art algorithms that solve this optimization problem. When the objective function is a so-called separable function, a simpler linear time algorithm solves the problem.

Item Type:	Journal Article
Publication:	SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES
Publisher:	SPRINGER INDIA, 7TH FLOOR, VIJAYA BUILDING, 17, BARAKHAMBA ROAD, NEW DELHI, 110 001, INDIA
Additional Information:	Copyright of this article belong to SPRINGER INDIA, 7TH FLOOR, VIJAYA BUILDING, 17, BARAKHAMBA ROAD, NEW DELHI, 110 001, INDIA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering Division of Physical & Mathematical Sciences > Physics
Date Deposited:	16 Aug 2018 16:04
Last Modified:	18 Feb 2019 11:11
URI:	http://eprints.iisc.ac.in/id/eprint/60436

Actions (login required)

View Item