Uses of Class
org.hipparchus.optim.BaseOptimizer
Packages that use BaseOptimizer
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.
This package provides algorithms that minimize the residuals
between observations and model values.
One-dimensional optimization algorithms.
-
Uses of BaseOptimizer in org.hipparchus.optim
Subclasses of BaseOptimizer in org.hipparchus.optimModifier and TypeClassDescriptionclassBase class multi-start optimizer for a multivariate function.classBase class for implementing optimizers for multivariate functions. -
Uses of BaseOptimizer in org.hipparchus.optim.linear
Subclasses of BaseOptimizer in org.hipparchus.optim.linearModifier and TypeClassDescriptionclassBase class for implementing linear optimizers.classSolves a linear problem using the "Two-Phase Simplex" method. -
Uses of BaseOptimizer in org.hipparchus.optim.nonlinear.scalar
Subclasses of BaseOptimizer in org.hipparchus.optim.nonlinear.scalarModifier and TypeClassDescriptionclassBase class for implementing optimizers for multivariate scalar differentiable functions.classMulti-start optimizer.classBase class for a multivariate scalar function optimizer. -
Uses of BaseOptimizer in org.hipparchus.optim.nonlinear.scalar.gradient
Subclasses of BaseOptimizer in org.hipparchus.optim.nonlinear.scalar.gradientModifier and TypeClassDescriptionclassNon-linear conjugate gradient optimizer. -
Uses of BaseOptimizer in org.hipparchus.optim.nonlinear.scalar.noderiv
Subclasses of BaseOptimizer in org.hipparchus.optim.nonlinear.scalar.noderivModifier and TypeClassDescriptionclassPowell's BOBYQA algorithm.classAn implementation of the active Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for non-linear, non-convex, non-smooth, global function minimization.classPowell's algorithm.classThis class implements simplex-based direct search optimization. -
Uses of BaseOptimizer in org.hipparchus.optim.nonlinear.vector.constrained
Subclasses of BaseOptimizer in org.hipparchus.optim.nonlinear.vector.constrainedModifier and TypeClassDescriptionclassAbstract class for Sequential Quadratic Programming solversclassAlternating Direction Method of Multipliers Quadratic Programming Optimizer.classAbstract Constraint Optimizer.classQuadratic programming Optimizater.classSequential Quadratic Programming Optimizer.classSequential Quadratic Programming Optimizer. -
Uses of BaseOptimizer in org.hipparchus.optim.univariate
Subclasses of BaseOptimizer in org.hipparchus.optim.univariateModifier and TypeClassDescriptionclassFor a function defined on some interval(lo, hi), this class finds an approximationxto the point at which the function attains its minimum.classSpecial implementation of theUnivariateOptimizerinterface adding multi-start features to an existing optimizer.classBase class for a univariate scalar function optimizer.