Last time we discussed the polytope method, a multivariate function minimisation algorithm that seeks out a local minimum by stepping away from the worst of a set of points, most commonly a simplex; the multivariate generalisation of a triangle.

We got as far as implementing an algorithm for generating regular simplices of any size and location with

We got as far as implementing an algorithm for generating regular simplices of any size and location with

`ak.simplex`

and in this post we shall finish the job.
Full text...