Click or drag to resize

Altaxo.Calc.Optimization Namespace

[Missing <summary> documentation for "N:Altaxo.Calc.Optimization"]

Classes
 ClassDescription
Public classBfgsBMinimizer 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
Public classBfgsMinimizer Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm is an iterative method for solving unconstrained nonlinear optimization problems
Public classBfgsMinimizerBase 
Public classBfgsSolver 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
Public classBruteForceLineSearch 
Public classConjugateGradientNonlinear Preconditioned Conjugate Gradient Method
Public classConjugateGradientMinimizer 
Public classConstraintDefinitionBase class for constraint definitions
Public classCostFunctionBase class for cost function declaration
Public classEndCriteriaClass to define criteria to end optimization
Public classEvaluationException 
Public classFunctionMinimizeMethodBase Class for Function Minimization Optimization Methods
Public classGoldenSectionMinimizer 
Public classIncompatibleObjectiveException 
Public classInnerOptimizationException 
Public classLevenbergMarquardtMinimizer 
Public classLevenbergMarquardtMinimizerNonAllocating LevenbergMarquardtMinimizer, that doesn't allocate memory during the iterations.
Public classLevenbergMarquardtMinimizerNonAllocatingWrappedParameters LevenbergMarquardtMinimizer, that doesn't allocate memory during the iterations.
Public classLimitedMemoryBfgsMinimizer Limited Memory version of Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm
Public classLineSearchMethodBase class for Line Search method declaration
Public classMaximumIterationsException 
Public classMinimizationResult 
Public classMinimizationWithLineSearchResult 
Public classMinimizerBase 
Public classMoreThuenteLineSearchMore-Thuente Line Search Method
Public classNelderMeadNelder and Mead Simplex Minimization Method
Public classNelderMeadSimplex 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
Public classNewtonMinimizer 
Public classNewtonRaphsonLineSearchNewton-Raphson Line Search Method
Public classNoConstraintClass defining no constraints
Public classNonlinearMinimizationResult 
Public classNonlinearMinimizerBase 
Public classNonlinearMinimizerBaseNonAllocating 
Public classObjectiveFunction 
Public classOptimizationException 
Public classOptimizationMethodBase Class for Optimization Methods
Public classQuadraticGradientProjectionSearch 
Public classScalarMinimizationResult 
Public classSecantLineSearchSecant Line Search Method
Public classSimple1DCostFunction 
Public classSimple2DCostFunction 
Public classStupidLineSearch 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
Interfaces
 InterfaceDescription
Public interfaceIConstraintDefinitionInterface for constraint definitions
Public interfaceICostFunctionBase class for cost function declaration
Public interfaceIObjectiveFunction Objective function with a mutable evaluation.
Public interfaceIObjectiveFunctionEvaluation Objective function with a frozen evaluation that must not be changed from the outside.
Public interfaceIObjectiveModel 
Public interfaceIObjectiveModelEvaluation 
Public interfaceIObjectiveModelNonAllocating Extends the IObjectiveModel, helping not to allocate memory during execution of Levenberg-Marquardt.
Public interfaceIScalarObjectiveFunction 
Public interfaceIScalarObjectiveFunctionEvaluation 
Public interfaceIUnconstrainedMinimizer 
Enumerations
 EnumerationDescription
Public enumerationEndCriteriaCriteriaTypePossible criteria to end optimization
Public enumerationExitCondition 
Public enumerationNelderMeadStep Types of steps the Nelder-Mead Simplex Algorithm can take