The fields of the AnnealingAlgorithmTypes class are listed below. For a complete list of AnnealingAlgorithmTypes class members, see the AnnealingAlgorithmTypes Members topic.
Public Static Fields
  BFGS | This constant refers to using the BFGS algorithm (i.e. {@link MultiDimensional#derivBFGS}) 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. |
| FLETCHER_POWELL | This constant refers to using the Fletcher-Powell algorithm (i.e. {@link MultiDimensional#derivFletcherPowell}) which is then used in conjunction with the Simulated Annealing approach in order to find the global extremum of a multi-dimensioanl optimization problem with a differentiable object function. |
| FLETCHER_REEVES | This constant refers to using the Fletcher-Reeves algorithm (i.e. {@link MultiDimensional#derivFletcherReeves}) 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. |
| POLAK_RIVIERE | This constant refers to using the Polak-Riviere algorithm (i.e. {@link MultiDimensional#derivPolakRiviere}) 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. |
| STEEPEST_DESCENT | 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. |
See Also
AnnealingAlgorithmTypes Class | WebCab.COM.Math.Optimization.MultiDimensional Namespace