Which row of the output of a Nelder-Mead Simplex algorithm is the optimal?
1 visualizzazione (ultimi 30 giorni)
Mostra commenti meno recenti
Basically I'm using Nelder-Mead to optimise a function which depends on 5 parameters. I understand (heuristically) how this algorithm works, and I understand that I need to give it a 6x5 array as its initial simplex. However, what I don't understand is what the output means. It gives me a 6x5 array as the output, which row in the output is the optimal value for my function? Or have I fundamentally misunderstood what's happening? Any help would be greatly appreciated!
0 Commenti
Risposte (1)
Matt J
il 12 Mar 2013
Modificato: Matt J
il 12 Mar 2013
If you're implementing Nelder-Meade via the FMINSEARCH command, you should be initializing with a length 5 vector, not with a 6x5 array. The output should also be a vector of length 5.
3 Commenti
Matt J
il 12 Mar 2013
Modificato: Matt J
il 12 Mar 2013
Certain functions are locally flat (i.e., local minima) almost everywhere, for example
f(x) = round(x)
and so fminsearch will stop given almost any initial point. Make sure your function isn't one of these!
Also, make sure the 'TolFun' option is set suitably for your particular cost function. TolFun=z means that any reduction in the cost that is less than z is considered insignificant by FMINSEARCH and will cause it to stop.
Alternatively, scale your function by some large positive number and see if that makes a difference.
Vedere anche
Categorie
Scopri di più su Systems of Nonlinear Equations in Help Center e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!