Optimization Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "__NOTOC__ " to "__NOTOC__ ") |
m (Text replacement - "** ..." to "** …") |
||
Line 10: | Line 10: | ||
** 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> | ||
** a [[Bayesian Parameter Estimation Algorithm]], | ** a [[Bayesian Parameter Estimation Algorithm]], |
Revision as of 16:47, 6 January 2023
An Optimization Algorithm is a search algorithm that can be applied by a optimization system (to solve an optimization task).
- Context:
- It can range from being a Combinatorial Optimization Algorithm to being a Continuous Optimization Algorithm.
- It can range from being a Global Optimization Algorithm to being a Local Optimization Algorithm.
- It can range from being an Offline Optimization Algorithm to being an Online Optimization Algorithm.
- It can range from being an Exact Optimization Algorithm to being an Approximate Optimization Algorithm, depending on the task's optimality guarantees.
- 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.
- Example(s):
- Counter-Example(s):
- See: Greedy Algorithm, Statistical Inference, Parameter Estimation, Local Maximum, Absolute Maximum.