Entropy maximization

This article needs attention from an expert in Mathematics. Please add a reason or a talk parameter to this template to explain the issue with the article. WikiProject Mathematics may be able to help recruit an expert. (November 2008)

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

maximize ${\displaystyle f_0(\overrightarrow{x})=-\sum _{i=1}^n{x}_i\log x_i}$

subject to ${\displaystyle A\overrightarrow{x}\le b,\sum _{i=1}^n{x}_i=1}$

where ${\displaystyle \overrightarrow{x}\in {\mathbb{R}}_{++}^n}$ is the optimization variable, ${\displaystyle A\in {\mathbb{R}}^{m\times n}}$ and ${\displaystyle b\in {\mathbb{R}}^m}$ are problem parameters.

See also

• Principle of maximum entropy

External links

• Boyd, Stephen; Lieven Vandenberghe (2004). Convex Optimization. Cambridge University Press. pp. 362. ISBN 0-521-83378-7. https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf#page=376. Retrieved 2008-08-24. 

0.00 (0 votes)