Duality for optimization problems with entropy-like objective functions

Abstract

We consider a convex optimization problem whose objective function consists of anentropy-like sum of functions. We calculate the Lagrange dual of this problem. Weak and strong duality assertions are presented, followed by the derivation of necessary and sufficient optimality conditions. Some entropy optimization problems found in the literature are considered as special cases, their dual problems obtained using other approaches being rediscovered.