I am using SimulatedAnnealing method for a simulation based optimization problem and was wondering if someone can enlighten me on the following features:
Is there some guidelines on optimal size of
"SearchPoints"based on the size of the solution space knowing that the objective function is non-linear?It is intuitive that the number of iterations will depend on the objective function, but I have noticed that the number of iterations seem to be a multiple of number of variables. is this true? Sample code is provided in Simulated Annealing Convergence
I think it is difficult to prove global optimization results, but was wondering if any one has ideas on alternative ways to do that.
"SearchPoints", ismin(2d, 50), wheredis the number of variables." - Reference. That even answers (2) to a point. – dr.blochwave Sep 25 '15 at 20:55min(2d,50)is a default number forSearchPoints, not the optimal number I was looking for. 2) The document definesSearchPointsasnumber of initial pointsand has nothing to do with the number of iterations it will take to converge. So it does not answer (2) in any way. 3) Agree that the question is more to do with SA than MMA, but what is the benefit of putting a question on hold, when any responses to that question can benefit a larger audience. Thank You. – brama Sep 30 '15 at 14:06