WebCab Optimization for COM v2.6

AnnealingAlgorithmTypes.STEEPEST_DESCENT Field

This constant refers to using the Steepest-Descent algorithm (i.e. {@link MultiDimensional#derivSteepestDescent}) which is then used in conjunction with the Simulated Annealing approach in order to find the global extremum of a multi-dimensional optimization problem with a differentiable object function.

public static readonly AnnealingAlgorithmTypes STEEPEST_DESCENT;

See Also

AnnealingAlgorithmTypes Class | WebCab.COM.Math.Optimization.MultiDimensional Namespace