Class QPDualActiveSolver
java.lang.Object
org.hipparchus.optim.BaseOptimizer<LagrangeSolution>
org.hipparchus.optim.BaseMultivariateOptimizer<LagrangeSolution>
org.hipparchus.optim.nonlinear.vector.constrained.ConstraintOptimizer
org.hipparchus.optim.nonlinear.vector.constrained.QPOptimizer
org.hipparchus.optim.nonlinear.vector.constrained.QPDualActiveSolver
Implements the dual active-set method by Goldfarb and Idnani (1983) for
solving strictly convex quadratic programs of the form:
minimize (1/2) x^T G x + g0^T x subject to CE^T x = ce0 (equality constraints) CI^T x >= ci0 (inequality constraints) lb <= Ax <= ub (bounded constraints)
Uses an incremental QR factorization updater (QRUpdater) for managing active constraints and maintains multipliers for dual and primal steps.
- Since:
- 1.11
- See Also:
-
Field Summary
FieldsModifier and TypeFieldDescriptionstatic final doubleError code reported in lambda[0] when the Hessian decomposition fails.static final doubleError code reported in lambda[0] when equality constraints are dependent.static final doubleError code reported when no solution is found (infeasible).static final doubleError code reported in lambda[0] when max iterations are reached.static final doubleNo-error code.static final doubleError code reported when numerical issue occurs.Fields inherited from class org.hipparchus.optim.BaseOptimizer
evaluations, iterations -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionMain optimization routine.protected voidparseOptimizationData(OptimizationData... optData) Parses optimization data to extract the objective function and various constraint sets.Methods inherited from class org.hipparchus.optim.nonlinear.vector.constrained.ConstraintOptimizer
optimizeMethods inherited from class org.hipparchus.optim.BaseMultivariateOptimizer
getLowerBound, getStartPoint, getUpperBoundMethods inherited from class org.hipparchus.optim.BaseOptimizer
getConvergenceChecker, getEvaluations, getIterations, getMaxEvaluations, getMaxIterations, incrementEvaluationCount, incrementIterationCount, optimize
-
Field Details
-
ERROR_NONE
public static final double ERROR_NONENo-error code.- See Also:
-
ERROR_CHOLESKY_DECOMPOSITION
public static final double ERROR_CHOLESKY_DECOMPOSITIONError code reported in lambda[0] when the Hessian decomposition fails.- See Also:
-
ERROR_DEPENDENT_EQUALITIES
public static final double ERROR_DEPENDENT_EQUALITIESError code reported in lambda[0] when equality constraints are dependent.- See Also:
-
ERROR_MAX_ITERATIONS
public static final double ERROR_MAX_ITERATIONSError code reported in lambda[0] when max iterations are reached.- See Also:
-
ERROR_NUMERICAL
public static final double ERROR_NUMERICALError code reported when numerical issue occurs.- See Also:
-
ERROR_INFEASIBLE
public static final double ERROR_INFEASIBLEError code reported when no solution is found (infeasible).- See Also:
-
-
Constructor Details
-
QPDualActiveSolver
public QPDualActiveSolver()Simple constructor.
-
-
Method Details
-
parseOptimizationData
Parses optimization data to extract the objective function and various constraint sets.- Overrides:
parseOptimizationDatain classBaseMultivariateOptimizer<LagrangeSolution>- Parameters:
optData- optimization data
-
doOptimize
Main optimization routine.- Overrides:
doOptimizein classQPOptimizer- Returns:
- the optimal solution or null if infeasible
-