Altaxo. |
[Missing <summary> documentation for "N:Altaxo.Calc.Optimization"]
Classes| Class | Description | |
|---|---|---|
 | BfgsBMinimizer | Broyden–Fletcher–Goldfarb–Shanno Bounded (BFGS-B) algorithm is an iterative method for solving box-constrained nonlinear optimization problems http://www.ece.northwestern.edu/~nocedal/PSfiles/limited.ps.gz |
| BfgsMinimizer | Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm is an iterative method for solving unconstrained nonlinear optimization problems |
| BfgsMinimizerBase | |
| BfgsSolver | Broyden-Fletcher-Goldfarb-Shanno solver for finding function minima See http://en.wikipedia.org/wiki/Broyden%E2%80%93Fletcher%E2%80%93Goldfarb%E2%80%93Shanno_algorithm Inspired by implementation: https://github.com/PatWie/CppNumericalSolvers/blob/master/src/BfgsSolver.cpp |
| BruteForceLineSearch | Brute-force line search that evaluates the objective function on a uniform grid and optionally refines the minimum by recursive subdivision. |
| ConjugateGradient | Nonlinear preconditioned conjugate gradient method. |
| ConjugateGradientMinimizer | |
| ConstraintDefinition | Base class for constraint definitions. |
| CostFunction | Base class for cost function declaration |
| EndCriteria | Defines criteria for ending an optimization. |
| EvaluationException | |
| FunctionMinimizeMethod | Base class for function-minimization optimization methods. |
| GoldenSectionMinimizer | |
| IncompatibleObjectiveException | |
| InnerOptimizationException | |
| LevenbergMarquardtMinimizer | |
| LevenbergMarquardtMinimizerNonAllocating | Levenberg-Marquardt minimizer that does not allocate memory during iterations. |
| LevenbergMarquardtMinimizerNonAllocatingWrappedParameters | Levenberg-Marquardt minimizer that does not allocate memory during iterations and uses wrapped parameters for handling bounds. |
| LimitedMemoryBfgsMinimizer | Limited Memory version of Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm |
| LineSearchMethod | Base class for line search method declarations. |
| MaximumIterationsException | |
| MinimizationResult | |
| MinimizationWithLineSearchResult | |
| MinimizerBase | |
| MoreThuenteLineSearch | More-Thuente line search method. |
| NelderMead | Nelder-Mead simplex minimization method. |
| NelderMeadSimplex | Class implementing the Nelder-Mead simplex algorithm, used to find a minima when no gradient is available. Called fminsearch() in Matlab. A description of the algorithm can be found at http://se.mathworks.com/help/matlab/math/optimizing-nonlinear-functions.html#bsgpq6p-11 or https://en.wikipedia.org/wiki/Nelder%E2%80%93Mead_method |
| NewtonMinimizer | |
| NewtonRaphsonLineSearch | Newton-Raphson line search method. |
| NoConstraint | Constraint definition representing no constraints. |
| NonlinearMinimizationResult | |
| NonlinearMinimizerBase | |
| NonlinearMinimizerBaseNonAllocating | Base class for nonlinear minimizers that avoid allocating intermediate arrays by working with internal/external parameter projections and pre-allocated vectors. |
| ObjectiveFunction | |
| OptimizationException | |
| OptimizationMethod | Base class for optimization methods. |
| QuadraticGradientProjectionSearch | |
| ScalarMinimizationResult | |
| SecantLineSearch | Secant line search method. |
| Simple1DCostFunction | Simple wrapper around a scalar function FuncT, TResult defined on a single variable, exposing it as a CostFunction. |
| Simple2DCostFunction | Simple wrapper around a scalar function FuncT1, T2, TResult defined on two variables, exposing it as a CostFunction. |
| StupidLineSearch | 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. |
Structures| Structure | Description | |
|---|---|---|
 | QuadraticGradientProjectionSearchGradientProjectionResult |
Interfaces| Interface | Description | |
|---|---|---|
 | IConstraintDefinition | Interface for constraint definitions. |
| ICostFunction | Interface for cost function declarations. |
| IObjectiveFunction | Objective function with a mutable evaluation. |
| IObjectiveFunctionEvaluation | Objective function with a frozen evaluation that must not be changed from the outside. |
| IObjectiveModel | Defines an objective model that can be evaluated at parameter values and exposed as an objective function. |
| IObjectiveModelEvaluation | Provides read-only access to the evaluation results of an objective model. |
| IObjectiveModelNonAllocating | Extends IObjectiveModel to help avoid memory allocations during execution of Levenberg-Marquardt. |
| IScalarObjectiveFunction | |
| IScalarObjectiveFunctionEvaluation | |
| IUnconstrainedMinimizer |
Enumerations| Enumeration | Description | |
|---|---|---|
 | EndCriteriaCriteriaType | Possible criteria used to end optimization. |
| ExitCondition | |
| NelderMeadStep | Types of steps the Nelder-Mead simplex algorithm can take. |