|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use PointValuePair | |
---|---|
org.apache.commons.math3.optim |
Generally, optimizers are algorithms that will either
minimize or
maximize
a scalar function, called the
objective
function . |
org.apache.commons.math3.optim.linear | Optimization algorithms for linear constrained problems. |
org.apache.commons.math3.optim.nonlinear.scalar | Algorithms for optimizing a scalar function. |
org.apache.commons.math3.optim.nonlinear.scalar.gradient | This package provides optimization algorithms that require derivatives. |
org.apache.commons.math3.optim.nonlinear.scalar.noderiv | This package provides optimization algorithms that do not require derivatives. |
Uses of PointValuePair in org.apache.commons.math3.optim |
---|
Methods in org.apache.commons.math3.optim with parameters of type PointValuePair | |
---|---|
boolean |
SimpleValueChecker.converged(int iteration,
PointValuePair previous,
PointValuePair current)
Check if the optimization algorithm has converged considering the last two points. |
Uses of PointValuePair in org.apache.commons.math3.optim.linear |
---|
Methods in org.apache.commons.math3.optim.linear that return PointValuePair | |
---|---|
PointValuePair |
SimplexSolver.doOptimize()
Performs the bulk of the optimization algorithm. |
PointValuePair |
LinearOptimizer.optimize(OptimizationData... optData)
Stores data and performs the optimization. |
Uses of PointValuePair in org.apache.commons.math3.optim.nonlinear.scalar |
---|
Methods in org.apache.commons.math3.optim.nonlinear.scalar that return PointValuePair | |
---|---|
PointValuePair[] |
MultiStartMultivariateOptimizer.getOptima()
Gets all the optima found during the last call to optimize . |
PointValuePair |
GradientMultivariateOptimizer.optimize(OptimizationData... optData)
Stores data and performs the optimization. |
PointValuePair |
MultivariateOptimizer.optimize(OptimizationData... optData)
Stores data and performs the optimization. |
Methods in org.apache.commons.math3.optim.nonlinear.scalar with parameters of type PointValuePair | |
---|---|
protected void |
MultiStartMultivariateOptimizer.store(PointValuePair optimum)
Method that will be called in order to store each found optimum. |
Constructor parameters in org.apache.commons.math3.optim.nonlinear.scalar with type arguments of type PointValuePair | |
---|---|
GradientMultivariateOptimizer(ConvergenceChecker<PointValuePair> checker)
|
|
MultivariateOptimizer(ConvergenceChecker<PointValuePair> checker)
|
Uses of PointValuePair in org.apache.commons.math3.optim.nonlinear.scalar.gradient |
---|
Methods in org.apache.commons.math3.optim.nonlinear.scalar.gradient that return PointValuePair | |
---|---|
protected PointValuePair |
NonLinearConjugateGradientOptimizer.doOptimize()
Performs the bulk of the optimization algorithm. |
PointValuePair |
NonLinearConjugateGradientOptimizer.optimize(OptimizationData... optData)
Stores data and performs the optimization. |
Constructor parameters in org.apache.commons.math3.optim.nonlinear.scalar.gradient with type arguments of type PointValuePair | |
---|---|
NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula updateFormula,
ConvergenceChecker<PointValuePair> checker)
Constructor with default line search solver and
preconditioner . |
|
NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula updateFormula,
ConvergenceChecker<PointValuePair> checker,
UnivariateSolver lineSearchSolver)
Constructor with default preconditioner . |
|
NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula updateFormula,
ConvergenceChecker<PointValuePair> checker,
UnivariateSolver lineSearchSolver,
Preconditioner preconditioner)
|
Uses of PointValuePair in org.apache.commons.math3.optim.nonlinear.scalar.noderiv |
---|
Methods in org.apache.commons.math3.optim.nonlinear.scalar.noderiv that return PointValuePair | |
---|---|
protected PointValuePair |
CMAESOptimizer.doOptimize()
Performs the bulk of the optimization algorithm. |
protected PointValuePair |
BOBYQAOptimizer.doOptimize()
Performs the bulk of the optimization algorithm. |
protected PointValuePair |
PowellOptimizer.doOptimize()
Performs the bulk of the optimization algorithm. |
protected PointValuePair |
SimplexOptimizer.doOptimize()
Performs the bulk of the optimization algorithm. |
PointValuePair |
AbstractSimplex.getPoint(int index)
Get the simplex point stored at the requested index . |
PointValuePair[] |
AbstractSimplex.getPoints()
Get the points of the simplex. |
PointValuePair |
CMAESOptimizer.optimize(OptimizationData... optData)
Stores data and performs the optimization. |
PointValuePair |
SimplexOptimizer.optimize(OptimizationData... optData)
Stores data and performs the optimization. |
Methods in org.apache.commons.math3.optim.nonlinear.scalar.noderiv with parameters of type PointValuePair | |
---|---|
protected void |
AbstractSimplex.replaceWorstPoint(PointValuePair pointValuePair,
Comparator<PointValuePair> comparator)
Replace the worst point of the simplex by a new point. |
protected void |
AbstractSimplex.setPoint(int index,
PointValuePair point)
Store a new point at location index . |
protected void |
AbstractSimplex.setPoints(PointValuePair[] points)
Replace all points. |
Method parameters in org.apache.commons.math3.optim.nonlinear.scalar.noderiv with type arguments of type PointValuePair | |
---|---|
void |
AbstractSimplex.evaluate(MultivariateFunction evaluationFunction,
Comparator<PointValuePair> comparator)
Evaluate all the non-evaluated points of the simplex. |
abstract void |
AbstractSimplex.iterate(MultivariateFunction evaluationFunction,
Comparator<PointValuePair> comparator)
Compute the next simplex of the algorithm. |
void |
NelderMeadSimplex.iterate(MultivariateFunction evaluationFunction,
Comparator<PointValuePair> comparator)
Compute the next simplex of the algorithm. |
void |
MultiDirectionalSimplex.iterate(MultivariateFunction evaluationFunction,
Comparator<PointValuePair> comparator)
Compute the next simplex of the algorithm. |
protected void |
AbstractSimplex.replaceWorstPoint(PointValuePair pointValuePair,
Comparator<PointValuePair> comparator)
Replace the worst point of the simplex by a new point. |
Constructor parameters in org.apache.commons.math3.optim.nonlinear.scalar.noderiv with type arguments of type PointValuePair | |
---|---|
CMAESOptimizer(int maxIterations,
double stopFitness,
boolean isActiveCMA,
int diagonalOnly,
int checkFeasableCount,
RandomGenerator random,
boolean generateStatistics,
ConvergenceChecker<PointValuePair> checker)
|
|
PowellOptimizer(double rel,
double abs,
ConvergenceChecker<PointValuePair> checker)
This constructor allows to specify a user-defined convergence checker, in addition to the parameters that control the default convergence checking procedure. |
|
PowellOptimizer(double rel,
double abs,
double lineRel,
double lineAbs,
ConvergenceChecker<PointValuePair> checker)
This constructor allows to specify a user-defined convergence checker, in addition to the parameters that control the default convergence checking procedure and the line search tolerances. |
|
SimplexOptimizer(ConvergenceChecker<PointValuePair> checker)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |