Lines Matching defs:solution
334 FunctionSample solution, bracket_low, bracket_high;
403 &solution,
404 summary) && !solution.value_is_valid) {
414 solution =
415 solution.value_is_valid && solution.value <= bracket_low.value
416 ? solution : bracket_low;
418 summary->optimal_step_size = solution.x;
580 // Returns true iff solution satisfies the strong Wolfe conditions. Otherwise,
582 // reaching max_num_iterations, solution is the step size amongst all those
587 FunctionSample* solution,
622 // Set solution to bracket_low, as it is our best step size (smallest f())
625 *solution = bracket_low;
662 solution->x =
674 solution->value_is_valid =
675 function->Evaluate(solution->x,
676 &solution->value,
678 ? &solution->gradient : NULL);
679 solution->gradient_is_valid =
680 interpolation_uses_gradients && solution->value_is_valid;
681 if (!solution->value_is_valid) {
687 solution->x, bracket_low.x, bracket_high.x);
692 if ((solution->value > (initial_position.value
695 * solution->x)) ||
696 (solution->value >= bracket_low.value)) {
699 bracket_high = *solution;
710 solution->value_is_valid =
711 function->Evaluate(solution->x,
712 &solution->value,
713 &solution->gradient);
714 solution->gradient_is_valid = solution->value_is_valid;
715 if (!solution->value_is_valid) {
721 solution->x, bracket_low.x, bracket_high.x);
726 if (fabs(solution->gradient) <=
731 } else if (solution->gradient * (bracket_high.x - bracket_low.x) >= 0) {
735 bracket_low = *solution;
737 // Solution contains a valid point which satisfies the strong Wolfe
