If I understand the algorithm correctly, then is the 3rd point of simplex gives by [p1+0.05*p1,p2+0.05*p2] ?
How does fminsearch generate initial simplex ?
2 views (last 30 days)
Show older comments
Hi, I want to understand how fminsearch generates its initial simplex with n+1 vertices, given the initial choice of parameters specified by user. For example : if I have to minimise and function f(p) where p=[p1,p2], and I supply an initial p0=[p1in p2in], then fminsearch should first generate a set of 3, 2-d points for simplex method. two of these points can be [p1in 0] and [0 p2in], but how is the third point constructed ?
Also, as a reverse problem, how are the final vertices of (n+1)-dim simplex converted to the values of optimum [p1_opt,p2_opt]. Does fminsearch takes some projection of final vertices along the parameter axes ?
Answers (1)
See Also
Categories
Find more on Get Started with Optimization Toolbox in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!