Package de.labathome.trustconstr
package de.labathome.trustconstr
-
ClassDescriptionBarrier optimization problem:Broyden-Fletcher-Goldfarb-Shanno (BFGS) Hessian update strategy.Builder for
BFGS; configure viaBFGS.FACTORY.Canonical-form constraintFunctional interface for the constraint Hessian-of-Lagrangian:Sum_i v_eq[i] * H_{eq,i}(x) + Sum_j v_ineq[j] * H_{ineq,j}(x).Output shape ofCanonicalConstraint.initialConstraintsAsCanonical(int, java.util.List<de.labathome.trustconstr.CanonicalConstraint>, de.labathome.trustconstr.matrix.Matrix, boolean): the four arrays(cEq, cIneq, JEq, JIneq)returned as a record.Concatenation of severalLinearConstraint/NonlinearConstraintobjects into a singleConstraint+Jacobianthat the orchestrator can pass straight toEqualityConstrainedSQP.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)orTrustRegionInteriorPoint.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).Byrd-Omojokun Trust-Region SQP methodHessian update strategy with full dimensional internal representation.FullHessianUpdateStrategy.FullHessianUpdateStrategyFactory<T extends FullHessianUpdateStrategy.FullHessianUpdateStrategyFactory<T>>Shared base factory forBFGS.BFGSFactoryandSR1.SR1Factory.Adapter that exposes a matrix-freeHessianProductas aBiFunctionreturning an explicit HessianMatrix.Identity vector functionf(x) = x(JacobianI).Lagrangian HessianH_obj(x) + Sum_i v_i * H_{c_i}(x)as a matrix-freeLinearOperator-builder.Constraint Hessian-of-Lagrangian:Sum_i v_eq[i] * H_{eq,i}(x) + Sum_j v_ineq[j] * H_{ineq,j}(x).Linear constraint of the formLinear vector functionf(x) = A xand its derivatives.Java port of scipy.optimize.minimize(method='trust-constr')Nonlinear constraint of the formLight-weight nonlinear vector function carrier for use insidePreparedConstraint.Finite-difference Jacobians and gradients (mirrors scipy_numdiff.approx_derivative).Linear operators that project onto the null space, range, and least-squares solution set of a constraint Jacobian.Quadratic-programming subproblem helpers used inside the trust-region SQP / IP loops: the projected-CG inner solver, the equality-constrained KKT direct factorization, the modified-dogleg trust-region step, and the segment/box/sphere intersection routines that drive trust-region step acceptance.Scalar function and its derivatives.Builder forScalarFunction.Decorator that wraps aConstraint+Jacobiansource and forces thejacEq/jacIneqreturn values to a specific sparsity.Symmetric-rank-1 (SR1) Hessian update strategy.Builder forSR1; configure viaSR1.FACTORY.Trust-region interior-point method.Vector function and its derivatives.Builder forVectorFunction.