Lines Matching defs:problem_impl
51 #include "ceres/problem_impl.h"
318 ProblemImpl* problem_impl,
321 << problem_impl->NumParameterBlocks()
323 << problem_impl->NumParameters()
325 << problem_impl->NumResidualBlocks()
327 << problem_impl->NumResiduals()
331 TrustRegionSolve(options, problem_impl, summary);
334 LineSearchSolve(options, problem_impl, summary);
348 ProblemImpl* problem_impl = original_problem_impl;
354 summary->num_parameter_blocks = problem_impl->NumParameterBlocks();
355 summary->num_parameters = problem_impl->NumParameters();
358 summary->num_residual_blocks = problem_impl->NumResidualBlocks();
359 summary->num_residuals = problem_impl->NumResiduals();
419 // ProblemImpl by wrapping the CostFunctions of problem_impl inside
420 // GradientCheckingCostFunction and replacing problem_impl with
427 problem_impl,
431 // From here on, problem_impl will point to the gradient checking
433 problem_impl = gradient_checking_problem_impl.get();
437 if (!IsOrderingValid(original_options, problem_impl
448 problem_impl->parameter_map();
460 problem_impl,
528 problem_impl->parameter_map(),
547 problem_impl->parameter_map(),
629 ProblemImpl* problem_impl = original_problem_impl;
770 if (!IsOrderingValid(original_options, problem_impl, &summary->error)) {
779 problem_impl->parameter_map();
790 // ProblemImpl by wrapping the CostFunctions of problem_impl inside
791 // GradientCheckingCostFunction and replacing problem_impl with
798 problem_impl,
802 // From here on, problem_impl will point to the gradient checking
804 problem_impl = gradient_checking_problem_impl.get();
810 problem_impl,
848 problem_impl->parameter_map(),
908 const ProblemImpl* problem_impl,
911 problem_impl->NumParameterBlocks()) {
917 const Program& program = problem_impl->program();
1063 ProblemImpl* problem_impl,
1067 Program* original_program = problem_impl->mutable_program();
1118 problem_impl->parameter_map(),
