Iterations of Some Algorithms for Unconstrained Local Optimization

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.

THINGS TO TRY

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.