Uses of Class
org.tweetyproject.math.term.Variable
Package
Description
-
Uses of Variable in org.tweetyproject.math.opt.problem
Modifier and TypeMethodDescriptionConstraintSatisfactionProblem.getVariables()
Returns all variables of this problem.OptimizationProblem.getVariables()
-
Uses of Variable in org.tweetyproject.math.opt.rootFinder
Modifier and TypeMethodDescriptionRootFinder.getStartingPoint()
Returns the starting point of this finder.Determines the values for the variables appearing in the function such the function evaluates to zero.Modifier and TypeMethodDescriptionDetermines the values for the variables appearing in the function such the function evaluates to zero.void
RootFinder.setStartingPoint
(Map<Variable, Term> startingPoint) sets the starting point of this root finder.ModifierConstructorDescriptionCreates a new root finder for the given starting point and the given (multi-dimensional) functionCreates a new root finder for the given starting point and the given (multi-dimensional) function -
Uses of Variable in org.tweetyproject.math.opt.solver
Modifier and TypeMethodDescriptionIteratedLocalSearchOnConstrProb.bestNeighbor
(Map<Variable, Term> currSol, int minIterations, int maxIterations, double threshold, Term t) SimulatedAnnealingOnConstrProb.chooseANeighbor
(Map<Variable, Term> currSol, int minIterations, int maxIterations, double threshold, Term targetFunc) StochasticLocalSearchOnConstrProb.chooseANeighbor
(Map<Variable, Term> currSol, int minIterations, int maxIterations, double threshold, Term targetFunc) TabuSearchOnConstrProb.chooseANeighbor
(Map<Variable, Term> currSol, int minIterations, int maxIterations, double threshold, Term t) changes the solution drastically to escape a local minimumApacheCommonsCMAESOptimizer.solve
(GeneralConstraintSatisfactionProblem problem) Returns the variable assignment that maximizes/minimizes the given term (which only contains variables with defined upper and lower bounds).ApacheCommonsNonLinearConjugateGradientOptimizer.solve
(GeneralConstraintSatisfactionProblem problem) ApacheCommonsSimplex.solve
(GeneralConstraintSatisfactionProblem problem) BfgsSolver.solve
(GeneralConstraintSatisfactionProblem problem) CombinatoricsSolver.solve
(GeneralConstraintSatisfactionProblem problem) GlpkSolver.solve
(GeneralConstraintSatisfactionProblem problem) GradientDescent.solve
(GeneralConstraintSatisfactionProblem constraintSatisfactionProblem) GurobiOptimizer.solve
(GeneralConstraintSatisfactionProblem problem) Returns the variable assignment that maximizes/minimizes the given term (which only contains variables with defined upper and lower bounds).HessianGradientDescent.solve
(GeneralConstraintSatisfactionProblem problem) IteratedLocalSearchOnConstrProb.solve
(GeneralConstraintSatisfactionProblem problem) LagrangeSolver.solve
(GeneralConstraintSatisfactionProblem prob) LpSolve.solve
(GeneralConstraintSatisfactionProblem problem) OctaveSqpSolver.solve
(GeneralConstraintSatisfactionProblem problem) SimpleGeneticOptimizationSolver.solve
(GeneralConstraintSatisfactionProblem problem) Returns the variable assignment that maximizes/minimizes the given term (which only contains variables with defined upper and lower bounds).SimulatedAnnealingOnConstrProb.solve
(GeneralConstraintSatisfactionProblem problem) Solver.solve
(GeneralConstraintSatisfactionProblem problem) Computes a solution to the given constraint satisfaction or optimization problem, i.e.StochasticLocalSearchOnConstrProb.solve
(GeneralConstraintSatisfactionProblem problem) TabuSearchOnConstrProb.solve
(GeneralConstraintSatisfactionProblem problem) Modifier and TypeMethodDescriptionIteratedLocalSearchOnConstrProb.bestNeighbor
(Map<Variable, Term> currSol, int minIterations, int maxIterations, double threshold, Term t) SimulatedAnnealingOnConstrProb.chooseANeighbor
(Map<Variable, Term> currSol, int minIterations, int maxIterations, double threshold, Term targetFunc) StochasticLocalSearchOnConstrProb.chooseANeighbor
(Map<Variable, Term> currSol, int minIterations, int maxIterations, double threshold, Term targetFunc) TabuSearchOnConstrProb.chooseANeighbor
(Map<Variable, Term> currSol, int minIterations, int maxIterations, double threshold, Term t) double
changes the solution drastically to escape a local minimumModifierConstructorDescriptionBfgsSolver
(Map<Variable, Term> startingPoint) GradientDescent
(Map<Variable, Term> startingPoint) Creates a new gradient descent solverHessianGradientDescent
(Map<Variable, Term> startingPoint) LagrangeSolver
(Map<Variable, Term> startingPoint) Creates a new Lagrange solver for the given optimization problemLagrangeSolver
(Set<Map<Variable, Term>> startingPoints) Creates a new Lagrange solver for the given optimization problem -
Uses of Variable in org.tweetyproject.math.term
Modifier and TypeClassDescriptionclass
This class models a binary variable as a mathematical term.class
This class models an float variable as a mathematical term.class
This class models an integer variable as a mathematical term.Modifier and TypeMethodDescriptionAssociativeOperation.getVariables()
Constant.getVariables()
Difference.getVariables()
Fraction.getVariables()
FunctionalTerm.getVariables()
Term.getVariables()
Returns all variables in this term.Variable.getVariables()
Modifier and TypeMethodDescriptionabstract Term
Differentiates the term with respect to the given variable.boolean
AbsoluteValue.isContinuous
(Variable v) boolean
Constant.isContinuous
(Variable v) boolean
Difference.isContinuous
(Variable v) boolean
Exp.isContinuous
(Variable v) boolean
Fraction.isContinuous
(Variable v) boolean
Logarithm.isContinuous
(Variable v) boolean
Maximum.isContinuous
(Variable v) boolean
Minimum.isContinuous
(Variable v) boolean
Power.isContinuous
(Variable v) boolean
Product.isContinuous
(Variable v) boolean
Root.isContinuous
(Variable v) boolean
Sum.isContinuous
(Variable v) abstract boolean
Term.isContinuous
(Variable v) Checks whether this term is continuous in v.boolean
Variable.isContinuous
(Variable v) Modifier and TypeMethodDescriptionEvaluates each function in the given list with the given values for variables.Term.replaceAllTerms
(double[] values, List<Variable> variables) Replaces terms according to the given map.