| Package | Description |
|---|---|
| net.sf.tweety.math.opt | |
| net.sf.tweety.math.opt.solver | |
| net.sf.tweety.math.term |
| Modifier and Type | Method and Description |
|---|---|
Map<Variable,Term> |
RootFinder.getStartingPoint()
Returns the starting point of this finder.
|
Set<Variable> |
ConstraintSatisfactionProblem.getVariables()
Returns all variables of this problem.
|
Set<Variable> |
OptimizationProblem.getVariables() |
Map<Variable,Term> |
NewtonRootFinder.randomRoot() |
Map<Variable,Term> |
BfgsRootFinder.randomRoot() |
Map<Variable,Term> |
GradientDescentRootFinder.randomRoot() |
Map<Variable,Term> |
HessianGradientDescentRootFinder.randomRoot() |
Map<Variable,Term> |
OpenOptRootFinder.randomRoot() |
Map<Variable,Term> |
LbfgsRootFinder.randomRoot() |
abstract Map<Variable,Term> |
OptimizationRootFinder.randomRoot() |
abstract Map<Variable,Term> |
RootFinder.randomRoot()
Determines the values for the variables appearing in the function such
the function evaluates to zero.
|
abstract 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 |
|---|---|
void |
RootFinder.setStartingPoint(Map<Variable,Term> startingPoint)
sets the starting point of this root finder.
|
| Constructor and Description |
|---|
BfgsRootFinder(List<Term> functions,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given
(multi-dimensional) function
|
BfgsRootFinder(Term function,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given function
|
GradientDescentRootFinder(List<Term> functions,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given
(multi-dimensional) function
|
GradientDescentRootFinder(Term function,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given function
|
HessianGradientDescentRootFinder(List<Term> functions,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given
(multi-dimensional) function
|
HessianGradientDescentRootFinder(Term function,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given function
|
LbfgsRootFinder(List<Term> functions,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given
(multi-dimensional) function
|
LbfgsRootFinder(Term function,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given function
|
NewtonRootFinder(List<Term> functions,
Map<Variable,Term> startingPoint)
Creates a new Newton root finder for the given starting point and the given
(multi-dimensional) function
|
NewtonRootFinder(Term function,
Map<Variable,Term> startingPoint)
Creates a new Newton root finder for the given starting point and the given function
|
OpenOptRootFinder(List<Term> functions,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given
(multi-dimensional) function
|
OpenOptRootFinder(Term function,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given function
|
OptimizationRootFinder(List<Term> functions,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given
(multi-dimensional) function
|
OptimizationRootFinder(Term function,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given function
|
RootFinder(List<Term> functions,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given
(multi-dimensional) function
|
RootFinder(Term function,
Map<Variable,Term> startingPoint)
Creates a new root finder for the given starting point and the given function
|
| Modifier and Type | Method and Description |
|---|---|
protected Map<Variable,Term> |
OpenOptSolver.parseOutput(String output)
This method parses the output data of an OpenOpt run
|
Map<Variable,Term> |
HessianGradientDescent.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
ApacheCommonsSimplex.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
ApacheCommonsCMAESOptimizer.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
OpenOptWebSolver.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
LpSolve.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
OctaveSqpSolver.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
LbfgsSolver.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
SimpleGeneticOptimizationSolver.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
LagrangeSolver.solve(ConstraintSatisfactionProblem prob) |
Map<Variable,Term> |
BfgsSolver.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
OpenOptSolver.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
GlpkSolver.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
GradientDescent.solve(ConstraintSatisfactionProblem problem) |
Map<Variable,Term> |
ApacheCommonsNonLinearConjugateGradientOptimizer.solve(ConstraintSatisfactionProblem problem) |
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).
|
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).
|
| Constructor and Description |
|---|
BfgsSolver(Map<Variable,Term> startingPoint) |
GradientDescent(Map<Variable,Term> startingPoint)
Creates a new gradient descent solver
|
HessianGradientDescent(Map<Variable,Term> startingPoint) |
LagrangeSolver(Map<Variable,Term> startingPoint)
Creates a new Lagrange solver for the given
optimization problem
|
LagrangeSolver(Set<Map<Variable,Term>> startingPoints)
Creates a new Lagrange solver for the given
optimization problem
|
LbfgsSolver(Map<Variable,Term> startingPoint) |
OpenOptSolver(Map<Variable,Term> startingPoint)
Creates a new solver for the given problem.
|
| Modifier and Type | Class and Description |
|---|---|
class |
BinaryVariable
This class models a binary variable as a mathematical term.
|
class |
FloatVariable
This class models an float variable as a mathematical term.
|
class |
IntegerVariable
This class models an integer variable as a mathematical term.
|
| Modifier and Type | Method and Description |
|---|---|
Set<Variable> |
Variable.getVariables() |
Set<Variable> |
FunctionalTerm.getVariables() |
abstract Set<Variable> |
Term.getVariables()
Returns all variables in this term.
|
Set<Variable> |
Difference.getVariables() |
Set<Variable> |
AssociativeOperation.getVariables() |
Set<Variable> |
Fraction.getVariables() |
Set<Variable> |
Constant.getVariables() |
| Modifier and Type | Method and Description |
|---|---|
Term |
Variable.derive(Variable v) |
abstract Term |
Term.derive(Variable v)
Differentiates the term with respect to the given variable.
|
Term |
Product.derive(Variable v) |
Term |
Difference.derive(Variable v) |
Term |
Minimum.derive(Variable v) |
Term |
Sum.derive(Variable v) |
Term |
Maximum.derive(Variable v) |
Term |
Root.derive(Variable v) |
Term |
Exp.derive(Variable v) |
Term |
Fraction.derive(Variable v) |
Term |
AbsoluteValue.derive(Variable v) |
Term |
Logarithm.derive(Variable v) |
Term |
Constant.derive(Variable v) |
Term |
Power.derive(Variable v) |
boolean |
Variable.isContinuous(Variable v) |
abstract boolean |
Term.isContinuous(Variable v)
Checks whether this term is continuous in v.
|
boolean |
Product.isContinuous(Variable v) |
boolean |
Difference.isContinuous(Variable v) |
boolean |
Minimum.isContinuous(Variable v) |
boolean |
Sum.isContinuous(Variable v) |
boolean |
Maximum.isContinuous(Variable v) |
boolean |
Root.isContinuous(Variable v) |
boolean |
Exp.isContinuous(Variable v) |
boolean |
Fraction.isContinuous(Variable v) |
boolean |
AbsoluteValue.isContinuous(Variable v) |
boolean |
Logarithm.isContinuous(Variable v) |
boolean |
Constant.isContinuous(Variable v) |
boolean |
Power.isContinuous(Variable v) |
| Modifier and Type | Method and Description |
|---|---|
static double[][] |
Term.evaluateMatrix(List<List<Term>> functions,
double[] values,
List<Variable> variables)
Evaluates each function in the given matrix with the given values for variables.
|
static double[] |
Term.evaluateVector(List<Term> functions,
double[] values,
List<Variable> variables)
Evaluates each function in the given list with the given values for variables.
|
static List<Double> |
Term.evaluateVector(List<Term> functions,
Map<Variable,? extends Term> mapping)
Evaluates each function in the given list with the given values for variables.
|
Term |
Term.replaceAllTerms(double[] values,
List<Variable> variables)
Replaces terms according to the given map.
|
Copyright © 2018. All rights reserved.