|
Pallas Solver
0.1
C++ Global Optimization Algorithms
|
| ▼Npallas | |
| ▼Ninternal | |
| CBinomialCrossover | |
| CCrossoverStrategy | |
| CExponentialCrossover | |
| CMetropolis | Implements a probabilistic acceptance criterion for candidate solutions |
| CMutateBest1 | |
| CMutateBest2 | |
| CMutateRand1 | |
| CMutateRand2 | |
| CMutateRandToBest1 | |
| CMutationStrategy | |
| CRandomNumberGenerator | Generates random numbers |
| CRandomNumberGenerator< T, typename std::enable_if< std::is_floating_point< T >::value >::type > | |
| CRandomNumberGenerator< T, typename std::enable_if< std::is_integral< T >::value >::type > | |
| CShuffler | |
| CState | |
| ▼CBasinhopping | Minimizes an objective function by sequentially hopping between minima in the objective's energy landscape |
| CHistoryOutput | Stores information about the state of the system for at a given iteration number |
| COptions | |
| CSummary | Contains a summary of the optimization |
| CBoltzmannCooling | Boltzmann cooling schedule |
| CBoundedStepFunction | 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 |
| ▼CBrute | Minimizes an objective function by brute force, trying all possible combinations of specified parameter ranges and outputs the best solution found |
| CHistoryOutput | Stores information about the state of the system for at a given iteration number |
| COptions | |
| CParameterRange | Range of values to test for the ith degree of freedom |
| CSummary | Contains a summary of the optimization |
| CCauchyCooling | Cauchy cooling schedule |
| ▼CCoolingSchedule | Determines the rate of cooling within pallas::SimulatedAnnealing |
| COptions | |
| CDefaultStepFunction | Simple candidate generator that modifies the input by a random amount between +/- step_size |
| ▼CDifferentialEvolution | Minimizes an objective function by continuously evolving a population of candidate solutions |
| CHistoryOutput | Stores information about the state of the system for at a given iteration number |
| COptions | |
| CSummary | Contains a summary of the optimization |
| CFastCooling | Fast cooling schedule updates |
| CHistoryConcept | |
| CRosenbrock | |
| Cscoped_array | |
| Cscoped_ptr | |
| Cscoped_ptr_malloc | |
| CScopedPtrMallocFree | This class wraps the c library function free() in a class that can be passed as a template argument to scoped_ptr_malloc below |
| ▼CSimulatedAnnealing | Minimizes a function using simulated annealing |
| CHistoryOutput | Stores information about the state of the system for at a given iteration number |
| COptions | |
| CSummary | Contains a summary of the optimization |
| CStepFunction | Interface to produce randomized candidate solutions |
| CRosenbrock |
1.8.11