Modifier and Type | Class and 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.
|
Modifier and Type | Interface and 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.
|
Modifier and Type | Interface and Description |
---|---|
interface |
IterativeSolution<S>
Many minimization algorithms work by starting from some given initials and iteratively moving
toward an approximate solution.
|
Modifier and Type | Interface and Description |
---|---|
interface |
BoxMinimizer<P extends BoxOptimProblem,S extends MinimizationSolution<?>>
A box minimizer solves a
BoxOptimProblem . |
interface |
ConstrainedMinimizer<P extends ConstrainedOptimProblem,S extends MinimizationSolution<?>>
A constrained minimizer solves a constrained optimization problem, namely,
ConstrainedOptimProblem . |
Modifier and Type | Interface and Description |
---|---|
static interface |
SubProblemMinimizer.IterativeSolution<Vector> |
Modifier and Type | Class and 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.
|
Modifier and Type | Class and Description |
---|---|
class |
PrimalDualInteriorPointMinimizer.Solution
This is the solution to a Dual Second Order Conic Programming problem using the Primal Dual
Interior Point algorithm.
|
Modifier and Type | Interface and 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.
|
Modifier and Type | Class and Description |
---|---|
class |
SimplexTable
This is a simplex table used to solve a linear programming problem using a simplex method.
|
Modifier and Type | Interface and 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 an
LPSimplexMinimizer . |
Modifier and Type | Class and 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.
|
Modifier and Type | Class and 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.
|
Modifier and Type | Class and Description |
---|---|
class |
QPbySOCPMinimizer.Solution |
Modifier and Type | Class and 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.
|
Modifier and Type | Interface and 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.
|
Modifier and Type | Class and Description |
---|---|
class |
BruteForceIPMinimizer.Solution
This is the solution to an integral constrained minimization using the
brute-force search.
|
Modifier and Type | Method and Description |
---|---|
MinimizationSolution<Vector> |
ILPBranchAndBoundMinimizer.solve(ILPProblem problem) |
Modifier and Type | Method and Description |
---|---|
MinimizationSolution<Vector> |
SimplexCuttingPlaneMinimizer.solve(ILPProblem problem) |
Modifier and Type | Class and Description |
---|---|
protected class |
DEOptim.Solution
This is the solution to a minimization problem using
DEOptim . |
Modifier and Type | Class and Description |
---|---|
protected class |
SimpleGridMinimizer.Solution
This is the solution to a minimization problem using
SimpleGridMinimizer . |
Modifier and Type | Interface and Description |
---|---|
interface |
MultivariateMinimizer<P extends OptimProblem,S extends MinimizationSolution<Vector>>
This is a minimizer that minimizes a multivariate function or a Vector function.
|
Modifier and Type | Class and Description |
---|---|
class |
BruteForceMinimizer.Solution
This is the solution to solving an optimization using the brute force
algorithm.
|
Modifier and Type | Class and Description |
---|---|
class |
NelderMeadMinimizer.Solution
This is the solution to an optimization problem by the Nelder-Mead method.
|
Modifier and Type | Class and Description |
---|---|
protected class |
PowellMinimizer.PowellImpl
an implementation of Powell's algorithm
|
protected class |
ZangwillMinimizer.ZangwillImpl
an implementation of Zangwill's algorithm
|
Modifier and Type | Class and Description |
---|---|
protected class |
BFGSMinimizer.BFGSImpl
an implementation of the BFGS algorithm
|
protected class |
HuangMinimizer.HuangImpl
an implementation of Huang's formula.
|
protected class |
QuasiNewtonMinimizer.QuasiNewtonImpl
This is an implementation of the Quasi-Newton algorithm.
|
Modifier and Type | Class and 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.
|
Modifier and Type | Interface and Description |
---|---|
static interface |
UnivariateMinimizer.Solution
This is the solution to a univariate minimization problem.
|
Modifier and Type | Class and Description |
---|---|
class |
GridSearchMinimizer.Solution
This is the solution to the
GridSearchMinimizer . |
Modifier and Type | Class and 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.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.