Minimization Algorithm: Difference between revisions
Jump to navigation
Jump to search
(Importing converted wikitext) |
m (Text replacement - "ments]]" to "ment]]s") |
||
(9 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
A [[Minimization Algorithm]] is an [[optimization algorithm]] that can be applied by a [[minimization system]] (to solve a [[minimization task]]. | |||
* <B>Example(s):</B> | |||
** [[Gradient Descent Algorithm]], | |||
** … | |||
* <B>Counter-Example(s):</B> | |||
** a [[Maximization Algorithm]]. | |||
* <B>See:</B> [[Entropy Maximization Algorithm]], [[Bayesian Parameter Estimation Algorithm]], [[Method of Moment]]s, [[Parameter Estimation Algorithm]], [[Root Finding Task]]. | |||
---- | |||
---- | ---- | ||
__NOTOC__ | __NOTOC__ | ||
[[Category:Concept]] | |||
[[Category:Machine Learning]] |
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.