43 template<
class T,
class Vector=DynColVector<T> >
144 template<
class T,
class Vector=DynColVector<T> >
169 int iterations=1E5, T minError=1.0E-10,
171 T a=1.0, T b=1.0, T g=0.5, T h=0.5);
174 void setDim(
int dim);
189 void setIterations(
int iterations);
192 void setMinError(T minError);
195 void setMinDelta(T minDelta);
216 int getIterations()
const;
219 T getMinError()
const;
222 T getMinDelta()
const;
234 Result optimize(
const Vector &init);
238 Result optimize(
const std::vector<Vector> &init);
246 static std::vector<Vector> createDefaultSimplex(
const Vector &init);
The General Function Template.
Definition: Function.h:284
undocument this line if you encounter any issues!
Definition: Any.h:37
Class interface for un-copyable classes.
Definition: Uncopyable.h:64
utils::Function< Vector > init_gen
Definition: SimplexOptimizer.h:154
Data * m_data
internal data structure
Definition: SimplexOptimizer.h:146
utils::Function< T, const Vector & > error_function
error function type that is used
Definition: SimplexOptimizer.h:151
const std::vector< Vector > & vertices
end simplex vertices (usually only used for debugging purpose)
Definition: SimplexOptimizer.h:48
Utility structure, that is used as accumulator for results of the SimplexOptimizer class.
Definition: SimplexOptimizer.h:44
utils::Function< void, const Result & > iteration_callback
Definition: SimplexOptimizer.h:153
SimplexOptimizationResult< T, Vector > Result
Definition: SimplexOptimizer.h:152
const Vector & x
result vector
Definition: SimplexOptimizer.h:45
const int iterations
actual count of iterations that were used for optimization
Definition: SimplexOptimizer.h:47
Template based implementation for the Downhill Simplex Optimiztation method.
Definition: SimplexOptimizer.h:145
#define ICLMath_IMP
Definition: CompatMacros.h:172
const T fx
error function value at result vector position
Definition: SimplexOptimizer.h:46