Algorithms for separable convex optimization with linear ascending constraints

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 w...

Celý popis

Podrobná bibliografia

Vydané v:	Sadhana (Bangalore) Ročník 43; číslo 9; s. 1 - 18
Hlavní autori:	Akhil, P T, Sundaresan, Rajesh
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New Delhi Springer India 01.09.2018 Springer Nature B.V
Predmet:	Algorithms Computational geometry Convexity Engineering Optimization Resource allocation linear constraints ascending constraints OR in telecommunications polymatroid Convex programming
ISSN:	0256-2499, 0973-7677
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!