| /external/ceres-solver/internal/ceres/ |
| summary_utils.h | 42 void SummarizeGivenProgram(const Program& program, Solver::Summary* summary);
43 void SummarizeReducedProgram(const Program& program, Solver::Summary* summary);
44 void SetSummaryFinalCost(Solver::Summary* summary);
|
| dense_normal_cholesky_solver.h | 82 virtual LinearSolver::Summary SolveImpl(
88 LinearSolver::Summary SolveUsingLAPACK(
94 LinearSolver::Summary SolveUsingEigen(
|
| dense_qr_solver.h | 87 virtual LinearSolver::Summary SolveImpl(
93 LinearSolver::Summary SolveUsingEigen(
99 LinearSolver::Summary SolveUsingLAPACK(
|
| sparse_normal_cholesky_solver.h | 62 virtual LinearSolver::Summary SolveImpl(
68 LinearSolver::Summary SolveImplUsingSuiteSparse(
74 LinearSolver::Summary SolveImplUsingCXSparse(
80 LinearSolver::Summary SolveImplUsingEigen(
|
| solver_impl.h | 57 Solver::Summary* summary);
61 Solver::Summary* summary);
70 Solver::Summary* summary);
74 Solver::Summary* summary);
80 Solver::Summary* summary);
[all...] |
| schur_complement_solver.h | 119 virtual LinearSolver::Summary SolveImpl(
135 virtual LinearSolver::Summary SolveReducedLinearSystem(
156 virtual LinearSolver::Summary SolveReducedLinearSystem(
170 virtual LinearSolver::Summary SolveReducedLinearSystem(
172 LinearSolver::Summary SolveReducedLinearSystemUsingSuiteSparse(
174 LinearSolver::Summary SolveReducedLinearSystemUsingCXSparse(
176 LinearSolver::Summary SolveReducedLinearSystemUsingEigen(
|
| summary_utils.cc | 39 void SetSummaryFinalCost(Solver::Summary* summary) {
40 summary->final_cost = summary->initial_cost;
43 for (int i = 0; i < summary->iterations.size(); ++i) {
44 const IterationSummary& iteration_summary = summary->iterations[i];
45 summary->final_cost = min(iteration_summary.cost, summary->final_cost);
49 void SummarizeGivenProgram(const Program& program, Solver::Summary* summary) {
[all...] |
| trust_region_strategy.h | 105 struct Summary {
106 Summary()
133 virtual Summary ComputeStep(const PerSolveOptions& per_solve_options,
|
| cgnr_solver.h | 54 virtual Summary SolveImpl(
|
| conjugate_gradients_solver.h | 61 virtual Summary Solve(LinearOperator* A,
|
| trust_region_minimizer.h | 50 Solver::Summary* summary);
|
| line_search.h | 178 struct Summary {
179 Summary()
207 // summary must not be null and will contain the result of the line
210 // Summary::success is true if a non-zero step size is found.
214 Summary* summary) = 0;
263 Summary* summary);
280 Summary* summary);
[all...] |
| coordinate_descent_minimizer.h | 68 Solver::Summary* summary);
85 Solver::Summary* summary);
|
| iterative_schur_complement_solver.h | 76 virtual LinearSolver::Summary SolveImpl(
|
| levenberg_marquardt_strategy.h | 52 virtual TrustRegionStrategy::Summary ComputeStep(
|
| line_search_minimizer.h | 71 Solver::Summary* summary);
|
| dense_normal_cholesky_solver.cc | 52 LinearSolver::Summary DenseNormalCholeskySolver::SolveImpl(
64 LinearSolver::Summary DenseNormalCholeskySolver::SolveUsingEigen(
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."
155 LinearSolver::Summary summary; local
[all...] |
| dense_qr_solver.cc | 52 LinearSolver::Summary DenseQRSolver::SolveImpl(
64 LinearSolver::Summary DenseQRSolver::SolveUsingLAPACK(
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;
122 LinearSolver::Summary DenseQRSolver::SolveUsingEigen
160 LinearSolver::Summary summary; local
[all...] |
| linear_solver.h | 261 // Summary of a call to the Solve method. We should move away from
263 // let the summary object do the talking.
264 struct Summary {
265 Summary()
288 virtual Summary Solve(LinearOperator* A,
320 virtual LinearSolver::Summary Solve(
341 virtual LinearSolver::Summary SolveImpl(
|
| sparse_normal_cholesky_solver.cc | 78 LinearSolver::Summary SparseNormalCholeskySolver::SolveImpl(
102 LinearSolver::Summary summary; local
105 summary = SolveImplUsingSuiteSparse(A, per_solve_options, x);
108 summary = SolveImplUsingCXSparse(A, per_solve_options, x);
111 summary = SolveImplUsingEigen(A, per_solve_options, x);
122 return summary;
125 LinearSolver::Summary SparseNormalCholeskySolver::SolveImplUsingEigen(
131 LinearSolver::Summary summary; local
228 LinearSolver::Summary summary; local
310 LinearSolver::Summary summary; local
[all...] |
| schur_complement_solver.cc | 60 LinearSolver::Summary SchurComplementSolver::SolveImpl(
84 const LinearSolver::Summary summary = local
88 if (summary.termination_type == LINEAR_SOLVER_SUCCESS) {
93 return summary;
117 LinearSolver::Summary
119 LinearSolver::Summary summary; local
120 summary.num_iterations = 0;
121 summary.termination_type = LINEAR_SOLVER_SUCCESS
276 LinearSolver::Summary summary; local
383 LinearSolver::Summary summary; local
439 LinearSolver::Summary summary; local
[all...] |
| cgnr_solver.cc | 53 LinearSolver::Summary CgnrSolver::SolveImpl(
81 LinearSolver::Summary summary = local
84 return summary;
|
| dogleg_strategy.h | 61 virtual Summary ComputeStep(const PerSolveOptions& per_solve_options,
82 LinearSolver::Summary ComputeGaussNewtonStep(
|
| minimizer_test.cc | 42 virtual CallbackReturnType operator()(const IterationSummary& summary) {
65 virtual CallbackReturnType operator()(const IterationSummary& summary) {
75 Solver::Summary summary; local
76 Minimizer::RunCallbacks(minimizer_options, IterationSummary(), &summary);
77 EXPECT_EQ(summary.message, "User callback returned SOLVER_ABORT.");
83 virtual CallbackReturnType operator()(const IterationSummary& summary) {
93 Solver::Summary summary; local
94 Minimizer::RunCallbacks(minimizer_options, IterationSummary(), &summary);
[all...] |
| /external/compiler-rt/make/ |
| config.mk | 40 ifndef Summary
41 Summary = $(Echo)
|
