Entropy maximization

From Wikipedia, the free encyclopedia

An entropy maximization problem is a convex optimization problem of the form

minimize f_0(x) = \sum_{i=1}^n x_i \log x_i
subject to Ax \leq b, \quad \mathbf{1}^T x  =1

where x \in \mathbb{R}^n_{++} is the optimization variable, A\in\mathbb{R}^{m\times n} \ and  b \in\mathbb{R}^m \ are problem parameters, and \mathbf{1} denotes a vector whose components are all 1.

[edit] External links

This applied mathematics-related article is a stub. You can help Wikipedia by expanding it.