Nelder-Mead (Simplex) Method
A totally different method that is quite commonly used in nonlinear regression programs is the Nelder-Mead or Simplex method. It is computationally quite simple, other than the calculation of the WSS. The method works with a number of rules. The starting point is used to construct a simplest, a shape with m+1 points, where m is the number of parameters. Thus for a two parameter problem there are three points, a triangle. The program calculates the WSS at each point of the simplex on the WSS surface.
These rules are repeated until the convergence criteria are meet. The simplex moves over WSS surface and should contracts around minimum.
- Reflect the point with the highest WSS through centroid (center) of the simplex
- If this produces the lowest WSS (best point) expand the simplex and reflect further
- If this is just a good point start at the top and reflect again
- If this the highest WSS (worst point) compress the simplex and reflect closer
Figure 11.6.1 Contour map of kel versus V showing probable Path of Simplex Method
The simplex method is relatively robust and numerically less complicated but it can be inefficient (slow) for simple problems. This method is recommended as a starting point with Boomer. Actually the method I use most of the time involves starting with the simplex method and (automatically) continuing with the Damping-Gauss-Newton method. It seems work well much of the time.
return to the Course index
This page was last modified: Tuesday, 24th Oct 2017 at 5:56 pm
Privacy Statement - 25 May 2018
Material on this website should be used for Educational or Self-Study Purposes Only
iBook and pdf versions of this material and other PK material is available
Copyright © 2001-2019 David W. A. Bourne (firstname.lastname@example.org)