Minimization Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "__NOTOC__ " to "__NOTOC__ ") |
m (Text replacement - "ments]]" to "ment]]s") |
||
| Line 5: | Line 5: | ||
* <B>Counter-Example(s):</B> | * <B>Counter-Example(s):</B> | ||
** a [[Maximization Algorithm]]. | ** a [[Maximization Algorithm]]. | ||
* <B>See:</B> [[Entropy Maximization Algorithm]], [[Bayesian Parameter Estimation Algorithm]], [[Method of | * <B>See:</B> [[Entropy Maximization Algorithm]], [[Bayesian Parameter Estimation Algorithm]], [[Method of Moment]]s, [[Parameter Estimation Algorithm]], [[Root Finding Task]]. | ||
---- | ---- | ||
Latest revision as of 04:36, 24 June 2024
A Minimization Algorithm is an optimization algorithm that can be applied by a minimization system (to solve a minimization task.
- Example(s):
- Counter-Example(s):
- See: Entropy Maximization Algorithm, Bayesian Parameter Estimation Algorithm, Method of Moments, Parameter Estimation Algorithm, Root Finding Task.