User Manual | Methods | Optimization Methods | Steepest Descent

# Steepest Descent

Steepest descent [Fogel92] is an optimization method that follows the direction of steepest descent on the hyper-surface of the objective function to find a local minimum. The direction of steepest descent is defined by the negative of the gradient of the objective function.

### Options for Steepest Descent

Iteration Limit
This parameter is positive integer determining the maximum number of iterations the algorithm shall perform. The default is '100'.

Tolerance
This parameter is a positive value determining the tolerance with which the solution shall be determined. If the improvement between two steps is less than the tolerance the algorithm stops. The default is $10^{-6}$.