| /external/ceres-solver/examples/ |
| H A D | bundle_adjuster.cc | 324 Solver::Summary summary; local
325 Solve(options, &problem, &summary);
326 std::cout << summary.FullReport() << "\n";
|
| H A D | circle_fit.cc | 153 Solver::Summary summary; local
154 Solve(options, &problem, &summary);
159 std::cout << summary.BriefReport() << "\n";
|
| H A D | curve_fitting.cc | 157 Solver::Summary summary; local
158 Solve(options, &problem, &summary);
159 std::cout << summary.BriefReport() << "\n";
|
| H A D | denoising.cc | 156 ceres::Solver::Summary summary; local
157 ceres::Solve(options, problem, &summary);
159 std::cout << summary.FullReport() << "\n";
|
| H A D | ellipse_approximation.cc | 364 ceres::Solver::Summary summary; local
365 ceres::Solve(options, problem, &summary);
370 std::cout << summary.FullReport() << std::endl;
372 return summary.termination_type == ceres::CONVERGENCE;
|
| H A D | helloworld.cc | 76 Solver::Summary summary; local
77 Solve(options, &problem, &summary);
79 std::cout << summary.BriefReport() << "\n";
|
| H A D | helloworld_analytic_diff.cc | 99 Solver::Summary summary; local
100 Solve(options, &problem, &summary);
102 std::cout << summary.BriefReport() << "\n";
|
| H A D | helloworld_numeric_diff.cc | 72 Solver::Summary summary; local
73 Solve(options, &problem, &summary);
75 std::cout << summary.BriefReport() << "\n";
|
| H A D | libmv_bundle_adjuster.cc | 767 ceres::Solver::Summary summary; local
768 ceres::Solve(options, &problem, &summary);
770 std::cout << "Final report:\n" << summary.FullReport();
|
| H A D | libmv_homography.cc | 287 const ceres::IterationSummary& summary) {
289 if (!summary.step_is_successful) {
363 ceres::Solver::Summary summary; local
364 ceres::Solve(solver_options, &problem, &summary);
366 LOG(INFO) << "Summary:\n" << summary.FullReport();
369 return summary.IsSolutionUsable();
286 operator ()( const ceres::IterationSummary& summary) argument
|
| H A D | more_garbow_hillstrom.cc | 289 Solver::Summary summary; local
290 Solve(options, &problem, &summary);
294 std::abs(2.0 * summary.final_cost -
320 Solver::Summary summary; local
321 Solve(options, &problem, &summary);
325 std::abs(2.0 * summary.final_cost -
|
| H A D | nist.cc | 435 ceres::Solver::Summary summary; local
436 Solve(options, &problem, &summary);
467 summary.initial_cost,
468 summary.final_cost,
470 (summary.num_successful_steps + summary.num_unsuccessful_steps));
|
| H A D | powell.cc | 144 Solver::Summary summary; local
145 Solve(options, &problem, &summary);
147 std::cout << summary.FullReport() << "\n";
|
| H A D | robot_pose_mle.cc | 308 Solver::Summary summary; local
310 Solve(solver_options, &problem, &summary);
312 std::cout << summary.FullReport() << "\n";
|
| H A D | robust_curve_fitting.cc | 157 Solver::Summary summary; local
158 Solve(options, &problem, &summary);
159 std::cout << summary.BriefReport() << "\n";
|
| H A D | simple_bundle_adjuster.cc | 214 ceres::Solver::Summary summary; local
215 ceres::Solve(options, &problem, &summary);
216 std::cout << summary.FullReport() << "\n";
|
| /external/ceres-solver/internal/ceres/ |
| H A D | c_api.cc | 185 ceres::Solver::Summary summary; local
186 ceres::Solve(options, problem, &summary);
187 std::cout << summary.FullReport() << "\n";
|
| H A D | callbacks.cc | 47 const IterationSummary& summary) {
48 if (summary.step_is_successful) {
63 const IterationSummary& summary) {
70 summary.iteration,
71 summary.cost,
72 summary.cost_change,
73 summary.gradient_max_norm,
74 summary.step_norm,
75 summary.step_size,
76 summary
46 operator ()( const IterationSummary& summary) argument
62 operator ()( const IterationSummary& summary) argument
[all...] |
| H A D | cgnr_solver.cc | 81 LinearSolver::Summary summary = local
84 return summary;
|
| H A D | conjugate_gradients_solver.cc | 76 LinearSolver::Summary summary; local
77 summary.termination_type = LINEAR_SOLVER_NO_CONVERGENCE;
78 summary.message = "Maximum number of iterations reached.";
79 summary.num_iterations = 0;
88 summary.termination_type = LINEAR_SOLVER_SUCCESS;
89 summary.message = "Convergence. |b| = 0.";
90 return summary;
105 summary.termination_type = LINEAR_SOLVER_SUCCESS;
106 summary.message =
108 return summary;
[all...] |
| H A D | coordinate_descent_minimizer.cc | 124 Solver::Summary* summary) {
206 Solver::Summary* summary) {
207 *summary = Solver::Summary();
208 summary->initial_cost = 0.0;
209 summary->fixed_cost = 0.0;
210 summary->final_cost = 0.0;
233 minimizer.Minimize(minimizer_options, parameter, summary);
121 Minimize( const Minimizer::Options& options, double* parameters, Solver::Summary* summary) argument
203 Solve(Program* program, LinearSolver* linear_solver, double* parameter, Solver::Summary* summary) argument
|
| H A D | dense_normal_cholesky_solver.cc | 96 LinearSolver::Summary summary; local
97 summary.num_iterations = 1;
98 summary.termination_type = LINEAR_SOLVER_SUCCESS;
103 summary.termination_type = LINEAR_SOLVER_FAILURE;
104 summary.message = "Eigen LLT decomposition failed.";
106 summary.termination_type = LINEAR_SOLVER_SUCCESS;
107 summary.message = "Success.";
112 return summary;
155 LinearSolver::Summary summary; local
156 summary
[all...] |
| H A D | dense_qr_solver.cc | 104 LinearSolver::Summary summary; local
105 summary.num_iterations = 1;
106 summary.termination_type = LAPACK::SolveInPlaceUsingQR(lhs_.rows(),
112 &summary.message);
114 if (summary.termination_type == LINEAR_SOLVER_SUCCESS) {
119 return summary;
160 LinearSolver::Summary summary; local
161 summary.num_iterations = 1;
162 summary.termination_type = LINEAR_SOLVER_SUCCESS;
163 summary
[all...] |
| H A D | dogleg_strategy.cc | 100 TrustRegionStrategy::Summary summary; local
101 summary.num_iterations = 0;
102 summary.termination_type = LINEAR_SOLVER_SUCCESS;
103 return summary;
133 TrustRegionStrategy::Summary summary; local
134 summary.residual_norm = linear_solver_summary.residual_norm;
135 summary.num_iterations = linear_solver_summary.num_iterations;
136 summary.termination_type = linear_solver_summary.termination_type;
139 return summary;
153 summary
[all...] |
| H A D | dogleg_strategy_test.cc | 142 TrustRegionStrategy::Summary summary = strategy.ComputeStep(pso, local
147 EXPECT_NE(summary.termination_type, LINEAR_SOLVER_FAILURE);
162 TrustRegionStrategy::Summary summary = strategy.ComputeStep(pso, local
167 EXPECT_NE(summary.termination_type, LINEAR_SOLVER_FAILURE);
182 TrustRegionStrategy::Summary summary = strategy.ComputeStep(pso, local
187 EXPECT_NE(summary.termination_type, LINEAR_SOLVER_FAILURE);
244 TrustRegionStrategy::Summary summary = strategy.ComputeStep(pso, local
249 EXPECT_NE(summary.termination_type, LINEAR_SOLVER_FAILURE);
272 TrustRegionStrategy::Summary summary = strategy.ComputeStep(pso, local
277 EXPECT_NE(summary
[all...] |