Optimization Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - "]], " to ", [[")
No edit summary
Line 6: Line 6:
** It can range from being an [[Exact Optimization Algorithm]] to being an [[Approximate Optimization Algorithm]], depending on the [[function optimization task|task]]'s [[optimality guarantee]]s.
** It can range from being an [[Exact Optimization Algorithm]] to being an [[Approximate Optimization Algorithm]], depending on the [[function optimization task|task]]'s [[optimality guarantee]]s.
** It can range from being a [[Single-Variable Optimization Algorithm]] to being a [[Multi-Variable Optimization Algorithm]] ([[MVO]]).
** It can range from being a [[Single-Variable Optimization Algorithm]] to being a [[Multi-Variable Optimization Algorithm]] ([[MVO]]).
** It ranges from being a [[Maximization Algorithm]] to being a  [[Minimization Algorithm]].
** It can range from being a [[Maximization Algorithm]] to being a  [[Minimization Algorithm]].
** It can range from being A [[Sequential Model-based Optimization Algorithm]] to being a A [[Parallel Model-based Optimization Algorithm]].
** ...
* <B>Example(s):</B>
* <B>Example(s):</B>
** a [[Convex Optimization Algorithm]],
** a [[Convex Optimization Algorithm]],
** a [[Stochastic Gradient Descent Algorithm]],
** a [[Stochastic Gradient Descent Algorithm]].
** …
** …
* <B>Counter-Example(s):</B>
* <B>Counter-Example(s):</B>

Revision as of 20:46, 18 October 2023