Continuous Optimization Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
No edit summary
No edit summary
Line 6: Line 6:
** It can range from being an [[Exact Optimization Algorithm]] to being an [[Approximation Algorithm]], depending on the [[function optimization task|task]]'s [[optimality guarantee]]s.
** It can range from being an [[Exact Optimization Algorithm]] to being an [[Approximation Algorithm]], depending on the [[function optimization task|task]]'s [[optimality guarantee]]s.
** It can range from being a [[Single-Variable Optimization Algorith]] ([[SVO]]) to being a [[Multi-Variable Optimization Algorithm]] ([[MVO]]).
** It can range from being a [[Single-Variable Optimization Algorith]] ([[SVO]]) to being a [[Multi-Variable Optimization Algorithm]] ([[MVO]]).
** ...
* <B>Example(s):</B>
* <B>Example(s):</B>
** a [[Linear Programming Algorithm]], such as a [[Simplex Algorithm]].
** a [[Linear Programming Algorithm]], such as a [[Simplex Algorithm]].
** a [[Gradient Descent-based Algorithm]], such as: [[Newton's algorithm]] .
** a [[First-Order Optimization Algorithm]], such as [[gradient descent optimization]], such as [[Newton's method]].
** a [[First-Order Optimization Algorithm]], such as [[gradient descent optimization]].
** …
** …
* <B>Counter-Example(s):</B>
* <B>Counter-Example(s):</B>

Revision as of 18:26, 24 April 2024

An Continuous Optimization Algorithm is an optimization algorithm that can be applied by a continuous optimization system (to solve a continuous optimization task).



References

2009

1999