Thetype exposes the following members.
Gets the set of active constraint Indices for the solution. If algorithm did not converge it returns these Indices for the final iteration.(Overrides IActiveSetQPSolverActiveSet.)
The number of iterations performed before the algorithm terminated.(Overrides IActiveSetQPSolverIterations.)
Gets the values of the Lagrange multipliers for the solution if the algorithm converged. If it did not converge it returns the values of the Lagrange multiplier for the final iteration.(Overrides IActiveSetQPSolverLagrangeMultiplier.)
Gets and sets the maximum number of iterations to perform.(Overrides IActiveSetQPSolverMaxIterations.)
Gets and sets the maximum number of seconds to spend in the inequality constrained QP solver.(Overrides IActiveSetQPSolverMaxSeconds.)
If the solver was successful, OptimalObjectiveFunctionValue returns the minimum value of the objective function.(Overrides IActiveSetQPSolverOptimalObjectiveFunctionValue.)
If the solver was successful, OptimalX returns the point at which the objective function is minimized.(Overrides IActiveSetQPSolverOptimalX.)
If an unexpected exception was encountered during the most recent call to the Solve method and the Status property has the value AlgorithmStatus.UnexpectedException, this property will return the Exception object that was caught. Otherwise this property has the value of null.
Gets the status of the solver for the most recent solution attempt.(Overrides IActiveSetQPSolverStatus.)
Gets and sets the smallest step size considered to be non-zero. This step size should be small when compared with the approximate magintude of the solution.
Solves the given convex quadratic programming problem.(Overrides IActiveSetQPSolverSolve(QuadraticProgrammingProblem).)
Solves the given convex quadratic programming problem.(Overrides IActiveSetQPSolverSolve(QuadraticProgrammingProblem, DoubleVector).)