|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use PointCostPair | |
---|---|
org.apache.commons.math.optimization | This package provides parametric optimization algorithms. |
Uses of PointCostPair in org.apache.commons.math.optimization |
---|
Fields in org.apache.commons.math.optimization declared as PointCostPair | |
---|---|
private PointCostPair[] |
DirectSearchOptimizer.minima
Found minima. |
protected PointCostPair[] |
DirectSearchOptimizer.simplex
Simplex. |
Methods in org.apache.commons.math.optimization that return PointCostPair | |
---|---|
PointCostPair[] |
DirectSearchOptimizer.getMinima()
Get all the minima found during the last call to minimize . |
private PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
double[][] vertices)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
double[][] vertices,
int starts,
long seed)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
double[] vertexA,
double[] vertexB)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
double[] vertexA,
double[] vertexB,
int starts,
long seed)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
RandomVectorGenerator generator)
Minimizes a cost function. |
PointCostPair |
DirectSearchOptimizer.minimize(CostFunction f,
int maxEvaluations,
ConvergenceChecker checker,
RandomVectorGenerator generator,
int starts)
Minimizes a cost function. |
Methods in org.apache.commons.math.optimization with parameters of type PointCostPair | |
---|---|
boolean |
ConvergenceChecker.converged(PointCostPair[] simplex)
Check if the optimization algorithm has converged on the simplex. |
private double |
MultiDirectional.evaluateNewSimplex(PointCostPair[] original,
double coeff)
Compute and evaluate a new simplex. |
protected void |
DirectSearchOptimizer.replaceWorstPoint(PointCostPair pointCostPair)
Replace the worst point of the simplex by a new point. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |