Lines Matching refs:summary

225                               Summary* summary) {
226 *CHECK_NOTNULL(summary) = LineSearch::Summary();
253 ++summary->num_function_evaluations;
255 ++summary->num_gradient_evaluations;
271 ++summary->num_iterations;
272 if (summary->num_iterations >= options().max_num_iterations) {
273 summary->error =
278 LOG_IF(WARNING, !options().is_silent) << summary->error;
292 summary->error =
296 LOG_IF(WARNING, !options().is_silent) << summary->error;
303 ++summary->num_function_evaluations;
305 ++summary->num_gradient_evaluations;
316 summary->optimal_step_size = current.x;
317 summary->success = true;
326 Summary* summary) {
327 *CHECK_NOTNULL(summary) = LineSearch::Summary();
365 summary)) {
383 summary->optimal_step_size = bracket_low.x;
384 summary->success = true;
419 summary) && !solution.value_is_valid) {
433 summary->optimal_step_size = solution.x;
434 summary->success = true;
459 Summary* summary) {
481 ++summary->num_function_evaluations;
482 ++summary->num_gradient_evaluations;
490 ++summary->num_iterations;
562 } else if (summary->num_iterations >= options().max_num_iterations) {
566 summary->error =
571 LOG_IF(WARNING, !options().is_silent) << summary->error;
606 summary->error =
610 LOG_IF(WARNING, !options().is_silent) << summary->error;
617 ++summary->num_function_evaluations;
618 ++summary->num_gradient_evaluations;
645 Summary* summary) {
683 summary->error =
694 LOG_IF(WARNING, !options().is_silent) << summary->error;
699 const int num_bracketing_iterations = summary->num_iterations;
708 if (summary->num_iterations >= options().max_num_iterations) {
709 summary->error =
715 LOG_IF(WARNING, !options().is_silent) << summary->error;
722 summary->error =
727 LOG_IF(WARNING, !options().is_silent) << summary->error;
731 ++summary->num_iterations;
764 ++summary->num_function_evaluations;
765 ++summary->num_gradient_evaluations;
772 summary->error =
778 LOG_IF(WARNING, !options().is_silent) << summary->error;
783 << summary->num_iterations - num_bracketing_iterations