Backlash (engineering): Difference between revisions
Jump to navigation
Jump to search
en>PixelBot m r2.7.3) (Robot: Removing es:Huelgo |
en>DesmondW No edit summary |
||
Line 1: | Line 1: | ||
{{Expert-subject|Mathematics|date=November 2008}} | |||
An '''[[entropy]] maximization problem''' is a [[convex optimization]] problem of the form | |||
:maximize <math>f_0(\vec{x}) = - \sum_{i=1}^n x_i \log x_i </math> | |||
:subject to <math>A\vec{x} \leq b, \quad \mathbf{1}^T \vec{x} = |\vec{x}|_1 =1</math> | |||
where <math>\vec{x} \in \mathbb{R}^n_{++}</math> is the optimization variable, <math>A\in\mathbb{R}^{m\times n} \ </math> and <math> b \in\mathbb{R}^m \ </math> are problem parameters, and <math>\mathbf{1}</math> denotes a vector whose components are all 1. | |||
==See also== | |||
* [[Principle of maximum entropy]] | |||
==External links== | |||
* {{cite book | |||
|last=Boyd | |||
|first=Stephen | |||
|coauthors=Lieven Vandenberghe | |||
|title=Convex Optimization | |||
|publisher=[[Cambridge University Press]] | |||
|date=2004 | |||
|pages=p. 362 | |||
|isbn=0-521-83378-7 | |||
|url=http://www.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf | |||
|accessdate=2008-08-24 | |||
}} | |||
[[Category:Mathematical optimization]] | |||
[[Category:Convex optimization]] | |||
{{mathapplied-stub}} |
Revision as of 13:05, 27 January 2014
An entropy maximization problem is a convex optimization problem of the form
where is the optimization variable, and are problem parameters, and denotes a vector whose components are all 1.
See also
External links
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534