GClasses
|
This performs a brute force search with uniform sampling over the unit hypercube with increasing granularity. (Your target function should scale the candidate vectors as necessary to cover the desired space.) More...
#include <GStabSearch.h>
Public Member Functions | |
GBruteForceSearch (GTargetFunction *pCritic) | |
virtual | ~GBruteForceSearch () |
virtual double | iterate () |
Each pass will complete after ((2^n)+1)^d iterations. The distance between samples at that point will be 1/(2^n). After it completes n=30, it will begin repeating. | |
virtual double * | currentVector () |
Returns the best vector yet found. | |
Protected Attributes | |
double * | m_pCandidate |
double * | m_pBestVector |
double | m_bestError |
GCoordVectorIterator * | m_pCvi |
This performs a brute force search with uniform sampling over the unit hypercube with increasing granularity. (Your target function should scale the candidate vectors as necessary to cover the desired space.)
GClasses::GBruteForceSearch::GBruteForceSearch | ( | GTargetFunction * | pCritic | ) |
virtual GClasses::GBruteForceSearch::~GBruteForceSearch | ( | ) | [virtual] |
virtual double* GClasses::GBruteForceSearch::currentVector | ( | ) | [virtual] |
Returns the best vector yet found.
Implements GClasses::GOptimizer.
virtual double GClasses::GBruteForceSearch::iterate | ( | ) | [virtual] |
Each pass will complete after ((2^n)+1)^d iterations. The distance between samples at that point will be 1/(2^n). After it completes n=30, it will begin repeating.
Implements GClasses::GOptimizer.
double GClasses::GBruteForceSearch::m_bestError [protected] |
double* GClasses::GBruteForceSearch::m_pBestVector [protected] |
double* GClasses::GBruteForceSearch::m_pCandidate [protected] |
GCoordVectorIterator* GClasses::GBruteForceSearch::m_pCvi [protected] |