Package | Description |
---|---|
net.sf.tweety.logics.pcl.analysis | |
net.sf.tweety.math | |
net.sf.tweety.math.opt | |
net.sf.tweety.math.opt.solver |
Modifier and Type | Method and Description |
---|---|
static void |
MaximumEntropyMachineShop.main(java.lang.String[] args) |
Modifier and Type | Class and Description |
---|---|
class |
NonDifferentiableException
This exception is thrown when a non-differentiable term
is attempted to be differentiated.
|
Modifier and Type | Method and Description |
---|---|
private java.util.List<java.lang.Double> |
NewtonRootFinder.approximate(java.util.List<java.util.List<java.lang.Double>> currentJacobianValue,
java.util.List<java.lang.Double> currentVector,
java.util.List<java.lang.Double> currentValue)
Solves the linear equation currentJacobianValue * (X-currentVector) = - currentValue.
|
abstract java.util.Map<Variable,Term> |
RootFinder.randomRoot()
Determines the values for the variables appearing in the function such
the function evaluates to zero.
|
abstract java.util.Map<Variable,Term> |
OptimizationRootFinder.randomRoot() |
java.util.Map<Variable,Term> |
OpenOptRootFinder.randomRoot() |
java.util.Map<Variable,Term> |
NewtonRootFinder.randomRoot() |
java.util.Map<Variable,Term> |
LbfgsRootFinder.randomRoot() |
java.util.Map<Variable,Term> |
HessianGradientDescentRootFinder.randomRoot() |
java.util.Map<Variable,Term> |
GradientDescentRootFinder.randomRoot() |
java.util.Map<Variable,Term> |
BfgsRootFinder.randomRoot() |
abstract java.util.Map<Variable,Term> |
Solver.solve(ConstraintSatisfactionProblem problem)
Computes a solution to the given constraint satisfaction or optimization problem, i.e.
|
Modifier and Type | Method and Description |
---|---|
java.util.Map<Variable,Term> |
SimpleGeneticOptimizationSolver.solve(ConstraintSatisfactionProblem problem) |
java.util.Map<Variable,Term> |
OpenOptWebSolver.solve(ConstraintSatisfactionProblem problem) |
java.util.Map<Variable,Term> |
OpenOptSolver.solve(ConstraintSatisfactionProblem problem) |
java.util.Map<Variable,Term> |
OctaveSqpSolver.solve(ConstraintSatisfactionProblem problem) |
java.util.Map<Variable,Term> |
LbfgsSolver.solve(ConstraintSatisfactionProblem problem) |
java.util.Map<Variable,Term> |
LagrangeSolver.solve(ConstraintSatisfactionProblem prob) |
java.util.Map<Variable,Term> |
HessianGradientDescent.solve(ConstraintSatisfactionProblem problem) |
java.util.Map<Variable,Term> |
GradientDescent.solve(ConstraintSatisfactionProblem problem) |
java.util.Map<Variable,Term> |
GlpkSolver.solve(ConstraintSatisfactionProblem problem) |
java.util.Map<Variable,Term> |
BfgsSolver.solve(ConstraintSatisfactionProblem problem) |
java.util.Map<Variable,Term> |
ApacheCommonsNonLinearConjugateGradientOptimizer.solve(ConstraintSatisfactionProblem problem) |
java.util.Map<Variable,Term> |
ApacheCommonsCMAESOptimizer.solve(ConstraintSatisfactionProblem problem) |
java.util.Map<Variable,Term> |
SimpleGeneticOptimizationSolver.solve(Term t,
int optimization_objective)
Returns the variable assignment that maximizes/minimizes the given term
(which only contains variables with defined upper and lower bounds).
|
java.util.Map<Variable,Term> |
ApacheCommonsCMAESOptimizer.solve(Term t,
int optimization_type)
Returns the variable assignment that maximizes/minimizes the given term
(which only contains variables with defined upper and lower bounds).
|