Dear Alexandre Voute,
the Simplex consists of N+1 (N being the number of parameters of the function to be minimised) sets of parameters
and their corresponding function values. Normally you start with a set of parameters which provide some
first guess of the optimal values, say: {p_1,p_2,...p_N}. The starting simplex then is computed by adding the different
parameter sets:
{p_1+delta,p_2,...p_N}
{p_1,p_2+delta,...p_N}
...
{p_1,p_2,...p_N+delta}
with some reasonable change of the parameters by a value of delta (should not bee too small, otherwise the
algorithm will not properly work). For these the function is evaluated and you get a set of N+1 values
{f_1,f_2,...,f_N+1} and then the actual optimisation is started. As far as I know, convergence is achieved as soon as
|f_high-f_low| < thresh
is below a given threshold (set to thresh=1d-2 in Molpro's implementation). f_high is the highest function value of
the Simplex and f_low the lowest one. Once the above convergence criterion is obeyed the set of parameters
corresponding to the f_low value provide the solution.
Best wishes,
Andreas