Strategy for closely-coupled hybrid minimization, typically involving the embedding of local search methods within global search methods. More...
Public Member Functions | |
EmbeddedHybridStrategy (ProblemDescDB &problem_db) | |
constructor | |
~EmbeddedHybridStrategy () | |
destructor | |
Protected Member Functions | |
void | run_strategy () |
Performs the hybrid minimization strategy by executing multiple iterators on different models of varying fidelity. | |
const Variables & | variables_results () const |
return the final solution from selectedIterators (variables) | |
const Response & | response_results () const |
return the final solution from selectedIterators (response) | |
Private Attributes | |
Real | localSearchProb |
the probability of running a local search refinement within phases of the global minimization for coupled hybrids |
Strategy for closely-coupled hybrid minimization, typically involving the embedding of local search methods within global search methods.
This strategy uses multiple methods in close coordination, generally using a local search minimizer repeatedly within a global minimizer (the local search minimizer refines candidate minima which are fed back to the global minimizer).