Class QPDualActiveSolver


public class QPDualActiveSolver extends QPOptimizer
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 Details

    • ERROR_NONE

      public static final double ERROR_NONE
      No-error code.
      See Also:
    • ERROR_CHOLESKY_DECOMPOSITION

      public static final double ERROR_CHOLESKY_DECOMPOSITION
      Error code reported in lambda[0] when the Hessian decomposition fails.
      See Also:
    • ERROR_DEPENDENT_EQUALITIES

      public static final double ERROR_DEPENDENT_EQUALITIES
      Error code reported in lambda[0] when equality constraints are dependent.
      See Also:
    • ERROR_MAX_ITERATIONS

      public static final double ERROR_MAX_ITERATIONS
      Error code reported in lambda[0] when max iterations are reached.
      See Also:
    • ERROR_NUMERICAL

      public static final double ERROR_NUMERICAL
      Error code reported when numerical issue occurs.
      See Also:
    • ERROR_INFEASIBLE

      public static final double ERROR_INFEASIBLE
      Error code reported when no solution is found (infeasible).
      See Also:
  • Constructor Details

    • QPDualActiveSolver

      public QPDualActiveSolver()
      Simple constructor.
  • Method Details