Uses of Interface
dev.nm.solver.multivariate.constrained.ConstrainedMinimizer
-
-
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained
Classes in dev.nm.solver.multivariate.constrained with type parameters of type ConstrainedMinimizer Modifier and Type Interface Description static interface
SubProblemMinimizer.ConstrainedMinimizerFactory<U extends ConstrainedMinimizer<ConstrainedOptimProblem,IterativeSolution<Vector>>>
This factory constructs a new instance of ConstrainedMinimizer to solve a real valued minimization problem.Subinterfaces of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained Modifier and Type Interface Description interface
BoxMinimizer<P extends BoxOptimProblem,S extends MinimizationSolution<?>>
A box minimizer solves aBoxOptimProblem
.Classes in dev.nm.solver.multivariate.constrained that implement ConstrainedMinimizer Modifier and Type Class Description class
SubProblemMinimizer
This minimizer solves a constrained optimization sub-problem where the values for some variables are held fixed for the original optimization problem.Constructor parameters in dev.nm.solver.multivariate.constrained with type arguments of type ConstrainedMinimizer Constructor Description SubProblemMinimizer(SubProblemMinimizer.ConstrainedMinimizerFactory<? extends ConstrainedMinimizer<ConstrainedOptimProblem,IterativeSolution<Vector>>> factory)
-
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing that implement ConstrainedMinimizer Modifier and Type Class Description class
CSDPMinimizer
Implements the CSDP algorithm for semidefinite programming problem with equality constraints.class
HomogeneousPathFollowingMinimizer
This implementation solves a Semi-Definite Programming problem using the Homogeneous Self-Dual Path-Following algorithm.class
PrimalDualPathFollowingMinimizer
The Primal-Dual Path-Following algorithm is an interior point method that solves Semi-Definite Programming problems. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint that implement ConstrainedMinimizer Modifier and Type Class Description class
PrimalDualInteriorPointMinimizer
Solves a Dual Second Order Conic Programming problem using the Primal Dual Interior Point algorithm.class
PrimalDualInteriorPointMinimizer1
The SOCP dual problem we are solving here is : \max {\bm b}^T \hat{\bm y} \\ {\rm s.t.} ({\bm A_i^q})^T \hat{\bm y} + {\bm z_i^q} = c_i^q,\ {\bm z_i^q}\in \mathcal{K}_q^{q_i},\ for i\in [n_q];\\ ({\bm A^{\ell}})^T \hat{\bm y} + {\bm z}^{\ell} = c^{\ell},\ {\bm z}^{\ell} \ge 0;\\ ({\bm A^u})^T \hat{\bm y} = c^u;\\ \hat{\bm y} \in \mathbb{R}^m;\ {\bm z}^{\ell}\in \mathbb{R}^{n_{\ell}};\ {\bm z}^u \in \mathbb{R}^{n_u}. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp
Subinterfaces of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp Modifier and Type Interface Description interface
LPSolver<P extends LPProblem,S extends LPSolution<?>>
An LP solver solves a Linear Programming (LP) problem. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver
Subinterfaces of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver Modifier and Type Interface Description interface
LPSimplexSolver<P extends LPProblem>
A simplex solver works toward an LP solution by sequentially applying Jordan exchange to a simplex table.Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver that implement ConstrainedMinimizer Modifier and Type Class Description class
FerrisMangasarianWrightPhase2
This implementation solves a canonical linear programming problem that does not need preprocessing its simplex table.class
LPCanonicalSolver
This is an LP solver that solves a canonical LP problem in the following form.class
LPRevisedSimplexSolver
class
LPTwoPhaseSolver
This implementation solves a linear programming problem,LPProblem
, using a two-step approach. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver
Subinterfaces of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver Modifier and Type Interface Description interface
QPMinimizer
A typedef for QP minimizer. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.activeset
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.activeset that implement ConstrainedMinimizer Modifier and Type Class Description class
QPDualActiveSetMinimizer
This implementation solves a Quadratic Programming problem using the dual active set algorithm.class
QPPrimalActiveSetMinimizer
This implementation solves a Quadratic Programming problem using the Primal Active Set algorithm. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.socp
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.socp that implement ConstrainedMinimizer Modifier and Type Class Description class
QPbySOCPMinimizer
We first convert a QP problem to an equivalent SOCP problem and then solve it using an SOCP solver.class
QPbySOCPMinimizer1
A QP problem is first converted into an equivalent SOCP problemSOCPGeneralProblem1
and then solve it using an SOCP solverPrimalDualInteriorPointMinimizer1
. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.general.box
Classes in dev.nm.solver.multivariate.constrained.general.box that implement ConstrainedMinimizer Modifier and Type Class Description class
BoxGeneralizedSimulatedAnnealingMinimizer
This is an extension toGeneralizedSimulatedAnnealingMinimizer
, which allows adding box constraints to bound solutions. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.general.penaltymethod
Classes in dev.nm.solver.multivariate.constrained.general.penaltymethod that implement ConstrainedMinimizer Modifier and Type Class Description class
PenaltyMethodMinimizer
The penalty method is an algorithm for solving a constrained minimization problem with general constraints. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.general.sqp.activeset
Classes in dev.nm.solver.multivariate.constrained.general.sqp.activeset that implement ConstrainedMinimizer Modifier and Type Class Description class
SQPActiveSetMinimizer
Sequential quadratic programming (SQP) is an iterative method for nonlinear optimization.class
SQPActiveSetOnlyInequalityConstraintMinimizer
This implementation is a modified version of Algorithm 15.2 in the reference to solve a general constrained optimization problem with only inequality constraints. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.general.sqp.activeset.equalityconstraint
Classes in dev.nm.solver.multivariate.constrained.general.sqp.activeset.equalityconstraint that implement ConstrainedMinimizer Modifier and Type Class Description class
SQPActiveSetOnlyEqualityConstraint1Minimizer
This implementation is a modified version of Algorithm 15.1 in the reference to solve a general constrained optimization problem with only equality constraints.class
SQPActiveSetOnlyEqualityConstraint2Minimizer
This particular implementation ofSQPActiveSetOnlyEqualityConstraint1Minimizer
usesSQPASEVariation2
. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.integer.bruteforce
Constructor parameters in dev.nm.solver.multivariate.constrained.integer.bruteforce with type arguments of type ConstrainedMinimizer Constructor Description BruteForceIPMinimizer(SubProblemMinimizer.ConstrainedMinimizerFactory<? extends ConstrainedMinimizer<ConstrainedOptimProblem,IterativeSolution<Vector>>> factory)
Constructs a brute force minimizer to solve integral constrained minimization problems. -
Uses of ConstrainedMinimizer in dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane
Classes in dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane that implement ConstrainedMinimizer Modifier and Type Class Description class
GomoryMixedCutMinimizer
This cutting-plane implementation uses Gomory's mixed cut method.class
GomoryPureCutMinimizer
This cutting-plane implementation uses Gomory's pure cut method for pure integer programming, in which all variables are integral.class
SimplexCuttingPlaneMinimizer
The use of cutting planes to solve Mixed Integer Linear Programming (MILP) problems was introduced by Ralph E Gomory.
-