A new method is presented for determining the reflection point (centroid) which automatically varies the polyhedron (simplex or complex) moves to favor, in the early stages, a weighted move, and as the algorithm progresses, evolve to a more geometric move. Based on numerical experience to date, these attributes seem to be desirable for rapid progress throughout the algorithm stages.

This content is only available via PDF.
You do not currently have access to this content.