Uses of Class
org.tweetyproject.math.opt.solver.Solver
-
Packages that use Solver Package Description org.tweetyproject.logics.commons.analysis org.tweetyproject.logics.pcl.analysis org.tweetyproject.math.opt.solver org.tweetyproject.web.services -
-
Uses of Solver in org.tweetyproject.logics.commons.analysis
Constructors in org.tweetyproject.logics.commons.analysis with parameters of type Solver Constructor Description CcInconsistencyMeasure(MusEnumerator<S> enumerator, Solver solver)
Creates a new measure that uses the given MUS enumerator and Integer programming solverCspInconsistencyMeasure(MusEnumerator<S> enumerator, Solver solver)
Creates a new measure that uses the given MUS enumerator and Integer programming solver.CspInconsistencyMeasure(SimpleFunction<java.lang.Double,java.lang.Double> measureFunction, MusEnumerator<S> enumerator, Solver solver)
Creates a new measure that uses the given measure function, MUS enumerator, and Integer programming solver -
Uses of Solver in org.tweetyproject.logics.pcl.analysis
Constructors in org.tweetyproject.logics.pcl.analysis with parameters of type Solver Constructor Description MinimalViolationInconsistencyMeasure(RealVectorNorm norm, Solver solver)
Creates a new measure the given norm -
Uses of Solver in org.tweetyproject.math.opt.solver
Subclasses of Solver in org.tweetyproject.math.opt.solver Modifier and Type Class Description class
AntColonyOptimization
This class implements the ant colony algorithm using isula (https://github.com/cptanalatriste/isula) for combinatrics problemsclass
ApacheCommonsCMAESOptimizer
This class is a wrapper for the Apache Commons Math3 CMAES optimizer (https://commons.apache.org/proper/commons-math/).class
ApacheCommonsNonLinearConjugateGradientOptimizer
This class is a wrapper for the Apache Commons Math3 Non-Linear Conjugate Gradient Optimizer (https://commons.apache.org/proper/commons-math/).class
ApacheCommonsSimplex
This class is a wrapper for the Apache Commons Math Simplex implementation.class
BfgsSolver
This class implements the BFGS algorithm for solving unconstrained optimization problems.class
CombinatoricsSolver
class
GlpkSolver
Provides a Java binding to the Glpk solver (https://www.gnu.org/software/glpk).class
GradientDescent
This class implements the gradient descent method to find an optimum.class
HessianGradientDescent
This class implements a gradient descent involving Hessian correction for solving unconstrained optimization problems.class
IteratedLocalSearch
implements the Iterates local search algorithm for combinatorial problemsclass
IteratedLocalSearchOnConstrProb
implements the Iterates local search algorithm for optimization problemsclass
LagrangeSolver
This class implements a (naive) Langrange solver for optimization problems.
This solver only considers optimization problems without inequations.class
LpSolve
This class implements a wrapper to the lpsolve binary for mixed integer linear programming.class
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.class
SimpleGeneticOptimizationSolver
This class implements a simple genetic optimization algorithm for solving optimization problems with box or equality constraints on float variables.class
SimpleGeneticOptimizationSolverCombinatorics
class
SimulatedAnnealing
This class implements the simulated annealing algorithm for combinatrics problems It is natively implementedclass
SimulatedAnnealingOnConstrProb
implements the Simulated Annealing algorithm for optimization problemsclass
StochasticLocalSearch
class
StochasticLocalSearchOnConstrProb
class
TabuSearch
implements a simple Tabu Search without long term memory for combinatorics problemsclass
TabuSearchOnConstrProb
implements a simple Tabu Search without long term memory for optimization problemsMethods in org.tweetyproject.math.opt.solver that return Solver Modifier and Type Method Description static Solver
Solver. getDefaultGeneralSolver()
Returns the default solver for non-linear (general) optimization problems.static Solver
Solver. getDefaultIntegerLinearSolver()
Returns the default solver for integer linear optimization problems.static Solver
Solver. getDefaultLinearSolver()
Returns the default solver for linear optimization problems.
If a default solver for linear problems has been configured this solver is returned by this method.Methods in org.tweetyproject.math.opt.solver with parameters of type Solver Modifier and Type Method Description static void
Solver. setDefaultGeneralSolver(Solver solver)
Sets the default solver for non-linear (general) optimization problems.static void
Solver. setDefaultIntegerLinearSolver(Solver solver)
Sets the default solver for integer linear optimization problems.static void
Solver. setDefaultLinearSolver(Solver solver)
Sets the default solver for linear optimization problems. -
Uses of Solver in org.tweetyproject.web.services
Fields in org.tweetyproject.web.services declared as Solver Modifier and Type Field Description static Solver
InconsistencyMeasurementService. integerLinearSolver
The integer linear optimization solver configured for this service.static Solver
InconsistencyMeasurementService. linearSolver
The linear optimization solver configured for this service.
-