Package de.labathome.trustconstr.records
package de.labathome.trustconstr.records
-
ClassDescriptionOutput of
NumDiff.adjustSchemeToBounds(de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.matrix.Matrix, int, de.labathome.trustconstr.enums.FiniteDifferenceMethod, de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.matrix.Matrix): the per-dimension finite-difference step (with sign flips and clamping applied so each step lands inside the user-provided bounds) plus a per- dimension flag indicating whether the central scheme had to be downgraded to a one-sided scheme.Box boundslb ≤ x ≤ ubon the optimisation variable, plus a globalkeepFeasibleflag controlling whether the algorithm is allowed to step outside the box during line-searches and trial steps.Pair of canonical equality and inequality components produced by aCanonicalConstraint'sfun(x)orjac(x).Box boundslb ≤ x ≤ ubused byNumDiff.approxDerivative(java.util.function.DoubleUnaryOperator, double, de.labathome.trustconstr.records.FiniteDifferenceOptions)to clamp finite-difference perturbations.Builder forFiniteDifferenceOptions.Bundle of an objective valuef(x)and a constraint vectorc(x).Bundle of a gradientgradf(x)and a Jacobiandc/dx.Result of intersecting a parametric segmentx(t) = z + t*dwith a trust-region or box constraint.User-facing constraint prepared for use by the trust-constr orchestrator.Lower and upper residuals for a two-sided constraintlb ≤ f(x) ≤ ub.Pairing of a sparsity-pattern matrixAwith a precomputed Curtis-Powell-Reid column grouping.Mutable state threaded through the equality-path SQP outer loop.Inner-loop result fromEqualityConstrainedSQP.eqSQP(de.labathome.trustconstr.interfaces.IFunctionAndConstraint, de.labathome.trustconstr.interfaces.IGradientAndJacobian, de.labathome.trustconstr.interfaces.LagrangeHessian, de.labathome.trustconstr.matrix.Matrix, double, de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.interfaces.StoppingCriterion, de.labathome.trustconstr.records.State, double, double, de.labathome.trustconstr.enums.ProjectionMethod, de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.interfaces.LinearOperator)andTrustRegionInteriorPoint.trustRegionInteriorPoint(java.util.function.ToDoubleBiFunction<de.labathome.trustconstr.matrix.Matrix, java.lang.Object>, java.util.function.BiFunction<de.labathome.trustconstr.matrix.Matrix, java.lang.Object, de.labathome.trustconstr.matrix.Matrix>, de.labathome.trustconstr.interfaces.LagrangeHessian, int, int, int, de.labathome.trustconstr.interfaces.Constraint, de.labathome.trustconstr.interfaces.Jacobian, de.labathome.trustconstr.matrix.Matrix, double, de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.matrix.Matrix, de.labathome.trustconstr.interfaces.GlobalStoppingCriteria, boolean[], double, de.labathome.trustconstr.records.State, double, double, double, double, de.labathome.trustconstr.enums.ProjectionMethod).IP-path extension ofState: adds the log-barrier coefficient and the barrier-subproblem inner-loop tolerance carried alongside the standard outer-iteration fields.FiniteDifferenceBoundsvariant constructed from aBoundsrecord, propagating thekeep_feasibleflag.