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 f0(x→)=−∑i=1nxilog⁡xi
subject to Ax→≤b,∑i=1nxi=1

where x→∈ℝ++n is the optimization variable, A∈ℝm×n and b∈ℝ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)

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Entropy_maximization&oldid=283679"