I'd like to know how to choose a good optimization method for one problem. I know that it depends of the search space (mainly smoothness and modality).
The issue is that you need to explore and observe this search space. That is to say, you need to generate all combinations of results (brute force) to plot it. It makes the algorithm/method useless, beacause once your search space is generated, you already know the minimum or maximum of the function, that's what you are looking for.
How to know which method to use without brute forcing ?
MethodinNMiminize(global) orFindMinimum(local) could be helpful, maybe (I have no clue on the answer). – anderstood Sep 20 '17 at 01:03