Lines Matching full:bracket_high
331 // Important: The high/low in bracket_high & bracket_low refer to their
333 // bracket_low.x < bracket_high.x.
334 FunctionSample solution, bracket_low, bracket_high;
351 &bracket_high,
372 << ", bracket_high: " << bracket_high << ", num_iterations: "
385 // defined by bracket_low & bracket_high, which satisfy:
387 // 1. The interval bounded by step sizes: bracket_low.x & bracket_high.x
394 // bracket_low.value < bracket_high.value (although this is typical)
395 // e.g. when bracket_low = initial_position, and bracket_high is the
397 // but still has bracket_high.value < initial_position.value.
398 // 3. bracket_high is chosen after bracket_low, s.t.
399 // bracket_low.gradient * (bracket_high.x - bracket_low.x) < 0.
402 bracket_high,
422 // Returns true iff bracket_low & bracket_high bound a bracket that contains
431 FunctionSample* bracket_high,
472 *bracket_high = current;
495 *bracket_high = current;
507 *bracket_high = previous;
586 FunctionSample bracket_high,
595 << ", bracket_high: "<< bracket_high;
596 // We do not require bracket_high.gradient_is_valid as the gradient condition
598 // in order to minimize jacobian evaluations, bracket_high.gradient may
599 // not have been calculated (if bracket_high.value does not satisfy the
602 CHECK(bracket_high.value_is_valid)
606 << ", bracket_high: "<< bracket_high;
608 (bracket_high.x - bracket_low.x), 0.0)
613 << ", bracket_high: "<< bracket_high;
636 if (fabs(bracket_high.x - bracket_low.x) * descent_direction_max_norm
643 fabs(bracket_high.x - bracket_low.x),
653 bracket_low.x < bracket_high.x ? bracket_low : bracket_high;
655 bracket_low.x < bracket_high.x ? bracket_high : bracket_low;
687 solution->x, bracket_low.x, bracket_high.x);
699 bracket_high = *solution;
721 solution->x, bracket_low.x, bracket_high.x);
731 } else if (solution->gradient * (bracket_high.x - bracket_low.x) >= 0) {
732 bracket_high = bracket_low;
