Description: Simulated annealing algorithm of a function f (x) the minimum point, and l < = x < = u f is the unknown function, x0 as the initial point, l, u, respectively, lower and upper limits for the search interval, kmax is the maximum q iterations for the annealing factor, TolFun as a function of allowable error algorithm is the first step according to the number of input variables, set default values for certain amount of
To Search:
- [Opt_Steepest] - Steepest Descent Method with Optimum So
- [imagemenu] - IMAGEMENU, without any input arguments,
File list (Check if you may need any files):
MyHamming.m
Download