Lines Matching refs:step
56 /** Initial step used to bracket the optimum in line search. */
95 * Set the initial step used to bracket the optimum in line search.
97 * The initial step is a factor with respect to the search direction,
100 * @param initialStep initial step used to bracket the optimum in line search,
101 * if a non-positive value is used, the initial step is reset to its
162 // find the optimal step in the search direction
164 final double step = solver.solve(lsf, 0, findUpperBound(lsf, 0, initialStep));
168 point[i] += step * searchDirection[i];
219 * @param h initial step to try
229 for (double step = h; step < Double.MAX_VALUE; step *= FastMath.max(2, yA / yB)) {
230 final double b = a + step;
