Package org.tweetyproject.math.opt.solver
package org.tweetyproject.math.opt.solver
-
ClassesClassDescriptionThis class implements the ant colony algorithm using isula (https://github.com/cptanalatriste/isula) for combinatrics problemsThis class is a wrapper for the Apache Commons Math3 CMAES optimizer (https://commons.apache.org/proper/commons-math/).This class is a wrapper for the Apache Commons Math3 Non-Linear Conjugate Gradient Optimizer (https://commons.apache.org/proper/commons-math/).This class is a wrapper for the Apache Commons Math Simplex implementation.This class implements the BFGS algorithm for solving unconstrained optimization problems.Combinatorics SolverProvides a Java binding to the Glpk solver (https://www.gnu.org/software/glpk).This class implements the gradient descent method to find an optimum.This class is a wrapper for the Gurobi optimizer (https://www.gurobi.com).This class implements a gradient descent involving Hessian correction for solving unconstrained optimization problems.implements the Iterates local search algorithm for combinatorial problemsimplements the Iterates local search algorithm for optimization problemsThis class implements a (naive) Langrange solver for optimization problems.
This solver only considers optimization problems without inequations.This class implements a wrapper to the lpsolve binary for mixed integer linear programming.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.This class implements a simple genetic optimization algorithm for solving optimization problems with box or equality constraints on float variables.SimpleGeneticOptimizationSolverCombinatorics classThis class implements the simulated annealing algorithm for combinatrics problems It is natively implementedimplements the Simulated Annealing algorithm for optimization problemsThis abstract class models an abstract solver for constraint satisfaction or optimization problems.local searchStochastic Local Search On Constraint Problemimplements a simple Tabu Search without long term memory for combinatorics problemsimplements a simple Tabu Search without long term memory for optimization problems