Which row of the output of a Nelder-Mead Simplex algorithm is the optimal?
조회 수: 3 (최근 30일)
이전 댓글 표시
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
답변 (1개)
Matt J
2013년 3월 12일
편집: Matt J
2013년 3월 12일
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
Matt J
2013년 3월 12일
편집: Matt J
2013년 3월 12일
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.
참고 항목
카테고리
Help Center 및 File Exchange에서 Systems of Nonlinear Equations에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!