minfx SVN archive

Created the minfx.grid.grid_split_array() function.

This is similar to the minfx.grid.grid_split() but it instead works with the output of the
minfx.grid.grid_point_array() function, i.e. it accepts a list of grid points instead of generating
the points itself. The function is used to split up a grid search into equal parts for use in
parallelisation.

More fixes for fatal problems with the minfx.grid.grid_split() function.

The verbosity and print_prefix variables were not included in the keyword arguments, hence if
constraints were supplied this function would raise an error. These have now been added.

Big bug fix for the minfx.grid.grid_split() function.

This function is used to split a grid search up into equal sized blocks, taking constraints into
account, specifically for the purpose of running each block on a slave in a cluster or thread on a
multi-core system. However the blocks returned were not from the grid points trimmed after checking
constraints, but rather the original non-constrained points. Hence if constraints eliminated
points, those points might be used but points at the end of the grid would be dropped instead.

Updated the minfx homepage http://home.gna.org/minfx/ to version 1.0.6.

Updated the version number to 1.0.7.

Updated the CHANGES file for minfx 1.0.7.

Minfx version 1.0.7.

This is a minor feature release which tunes the log barrier iterative constraint algorithm for
better constrained optimisation. The constrained optimisation space is now much less perturbed by
the algorithm.

Changed the default initial epsilon0 value for the log barrier constraint algorithm.

The original value of 0.01 was too large, causing the optimisation space to be too severely
perturbed, so the value has been decreased to 1e-5.

Updated the API documentation for minfx version 1.0.6.

Updated the version numbers to 1.0.6.