You want to use a high dimensional local interpolation method, so in 6 dimensions. Since you are using it to find a local optimum, it needs to be a higher order interpolation. It sounds like you have a complete 6-dimensional lattice where the grid lives. But you want everything to be fast. The result may be something that is not differentiable. Anyway, some sort of piecewise higher order interpolant. And you want all of this done inside calls from the GOTB.
You want an effective strategy, based on this terribly vague description? Far too much hand waving there.
Start by doing SOMETHING, ANYTHING that works, that makes you happy with the result. The process would be:
- Choose an interpolant. Again, whatever makes you happy. Recognize that higher order interpolation in high dimensions will do strange things. Even a putatively LINEAR interpolation in higher dimensions will have some very strange looking artifacts! And you can't plot anything in 6 dimensions, so you can't even look at the result. Life sucks. Live with it.
- Build an objective function that allows you to return a scalar value for any input. Test it.
- Wrap an optimizer around the objective. Your choice. You may or may not need to worry about constraints. We don't know, since you don't tell us.
There really is not much more of a strategy than that.
Only if you find it is too slow at some point should you worry about speed. If it is too slow, and you don't want to re-read the complete works of Shakespeare for the third time (don't skip the footnotes) while you are waiting for it to finish, then you will look for the bottleneck(s). You will only then make decisions about whch corners to cut, what simplifications are acceptable.
