| /external/ceres-solver/examples/ |
| H A D | helloworld.cc | 43 using ceres::Solve;
77 Solve(options, &problem, &summary);
|
| H A D | helloworld_analytic_diff.cc | 43 using ceres::Solve;
100 Solve(options, &problem, &summary);
|
| H A D | helloworld_numeric_diff.cc | 42 using ceres::Solve;
73 Solve(options, &problem, &summary);
|
| H A D | quadratic.cc | 43 using ceres::Solve;
86 Solve(options, &problem, &summary);
|
| H A D | quadratic_auto_diff.cc | 45 using ceres::Solve;
84 Solve(options, &problem, &summary);
|
| H A D | quadratic_numeric_diff.cc | 44 using ceres::Solve;
79 Solve(options, &problem, &summary);
|
| H A D | circle_fit.cc | 65 using ceres::Solve;
154 Solve(options, &problem, &summary);
|
| H A D | powell.cc | 56 using ceres::Solve;
145 Solve(options, &problem, &summary);
|
| H A D | curve_fitting.cc | 38 using ceres::Solve;
158 Solve(options, &problem, &summary);
|
| H A D | data_fitting.cc | 38 using ceres::Solve;
160 Solve(options, &problem, &summary);
|
| H A D | robust_curve_fitting.cc | 120 using ceres::Solve;
158 Solve(options, &problem, &summary);
|
| /external/ceres-solver/internal/ceres/ |
| H A D | conjugate_gradients_solver.h | 61 virtual Summary Solve(LinearOperator* A,
|
| H A D | coordinate_descent_minimizer.h | 70 void Solve(Program* program,
|
| H A D | iterative_schur_complement_solver_test.cc | 90 qr->Solve(&dense_A, b_.get(), per_solve_options, reference_solution.data());
100 isc.Solve(A_.get(), b_.get(), per_solve_options, isc_sol.data());
|
| H A D | symmetric_linear_solver_test.cc | 72 solver.Solve(A.get(), b.data(), per_solve_options, x.data());
129 solver.Solve(A.get(), b.data(), per_solve_options, x.data());
|
| H A D | schur_complement_solver_test.cc | 78 qr->Solve(&dense_A, b.get(), LinearSolver::PerSolveOptions(), sol.get());
83 qr->Solve(&dense_A, b.get(), per_solve_options, sol_d.get());
113 summary = solver->Solve(A.get(), b.get(), per_solve_options, x.get());
|
| H A D | linear_solver.h | 63 // information across solves. This means that calling Solve on the
70 // a particular Solve call.
146 // Options for the Solve method.
239 // Summary of a call to the Solve method. We should move away from
256 // Solve Ax = b.
257 virtual Summary Solve(LinearOperator* A,
283 // details behind a private virtual method, and has the Solve method
289 virtual LinearSolver::Summary Solve( function in class:ceres::internal::TypedLinearSolver
294 ScopedExecutionTimer total_time("LinearSolver::Solve", &execution_summary_);
|
| H A D | cgnr_solver.cc | 53 EventLogger event_logger("CgnrSolver::Solve");
72 // Solve (AtA + DtD)x = z (= Atb).
79 conjugate_gradient_solver.Solve(&lhs, z.get(), cg_per_solve_options, x);
80 event_logger.AddEvent("Solve");
|
| H A D | solver.cc | 66 void Solver::Solve(const Solver::Options& options, function in class:ceres::Solver
72 internal::SolverImpl::Solve(options, problem_impl, summary);
77 void Solve(const Solver::Options& options, function in namespace:ceres
81 solver.Solve(options, problem, summary);
|
| H A D | unsymmetric_linear_solver_test.cc | 89 solver->Solve(transformed_A.get(),
97 solver->Solve(transformed_A.get(),
|
| H A D | c_api.cc | 186 ceres::Solve(options, problem, &summary);
|
| H A D | iterative_schur_complement_solver.cc | 69 EventLogger event_logger("IterativeSchurComplementSolver::Solve");
160 cg_summary = cg_solver.Solve(schur_complement_.get(),
172 event_logger.AddEvent("Solve");
|
| H A D | levenberg_marquardt_strategy.cc | 107 linear_solver_->Solve(jacobian, residuals, solve_options, step);
|
| H A D | solver_impl.h | 55 static void Solve(const Solver::Options& options,
|
| /external/ceres-solver/include/ceres/ |
| H A D | solver.h | 543 // linear in a_1 and a_2, i.e., Solve for the trust region step
739 // When the user calls Solve, before the actual optimization
753 // Some total of all time spent inside Ceres when Solve is called.
816 virtual void Solve(const Options& options,
822 void Solve(const Solver::Options& options,
|