Steepest Descent method

A steepest descent algorithm would be an algorithm which follows the above update rule, where at each iteration, the direction ∆f (x,y) is the steepest direction we can take. That is, the algorithm continues its search in the direction which will minimize the value of function, given the current point. Or in other words, given a particular point x, we would like to find the direction d s.t. f(x + d) is minimized.