Iterations of Some Algorithms for Unconstrained Local Optimization

Initializing live version
Download to Desktop

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 .


The three methods considered are the Newton, quasi-Newton, and conjugate gradient method. For these methods, see the Mathematica tutorial Unconstrained Optimization.


Contributed by: Heikki Ruskeepää (January 2012)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.