I'm using the Nelder-Mead algorithm for a project. Is there any way I can guarantee that the method will find find the absolute minimum of my function if my function has multiple local minima? Is the method highly dependent on my initial guess?
Maybe this question is assuming a perfect world, but is there any way to find the absolute minimum of a function without having to worry about finding local extrema?