Solvers

19 public types in this namespace, organized by kind.

Models & Types (15)

Type Summary
ActiveSetQuadraticProgramSolver<T> Solves convex quadratic programs with a primal active-set method.
AugmentedLagrangianSolver<T> Solves general nonlinear constrained problems by the method of multipliers, minimizing a sequence of unconstrained augmented Lagrangians.
BranchAndBoundSolver<T> Solves integer and mixed-integer linear programs by branch and bound over linear relaxations.
ConstrainedProblem<T> A general nonlinear optimization problem: minimize f(x) subject to h(x) = 0 and g(x) ≤ 0.
ConstrainedSolution<T> The result of solving a ConstrainedProblem.
IntegerProgram<T> A linear program in which some or all variables are required to take whole-number values.
InteriorPointSolver<T> Solves linear and convex quadratic programs with a primal-dual path-following interior-point method using Mehrotra’s predictor-corrector.
KktResidual<T> How badly a candidate point violates each of the Karush-Kuhn-Tucker optimality conditions.
LinearAssignmentSolver<T> Solves the linear assignment problem: pair every row with a distinct column so that the total cost is as small as possible.
LinearProgramSolution<T> The result of solving a LinearProgram.
LinearProgram<T> Describes a linear program: a linear objective minimized subject to linear constraints and bounds on the variables.
QuadraticProgramSolution<T> The result of solving a QuadraticProgram.
QuadraticProgram<T> Describes a convex quadratic program: a quadratic objective minimized subject to linear constraints and bounds.
SequentialMinimalOptimizationSolver<T> Solves the support-vector-machine dual with Sequential Minimal Optimization.
SimplexSolver<T> Solves linear programs with the two-phase simplex method.

Interfaces (2)

Type Summary
ILinearProgramSolver<T> Solves linear programs.
IQuadraticProgramSolver<T> Solves convex quadratic programs.

Enums (1)

Type Summary
LinearProgramStatus The outcome of attempting to solve a linear program.

Helpers & Utilities (1)

Type Summary
KktConditions Verifies the Karush-Kuhn-Tucker optimality conditions for a constrained problem.