Entropy maximization

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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

maximize
subject to

where is the optimization variable, and are problem parameters, and denotes a vector whose components are all 1.

See also[edit]

External links[edit]