Altaxo.Calc.Optimization Namespace
| Type | Description |
|
|
|
Nonlinear Preconditioned Conjugate Gradient Method |
|
|
Base class for constraint definitions |
|
|
Base class for cost function declaration |
|
|
Class to define criteria to end optimization |
|
|
Base Class for Function Minimization Optimization Methods |
|
|
Interface for constraint definitions |
|
|
Base class for cost function declaration |
|
|
Base class for Line Search method declaration |
|
|
More-Thuente Line Search Method |
|
|
Nelder and Mead Simplex Minimization Method |
|
|
Newton-Raphson Line Search Method |
|
|
Class defining no constraints |
|
|
Base class for exceptions thrown from the Optimization namespace |
|
|
Base Class for Optimization Methods |
|
|
Secant Line Search Method |
|
|
|
|
|
|
|
|
This function increments x by direction*step as long as the function gets smaller. If it gets bigger, step is multiplied by -0.5. The method ends if two successive function evaluations give the same result. |