| ApacheCommonsCMAESOptimizer |
|
| ApacheCommonsNonLinearConjugateGradientOptimizer |
|
| ApacheCommonsSimplex |
This class is a wrapper for the Apache Commons Math Simplex implementation.
|
| BfgsSolver |
This class implements the BFGS algorithm for solving unconstrained optimization problems.
|
| GlpkSolver |
|
| GradientDescent |
This class implements the gradient descent method to
find an optimum.
|
| HessianGradientDescent |
This class implements a gradient descent involving Hessian correction
for solving unconstrained optimization problems.
|
| LagrangeSolver |
This class implements a (naive) Langrange solver for optimization problems.
This solver only considers optimization problems without inequations.
|
| LpSolve |
This class implements a wrapper to the lpsolve binary
for mixed integer linear programming.
|
| OctaveSqpSolver |
Provides a bridge to the Octave (http://www.gnu.org/software/octave/) optimization
solver "sqp" which implements a successive quadratic programming solver for
general non-linear optimization problems.
|
| SimpleGeneticOptimizationSolver |
This class implements a simple genetic optimization algorithm for solving
optimization problems with box or equality constraints on float variables.
|
| SimulatedAnnealing |
This class implements the simulated annealing algorithm for combinatrics problems
It is natively implemented
|
| SimulatedAnnealingOnConstrProb |
implements the Simulated Annealing algorithm
for optimization problems
|
| Solver |
This abstract class models an abstract solver for constraint satisfaction or optimization problems.
|
| TabuSearch |
implements a simple Tabu Search without long term memory
for combinatorics problems
|
| TabuSearchOnConstrProb |
implements a simple Tabu Search without long term memory
for optimization problems
|