We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Algorithms for separable convex optimization with linear ascending constraints.
- Authors
Akhil, P T; Sundaresan, Rajesh
- 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 d-<inline-graphic></inline-graphic>separable function, a simpler linear time algorithm solves the problem.
- Subjects
ALGORITHMS; CONVEX programming; CONVEX functions; CONSTRAINT algorithms; POLYTOPES
- Publication
Sādhanā: Academy Proceedings in Engineering Sciences, 2018, Vol 43, Issue 9, p1
- ISSN
0256-2499
- Publication type
Article
- DOI
10.1007/s12046-018-0890-2