Uses of Class
org.apache.commons.math3.optim.PointValuePair
Packages that use 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.apache.commons.math3.optim
Methods in org.apache.commons.math3.optim with parameters of type PointValuePairModifier and TypeMethodDescriptionbooleanSimpleValueChecker.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 PointValuePairModifier 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.apache.commons.math3.optim.nonlinear.scalar
Methods in org.apache.commons.math3.optim.nonlinear.scalar that return PointValuePairModifier 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.Methods in org.apache.commons.math3.optim.nonlinear.scalar with parameters of type PointValuePairModifier and TypeMethodDescriptionprotected voidMultiStartMultivariateOptimizer.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 PointValuePairModifierConstructorDescriptionprotectedprotected -
Uses of PointValuePair in org.apache.commons.math3.optim.nonlinear.scalar.gradient
Methods in org.apache.commons.math3.optim.nonlinear.scalar.gradient that return PointValuePairModifier and TypeMethodDescriptionprotected PointValuePairNonLinearConjugateGradientOptimizer.doOptimize()Performs the bulk of the optimization algorithm.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 PointValuePairModifierConstructorDescriptionNonLinearConjugateGradientOptimizer(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) NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula updateFormula, ConvergenceChecker<PointValuePair> checker, UnivariateSolver lineSearchSolver) Deprecated.as of 3.3.NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula updateFormula, ConvergenceChecker<PointValuePair> checker, UnivariateSolver lineSearchSolver, Preconditioner preconditioner) Deprecated.as of 3.3. -
Uses of PointValuePair in org.apache.commons.math3.optim.nonlinear.scalar.noderiv
Methods in org.apache.commons.math3.optim.nonlinear.scalar.noderiv that return PointValuePairModifier and TypeMethodDescriptionprotected PointValuePairBOBYQAOptimizer.doOptimize()Performs the bulk of the optimization algorithm.protected PointValuePairCMAESOptimizer.doOptimize()Performs the bulk of the optimization algorithm.protected PointValuePairPowellOptimizer.doOptimize()Performs the bulk of the optimization algorithm.protected PointValuePairSimplexOptimizer.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.Methods in org.apache.commons.math3.optim.nonlinear.scalar.noderiv with parameters of type PointValuePairModifier and TypeMethodDescriptionprotected voidAbstractSimplex.replaceWorstPoint(PointValuePair pointValuePair, Comparator<PointValuePair> comparator) Replace the worst point of the simplex by a new point.protected voidAbstractSimplex.setPoint(int index, PointValuePair point) Store a new point at locationindex.protected voidAbstractSimplex.setPoints(PointValuePair[] points) Replace all points.Method parameters in org.apache.commons.math3.optim.nonlinear.scalar.noderiv with type arguments of type PointValuePairModifier and TypeMethodDescriptionvoidAbstractSimplex.evaluate(MultivariateFunction evaluationFunction, Comparator<PointValuePair> comparator) Evaluate all the non-evaluated points of the simplex.abstract voidAbstractSimplex.iterate(MultivariateFunction evaluationFunction, Comparator<PointValuePair> comparator) Compute the next simplex of the algorithm.voidMultiDirectionalSimplex.iterate(MultivariateFunction evaluationFunction, Comparator<PointValuePair> comparator) Compute the next simplex of the algorithm.voidNelderMeadSimplex.iterate(MultivariateFunction evaluationFunction, Comparator<PointValuePair> comparator) Compute the next simplex of the algorithm.protected voidAbstractSimplex.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 PointValuePairModifierConstructorDescriptionCMAESOptimizer(int maxIterations, double stopFitness, boolean isActiveCMA, int diagonalOnly, int checkFeasableCount, RandomGenerator random, boolean generateStatistics, ConvergenceChecker<PointValuePair> checker) 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)