com.numericalmethod.suanshu.optimization.unconstrained
Interface NelderMead.BuildSimplex

Enclosing class:

NelderMead

public static interface NelderMead.BuildSimplex

The Nelder–Mead algorithm requires an initial simplex to start the search. This interface specifies how to build a simplex from fewer points than required.

Method Summary

Vector[]

build(Vector initial) Build a simplex of N+1 vertices from an initial point.

Method Detail

build

Vector[] build(Vector initial)

Build a simplex of N+1 vertices from an initial point. This allows the user to customize the way they build the initial simplex.

Parameters:

initial - an initial point

Returns:

a simplex represented by an array of Vectors