Duality for optimization problems with entropy-like objective functions

From MaRDI portal





The authors consider the Lagrange dual of a convex optimization problem with the entropy-like objective function. Weak and strong duality theorems for the problem are established together with necessary and sufficient optimality conditions. The results mentioned above are applied to the convex-constrained minimum cross-entropy problem, the norm-constrained maximum entropy problem and the linearly constrained Burg entropy optimization problem.











This page was built for publication: Duality for optimization problems with entropy-like objective functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5694549)