Approximate Optimization Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m (Text replacement - "__NOTOC__ " to "__NOTOC__ ") |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
An [[Approximate Optimization Algorithm]] is an [[optimization algorithm]] that can be applied by an [[approximate optimization system]] (to solve an [[approximate optimization task]]). | An [[Approximate Optimization Algorithm]] is an [[optimization algorithm]] that can be applied by an [[approximate optimization system]] (to solve an [[approximate optimization task]]). | ||
* <B>See:</B> [[SGD Algorithm]]. | * <B>See:</B> [[SGD Algorithm]], [[Approximate Search Algorithm]]. | ||
---- | ---- | ||
---- | ---- | ||
__NOTOC__ | |||
[[Category:Concept]] | [[Category:Concept]] | ||
Latest revision as of 02:30, 6 January 2023
An Approximate Optimization Algorithm is an optimization algorithm that can be applied by an approximate optimization system (to solve an approximate optimization task).