Uses of Package
dev.nm.solver.multivariate.constrained.general.sqp.activeset
-
Packages that use dev.nm.solver.multivariate.constrained.general.sqp.activeset Package Description dev.nm.solver.multivariate.constrained.general.sqp.activeset -
Classes in dev.nm.solver.multivariate.constrained.general.sqp.activeset used by dev.nm.solver.multivariate.constrained.general.sqp.activeset Class Description SQPActiveSetMinimizer Sequential quadratic programming (SQP) is an iterative method for nonlinear optimization.SQPActiveSetMinimizer.Solution This is the solution to a general minimization with only inequality constraints using the SQP Active Set algorithm.SQPActiveSetMinimizer.VariationFactory This factory constructs a new instance ofSQPASVariation
for each SQP problem.SQPActiveSetOnlyInequalityConstraintMinimizer.Solution This is the solution to a general minimization problem with only inequality constraints using the SQP Active Set algorithm.SQPASVariation This interface allows customization of certain operations in the Active Set algorithm to solve a general constrained minimization problem using Sequential Quadratic Programming.