First-Order Numerical Optimization Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "---- __NOTOC__" to "---- __NOTOC__") |
m (Text replacement - ". ---- " to ". ---- ") |
||
| Line 8: | Line 8: | ||
** a [[Second-Order Method]]. | ** a [[Second-Order Method]]. | ||
* <B>See:</B> [[Iterative Optimization Method]], [[Numerical Analysis]], [[Numerical Ordinary Differential Equation]], [[Finite Difference]], [[Linear Approximation]]. | * <B>See:</B> [[Iterative Optimization Method]], [[Numerical Analysis]], [[Numerical Ordinary Differential Equation]], [[Finite Difference]], [[Linear Approximation]]. | ||
---- | ---- | ||
---- | ---- | ||
Latest revision as of 04:43, 17 June 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.