Modifier and Type | Interface and Description |
---|---|
static interface |
IterativeLinearSystemSolver.Solution
This is the solution to a system of linear equations using an iterative
solver.
|
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 |
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 |
---|---|
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 | 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 | 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 |
---|---|
static interface |
IterativeC2Maximizer.Solution |
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.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.