Lines Matching refs:bracket_low
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;
350 &bracket_low,
369 CHECK(bracket_low.value_is_valid)
370 << "Ceres bug: Bracketing produced an invalid bracket_low, please "
371 << "contact the developers!, bracket_low: " << bracket_low
375 summary->optimal_step_size = bracket_low.x;
385 // defined by bracket_low & bracket_high, which satisfy:
387 // 1. The interval bounded by step sizes: bracket_low.x & bracket_high.x
389 // 2. bracket_low.x is of all the step sizes evaluated *which satisifed the
391 // smallest function value, i.e. bracket_low.value <
394 // bracket_low.value < bracket_high.value (although this is typical)
395 // e.g. when bracket_low = initial_position, and bracket_high is the
398 // 3. bracket_high is chosen after bracket_low, s.t.
399 // bracket_low.gradient * (bracket_high.x - bracket_low.x) < 0.
401 bracket_low,
415 solution.value_is_valid && solution.value <= bracket_low.value
416 ? solution : bracket_low;
422 // Returns true iff bracket_low & bracket_high bound a bracket that contains
425 // max_num_iterations, bracket_low is the step size amongst all those
430 FunctionSample* bracket_low,
446 *bracket_low = initial_position;
471 *bracket_low = previous;
494 *bracket_low = current;
506 *bracket_low = current;
520 // Ensure that bracket_low is always set to the step size amongst all
523 *bracket_low =
524 current.value_is_valid && current.value < bracket_low->value
525 ? current : *bracket_low;
585 FunctionSample bracket_low,
591 CHECK(bracket_low.value_is_valid && bracket_low.gradient_is_valid)
594 << ", bracket_low: " << bracket_low
597 // for a valid bracket is only dependent upon bracket_low.gradient, and
605 << ", bracket_low: " << bracket_low
607 CHECK_LT(bracket_low.gradient *
608 (bracket_high.x - bracket_low.x), 0.0)
612 << ", bracket_low: " << bracket_low
622 // Set solution to bracket_low, as it is our best step size (smallest f())
625 *solution = bracket_low;
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);
696 (solution->value >= bracket_low.value)) {
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;
735 bracket_low = *solution;
