This is the simplest optimization routine. Using this algorithm, optimization parameters are changed separately in each step. Only one parameter can be changed in one step while others are held as constants. Xk+1=Xk+ΔXk , k=0,1,2,… ΔXk step of parameter Xk. The parameter is changed until function growth is noticed, and then the next parameter follows, and so on. After the cycle with all parameters is completed, the step is changed to half its value and repeats. Optimal point searching ends when there is no function increase, and the last point is held as an optimal point. First function optimization example Its plot: Using the MATLAB script, we get the results below. In each picture, the start coordinates are different.