Description: Steepest Descent Method with Optimum Solution input: f as a function name grad is gradient function x0 for the solution of the initial TolX, TolFun variables and functions were error threshold dist0 as the initial step MaxIter maximum Diego passage number Output: xo to take the minimum point of fo is the smallest function value f0 = f (x (0))
To Search:
- [genetic] - Gene Algorithm for Finding f (x) the min
- [MyHamming] - Simulated annealing algorithm of a func
File list (Check if you may need any files):
Opt_Steepest.m
Download