35 #ifndef SHARK_ALGORITHMS_SIMPLEXDOWNHILL_H 36 #define SHARK_ALGORITHMS_SIMPLEXDOWNHILL_H 40 #include <boost/serialization/vector.hpp> 68 {
return "SimplexDownhill"; }
91 objectiveFunction.
init();
93 size_t dim = startingPoint.size();
97 m_simplex = std::vector<SolutionType>(dim + 1);
98 for (
size_t j=0; j<=dim; j++)
101 for (
size_t i=0; i<dim; i++) p(i) = startingPoint(i) + ((i == j) ? 1.0 : -0.5);
120 RealVector x0(dim, 0.0);
121 for (
size_t j=0; j<dim; j++) x0 +=
m_simplex[j].point;
134 else if (xr.
value < best.value)
167 for (
size_t j=1; j<=dim; j++)