Uses of Interface
dev.nm.solver.MinimizationSolution
-
-
Uses of MinimizationSolution in dev.nm.misc.algorithm.bb
Classes in dev.nm.misc.algorithm.bb that implement MinimizationSolution Modifier and Type Class Description class
BranchAndBound
Branch-and-Bound (BB or B&B) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. -
Uses of MinimizationSolution in dev.nm.root.univariate
Subinterfaces of MinimizationSolution in dev.nm.root.univariate Modifier and Type Interface Description static interface
UnivariateMinimizer.Solution
This is the solution to a univariate minimization problem.Classes in dev.nm.root.univariate that implement MinimizationSolution Modifier and Type Class Description class
GridSearchMinimizer.Solution
This is the solution to theGridSearchMinimizer
. -
Uses of MinimizationSolution in dev.nm.root.univariate.bracketsearch
Classes in dev.nm.root.univariate.bracketsearch that implement MinimizationSolution Modifier and Type Class Description protected class
BracketSearchMinimizer.Solution
class
BrentMinimizer.Solution
This is the solution to a Brent's univariate optimization.class
FibonaccMinimizer.Solution
This is the solution to a Fibonacci's univariate optimization.class
GoldenMinimizer.Solution
This is the solution to a Golden section univariate optimization. -
Uses of MinimizationSolution in dev.nm.solver
Classes in dev.nm.solver with type parameters of type MinimizationSolution Modifier and Type Interface Description interface
Minimizer<P extends OptimProblem,S extends MinimizationSolution<?>>
This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Subinterfaces of MinimizationSolution in dev.nm.solver Modifier and Type Interface Description interface
IterativeSolution<S>
Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained
Classes in dev.nm.solver.multivariate.constrained with type parameters of type MinimizationSolution Modifier and Type Interface Description interface
BoxMinimizer<P extends BoxOptimProblem,S extends MinimizationSolution<?>>
A box minimizer solves aBoxOptimProblem
.interface
ConstrainedMinimizer<P extends ConstrainedOptimProblem,S extends MinimizationSolution<?>>
A constrained minimizer solves a constrained optimization problem, namely,ConstrainedOptimProblem
.Subinterfaces of MinimizationSolution in dev.nm.solver.multivariate.constrained Modifier and Type Interface Description static interface
SubProblemMinimizer.IterativeSolution<Vector>
-
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing that implement MinimizationSolution Modifier and Type Class Description class
CSDPMinimizer.Solution
class
HomogeneousPathFollowingMinimizer.Solution
This is the solution to a Semi-Definite Programming problem using the Homogeneous Self-Dual Path-Following algorithm.class
PrimalDualPathFollowingMinimizer.Solution
This is the solution to a Semi-Definite Programming problem using the Primal-Dual Path-Following algorithm. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint that implement MinimizationSolution Modifier and Type Class Description class
PrimalDualInteriorPointMinimizer.Solution
This is the solution to a Dual Second Order Conic Programming problem using the Primal Dual Interior Point algorithm.class
PrimalDualInteriorPointMinimizer1.Solution
This is the solution to a Dual Second-Order Conic Programming problem using the Primal-Dual Predictor-Corrector Interior Point algorithm. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp
Subinterfaces of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp Modifier and Type Interface Description interface
LPMinimizer
An LP minimizer minimizes the objective of an LP problem, satisfying all the constraints.interface
LPSolution<T extends LPMinimizer>
A solution to an LP problem contains all information about solving an LP problem such as whether the problem has a solution (bounded), how many minimizers it has, and the minimum. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex that implement MinimizationSolution Modifier and Type Class Description class
SimplexTable
This is a simplex table used to solve a linear programming problem using a simplex method. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution
Subinterfaces of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution Modifier and Type Interface Description interface
LPSimplexMinimizer
A simplex LP minimizer can be read off from the solution simplex table.interface
LPSimplexSolution
The solution to a linear programming problem using a simplex method contains anLPSimplexMinimizer
.Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution that implement MinimizationSolution Modifier and Type Class Description class
LPBoundedMinimizer
This is the solution to a bounded linear programming problem.class
LPUnboundedMinimizer
This is the solution to an unbounded linear programming problem.class
LPUnboundedMinimizerScheme2
This is the solution to an unbounded linear programming problem found in scheme 2. -
Uses of MinimizationSolution 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 MinimizationSolution Modifier and Type Class Description class
QPDualActiveSetMinimizer.Solution
This is the solution to a Quadratic Programming problem using the Dual Active Set algorithm.class
QPPrimalActiveSetMinimizer.Solution
This is the solution to a Quadratic Programming problem using the Primal Active Set algorithm. -
Uses of MinimizationSolution 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 MinimizationSolution Modifier and Type Class Description class
QPbySOCPMinimizer.Solution
class
QPbySOCPMinimizer1.Solution
-
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.general.sqp.activeset
Classes in dev.nm.solver.multivariate.constrained.general.sqp.activeset that implement MinimizationSolution Modifier and Type Class Description class
SQPActiveSetMinimizer.Solution
This is the solution to a general minimization with only inequality constraints using the SQP Active Set algorithm.class
SQPActiveSetOnlyInequalityConstraintMinimizer.Solution
This is the solution to a general minimization problem with only inequality constraints using the SQP Active Set algorithm. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.integer
Classes in dev.nm.solver.multivariate.constrained.integer with type parameters of type MinimizationSolution Modifier and Type Interface Description interface
IPMinimizer<T extends IPProblem,S extends MinimizationSolution<Vector>>
An Integer Programming minimizer minimizes an objective function subject to equality/inequality constraints as well as integral constraints. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.integer.bruteforce
Classes in dev.nm.solver.multivariate.constrained.integer.bruteforce that implement MinimizationSolution Modifier and Type Class Description class
BruteForceIPMinimizer.Solution
This is the solution to an integral constrained minimization using the brute-force search. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.integer.linear.bb
Methods in dev.nm.solver.multivariate.constrained.integer.linear.bb that return MinimizationSolution Modifier and Type Method Description MinimizationSolution<Vector>
ILPBranchAndBoundMinimizer. solve(ILPProblem problem)
-
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane
Methods in dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane that return MinimizationSolution Modifier and Type Method Description MinimizationSolution<Vector>
SimplexCuttingPlaneMinimizer. solve(ILPProblem problem)
-
Uses of MinimizationSolution in dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim
Classes in dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim that implement MinimizationSolution Modifier and Type Class Description protected class
DEOptim.Solution
This is the solution to a minimization problem usingDEOptim
. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid
Classes in dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid that implement MinimizationSolution Modifier and Type Class Description protected class
SimpleGridMinimizer.Solution
This is the solution to a minimization problem usingSimpleGridMinimizer
. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.unconstrained
Classes in dev.nm.solver.multivariate.unconstrained with type parameters of type MinimizationSolution Modifier and Type Interface Description interface
MultivariateMinimizer<P extends OptimProblem,S extends MinimizationSolution<Vector>>
This is a minimizer that minimizes a multivariate function or a Vector function.Classes in dev.nm.solver.multivariate.unconstrained that implement MinimizationSolution Modifier and Type Class Description class
BruteForceMinimizer.Solution
This is the solution to solving an optimization using the brute force algorithm. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.unconstrained.c2
Classes in dev.nm.solver.multivariate.unconstrained.c2 that implement MinimizationSolution Modifier and Type Class Description class
NelderMeadMinimizer.Solution
This is the solution to an optimization problem by the Nelder-Mead method. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.unconstrained.c2.conjugatedirection
Classes in dev.nm.solver.multivariate.unconstrained.c2.conjugatedirection that implement MinimizationSolution Modifier and Type Class Description protected class
PowellMinimizer.PowellImpl
an implementation of Powell's algorithmprotected class
ZangwillMinimizer.ZangwillImpl
an implementation of Zangwill's algorithm -
Uses of MinimizationSolution in dev.nm.solver.multivariate.unconstrained.c2.quasinewton
Classes in dev.nm.solver.multivariate.unconstrained.c2.quasinewton that implement MinimizationSolution Modifier and Type Class Description protected class
BFGSMinimizer.BFGSImpl
an implementation of the BFGS algorithmprotected class
HuangMinimizer.HuangImpl
an implementation of Huang's formula.protected class
QuasiNewtonMinimizer.QuasiNewtonImpl
This is an implementation of the Quasi-Newton algorithm. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.unconstrained.c2.steepestdescent
Classes in dev.nm.solver.multivariate.unconstrained.c2.steepestdescent that implement MinimizationSolution Modifier and Type Class Description protected class
GaussNewtonMinimizer.MySteepestDescent.GaussNewtonImpl
an implementation of the Gauss-Newton algorithm.protected class
NewtonRaphsonMinimizer.NewtonRaphsonImpl
protected class
SteepestDescentMinimizer.SteepestDescentImpl
This is an implementation of the steepest descent method.
-