Uses of Class
org.hipparchus.optim.PointValuePair
Package
Description
Generally, optimizers are algorithms that will either
minimize
or
maximize
a scalar function, called the
objective
function
.Optimization algorithms for linear constrained problems.
Algorithms for optimizing a scalar function.
This package provides optimization algorithms that require derivatives.
This package provides optimization algorithms that do not require derivatives.
-
Uses of PointValuePair in org.hipparchus.optim
Modifier and TypeMethodDescriptionboolean
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.hipparchus.optim.linear
Modifier and TypeMethodDescriptionSimplexSolver.doOptimize()
Performs the bulk of the optimization algorithm.SolutionCallback.getSolution()
Retrieve the best solution found so far.LinearOptimizer.optimize
(OptimizationData... optData) Stores data and performs the optimization.SimplexSolver.optimize
(OptimizationData... optData) Stores data and performs the optimization. -
Uses of PointValuePair in org.hipparchus.optim.nonlinear.scalar
Modifier and TypeMethodDescriptionMultiStartMultivariateOptimizer.getOptima()
Gets all the optima found during the last call tooptimize
.GradientMultivariateOptimizer.optimize
(OptimizationData... optData) Stores data and performs the optimization.MultivariateOptimizer.optimize
(OptimizationData... optData) Stores data and performs the optimization.Modifier and TypeMethodDescriptionprotected void
MultiStartMultivariateOptimizer.store
(PointValuePair optimum) Method that will be called in order to store each found optimum.ModifierConstructorDescriptionprotected
Simple constructor.protected
Simple constructor. -
Uses of PointValuePair in org.hipparchus.optim.nonlinear.scalar.gradient
Modifier and TypeMethodDescriptionprotected PointValuePair
NonLinearConjugateGradientOptimizer.doOptimize()
Performs the bulk of the optimization algorithm.NonLinearConjugateGradientOptimizer.optimize
(OptimizationData... optData) Stores data and performs the optimization.ModifierConstructorDescriptionNonLinearConjugateGradientOptimizer
(NonLinearConjugateGradientOptimizer.Formula updateFormula, ConvergenceChecker<PointValuePair> checker) Constructor with default tolerances for the line search (1e-8) andpreconditioner
.NonLinearConjugateGradientOptimizer
(NonLinearConjugateGradientOptimizer.Formula updateFormula, ConvergenceChecker<PointValuePair> checker, double relativeTolerance, double absoluteTolerance, double initialBracketingRange) Constructor with defaultpreconditioner
.NonLinearConjugateGradientOptimizer
(NonLinearConjugateGradientOptimizer.Formula updateFormula, ConvergenceChecker<PointValuePair> checker, double relativeTolerance, double absoluteTolerance, double initialBracketingRange, Preconditioner preconditioner) Simple constructor. -
Uses of PointValuePair in org.hipparchus.optim.nonlinear.scalar.noderiv
Modifier and TypeMethodDescriptionprotected PointValuePair
BOBYQAOptimizer.doOptimize()
Performs the bulk of the optimization algorithm.protected PointValuePair
CMAESOptimizer.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.AbstractSimplex.getPoint
(int index) Get the simplex point stored at the requestedindex
.AbstractSimplex.getPoints()
Get the points of the simplex.CMAESOptimizer.optimize
(OptimizationData... optData) Stores data and performs the optimization.SimplexOptimizer.optimize
(OptimizationData... optData) Stores data and performs the optimization.Modifier and TypeMethodDescriptionprotected 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 locationindex
.protected void
AbstractSimplex.setPoints
(PointValuePair[] points) Replace all points.Modifier and TypeMethodDescriptionvoid
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
MultiDirectionalSimplex.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.protected void
AbstractSimplex.replaceWorstPoint
(PointValuePair pointValuePair, Comparator<PointValuePair> comparator) Replace the worst point of the simplex by a new point.ModifierConstructorDescriptionCMAESOptimizer
(int maxIterations, double stopFitness, boolean isActiveCMA, int diagonalOnly, int checkFeasableCount, RandomGenerator random, boolean generateStatistics, ConvergenceChecker<PointValuePair> checker) Simple constructor.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.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.SimplexOptimizer
(ConvergenceChecker<PointValuePair> checker) Simple constructor.