Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 12]

Cpallas::Basinhopping	Minimizes an objective function by sequentially hopping between minima in the objective's energy landscape
Cpallas::Brute	Minimizes an objective function by brute force, trying all possible combinations of specified parameter ranges and outputs the best solution found
▼Cpallas::CoolingSchedule	Determines the rate of cooling within pallas::SimulatedAnnealing
Cpallas::BoltzmannCooling	Boltzmann cooling schedule
Cpallas::CauchyCooling	Cauchy cooling schedule
Cpallas::FastCooling	Fast cooling schedule updates
▼Cpallas::internal::CrossoverStrategy
Cpallas::internal::BinomialCrossover
Cpallas::internal::ExponentialCrossover
Cpallas::DifferentialEvolution	Minimizes an objective function by continuously evolving a population of candidate solutions
▼CGradientCostFunction
Cpallas::Rosenbrock
CRosenbrock
CRosenbrock
CRosenbrock
CRosenbrock
Cpallas::HistoryConcept
Cpallas::Brute::HistoryOutput	Stores information about the state of the system for at a given iteration number
Cpallas::SimulatedAnnealing::HistoryOutput	Stores information about the state of the system for at a given iteration number
Cpallas::DifferentialEvolution::HistoryOutput	Stores information about the state of the system for at a given iteration number
Cpallas::Basinhopping::HistoryOutput	Stores information about the state of the system for at a given iteration number
Cpallas::internal::Metropolis	Implements a probabilistic acceptance criterion for candidate solutions
▼Cpallas::internal::MutationStrategy
Cpallas::internal::MutateBest1
Cpallas::internal::MutateBest2
Cpallas::internal::MutateRand1
Cpallas::internal::MutateRand2
Cpallas::internal::MutateRandToBest1
Cpallas::DifferentialEvolution::Options
Cpallas::CoolingSchedule::Options
Cpallas::Basinhopping::Options
Cpallas::Brute::Options
Cpallas::SimulatedAnnealing::Options
Cpallas::Brute::ParameterRange	Range of values to test for the ith degree of freedom
Cpallas::internal::RandomNumberGenerator< T, Enable >	Generates random numbers
Cpallas::internal::RandomNumberGenerator< double >
Cpallas::internal::RandomNumberGenerator< T, typename std::enable_if< std::is_floating_point< T >::value >::type >
Cpallas::internal::RandomNumberGenerator< T, typename std::enable_if< std::is_integral< T >::value >::type >
Cpallas::internal::RandomNumberGenerator< unsigned int >
Cpallas::scoped_array< C >
Cpallas::scoped_ptr< C >
Cpallas::scoped_ptr< internal::CrossoverStrategy >
Cpallas::scoped_ptr< internal::MutationStrategy >
Cpallas::scoped_ptr< internal::RandomNumberGenerator< double > >
Cpallas::scoped_ptr< internal::Shuffler >
Cpallas::scoped_ptr< pallas::CoolingSchedule >
Cpallas::scoped_ptr< pallas::internal::RandomNumberGenerator< double > >
Cpallas::scoped_ptr< pallas::internal::RandomNumberGenerator< unsigned int > >
Cpallas::scoped_ptr< pallas::StepFunction >
Cpallas::scoped_ptr_malloc< C, Free >
Cpallas::ScopedPtrMallocFree	This class wraps the c library function free() in a class that can be passed as a template argument to scoped_ptr_malloc below
Cpallas::internal::Shuffler
Cpallas::SimulatedAnnealing	Minimizes a function using simulated annealing
Cpallas::internal::State
▼Cpallas::StepFunction	Interface to produce randomized candidate solutions
Cpallas::BoundedStepFunction	A new candidate solution is generated between upper and lower bounds. Each degree of freedom in the candidate solution is at most step_size from the current solution
Cpallas::DefaultStepFunction	Simple candidate generator that modifies the input by a random amount between +/- step_size
Cpallas::Brute::Summary	Contains a summary of the optimization
Cpallas::SimulatedAnnealing::Summary	Contains a summary of the optimization
Cpallas::DifferentialEvolution::Summary	Contains a summary of the optimization
Cpallas::Basinhopping::Summary	Contains a summary of the optimization