Iterations of Some Algorithms for Unconstrained Local Optimization
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
By moving the starting point with the locator, you can see how three optimization algorithms proceed and how many steps they require to find the minimum of our example function .[more]
The three methods considered are the Newton, quasi-Newton, and conjugate gradient method. For these methods, see the Mathematica tutorial Unconstrained Optimization.[less]
Contributed by: Heikki Ruskeepää (January 2012)
Open content licensed under CC BY-NC-SA
"Iterations of Some Algorithms for Unconstrained Local Optimization"
Wolfram Demonstrations Project
Published: January 31 2012