Numerics. NET. Optimization Namespace
The Numerics.NET.Optimization namespace contains classes that perform optimization of functions in one or more variables, including linear, quadratic and nonlinear programming.
Classes
Bounded | Represents a multi-dimensional optimizer that uses a limited memory version of the BFGS algorithm to solve optimization problems with box constraints. |
Brent | Represents a one-dimensional optimizer based on Brent's algorithm using derivatives. |
Brent | Represents a one-dimensional optimizer based on Brent's algorithm. |
Conjugate | Represents an optimizer that uses a conjugate gradient algorithm. |
Constraint | Serves as a base class for classes that represent constraints in an optimization model. |
Constraint | Represents a collection of variables in a OptimizationModel. |
Decision | Represents a variable in a OptimizationModel. |
Decision | Represents a collection of variables in a OptimizationModel. |
Directional | Represents an optimizer that finds an extremum by searching along a search direction in each iteration. |
Golden | Implements a one-dimensional optimizer that decreases the search interval by the Golden Ratio. |
Least | Represents an algorithm that minimizes a sum of squares. |
Levenberg | Implements the Levenberg-Marquardt algorithm for non-linear least-squares. |
Limited | Represents a multi-dimensional optimizer that uses the limited memory variant of the BFGS algorithm. |
Linear | Represents a linear constraint in an optimization model. |
Linear | Represents a linear programming problem. |
Linear | Represents a row in a LinearProgram. |
Linear | Provides a uniform interface for external solvers of linear programs. |
Linear | Represents a variable in a LinearProgram. |
Mps | Reads a linear program in MPS format. |
Multidimensional | Represents an algorithm for optimization of a multivariate function. |
Nelder | Implements the Nelder-Mead simplex algorithm for multi-dimensional optimization. |
Nonlinear | Represents a row in a LinearProgram. |
Nonlinear | Represents a nonlinear programming problem. |
One | Serves as an abstract base class for classes that implement one-dimensional optimization algorithms. |
Optimization | Represents an optimization problem. |
Optimization | Acts as a base class for the constraints and variables of an optimization model. |
Optimization | Provides a uniform interface for external solvers of optimization problems. |
Optimization | Represents the result of solving an optimization model. |
Powell | Implements Powell's modified multidimensional optimization method. |
Quadratic | Represents a quadratic programming problem. |
Quasi | Represents a multi-dimensional optimizer that uses a quasi-Newton algorithm (DFP or BFGS). |
Trust | Implements the Levenberg-Marquardt algorithm for non-linear least-squares. |
Enumerations
Conjugate | Enumerates the variants of the conjugate gradient method. |
Constraint | Enumerates the types of rows in a linear program. |
Extremum | Enumerates the possible values for the type of extremum an optimizer is to look for. |
Optimization | Enumerates the possible values for the status of a LinearProgram. |
Quasi | Enumerates the variants of the quasi-Newton method. |