First-Order Numerical Optimization Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "Category:Concept __NOTOC__" to "__NOTOC__ Category:Concept") |
m (Text replacement - "---- __NOTOC__" to "---- __NOTOC__") |
||
| Line 18: | Line 18: | ||
---- | ---- | ||
__NOTOC__ | __NOTOC__ | ||
[[Category:Concept]] | [[Category:Concept]] | ||
Revision as of 13:41, 8 March 2021
A First-Order Numerical Optimization Algorithm is a numerical optimization method that handles linear local error.
- …
- Example(s):
- Counter-Example(s):
- See: Iterative Optimization Method, Numerical Analysis, Numerical Ordinary Differential Equation, Finite Difference, Linear Approximation.
References
2017
- (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Category:First_order_methods Retrieved:2017-10-8.
- In numerical analysis, methods that have at most linear local error are called first order methods. They are frequently based on finite differences, a local linear approximation.