activeConstraints(double[]) | | 0% | | 0% | 5 | 5 | 17 | 17 | 1 | 1 |
isSOSC(FritzJohnMultipliers, double[], boolean) | | 58% | | 43% | 13 | 17 | 8 | 28 | 0 | 1 |
activeConstraintLinearDependence(double[], boolean) | | 53% | | 42% | 10 | 15 | 10 | 25 | 0 | 1 |
isFONC(FritzJohnMultipliers, double[]) | | 60% | | 54% | 9 | 13 | 8 | 27 | 0 | 1 |
activeConstraintRank(double[]) | | 59% | | 50% | 5 | 8 | 7 | 21 | 0 | 1 |
isSCCQ(double[]) | | 12% | | 10% | 5 | 6 | 7 | 8 | 0 | 1 |
OptimizationFramework(RdToR1, RdToR1[], RdToR1[]) | | 59% | | 38% | 8 | 10 | 6 | 18 | 0 | 1 |
isQNCQ(FritzJohnMultipliers, double[]) | | 62% | | 45% | 9 | 11 | 5 | 18 | 0 | 1 |
primalFeasibilityCheck(double[]) | | 65% | | 50% | 3 | 5 | 1 | 7 | 0 | 1 |
isLCQ() | | 63% | | 37% | 4 | 5 | 3 | 9 | 0 | 1 |
isLagrangian() | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
isUnconstrained() | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
complementarySlacknessCheck(FritzJohnMultipliers, double[]) | | 75% | | 50% | 4 | 5 | 2 | 9 | 0 | 1 |
activeConstraintRankComparison(double[], int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
isCPLDCQ(double[]) | | 76% | | 50% | 4 | 5 | 1 | 5 | 0 | 1 |
isCompatible(FritzJohnMultipliers) | | 79% | | 50% | 4 | 5 | 0 | 6 | 0 | 1 |
isCRCQ(double[]) | | 82% | | 50% | 3 | 4 | 1 | 6 | 0 | 1 |
regularityQualifier(FritzJohnMultipliers, double[]) | | 83% | | n/a | 0 | 1 | 3 | 6 | 0 | 1 |
necessarySufficientQualifier(FritzJohnMultipliers, double[], boolean) | | 82% | | n/a | 0 | 1 | 3 | 6 | 0 | 1 |
alongAwayVariate(double[]) | | 95% | | 75% | 1 | 3 | 0 | 11 | 0 | 1 |
numEqualityConstraint() | | 70% | | 50% | 1 | 2 | 0 | 1 | 0 | 1 |
objectiveFunction() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
equalityConstraint() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
inequalityConstraint() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
numInequalityConstraint() | | 80% | | 50% | 1 | 2 | 0 | 1 | 0 | 1 |
isLICQ(double[]) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
isMFCQ(double[]) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |