| /external/ceres-solver/internal/ceres/ |
| solver_impl.h | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
40 #include "ceres/solver.h"
53 // Mirrors the interface in solver.h, but exposes implementation
55 static void Solve(const Solver::Options& options,
57 Solver::Summary* summary);
59 static void TrustRegionSolve(const Solver::Options& options,
61 Solver::Summary* summary);
65 const Solver::Options &options,
71 Solver::Summary* summary)
[all...] |
| coordinate_descent_minimizer.h | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
41 #include "ceres/solver.h"
67 Solver::Summary* summary);
73 Solver::Summary* summary);
|
| trust_region_minimizer.h | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
35 #include "ceres/solver.h"
50 Solver::Summary* summary);
|
| line_search_minimizer.h | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
37 #include "ceres/solver.h"
73 Solver::Summary* summary);
|
| solver.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
32 #include "ceres/solver.h"
59 Solver::Options::~Options() {
64 Solver::~Solver() {}
66 void Solver::Solve(const Solver::Options& options,
68 Solver::Summary* summary) {
77 void Solve(const Solver::Options& options
80 Solver solver; local
[all...] |
| minimizer.h | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
38 #include "ceres/solver.h"
52 // see solver.h for detailed information about the meaning and
56 Init(Solver::Options());
59 explicit Options(const Solver::Options& options) {
63 void Init(const Solver::Options& options) {
122 // Number of times the linear solver should be retried in case of
184 Solver::Summary* summary);
192 Solver::Summary* summary) = 0
[all...] |
| minimizer.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
42 Solver::Summary* summary) {
|
| minimizer_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
34 #include "ceres/solver.h"
51 Solver::Options solver_options;
|
| c_api.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
43 #include "ceres/solver.h"
180 ceres::Solver::Options options;
185 ceres::Solver::Summary summary;
|
| solver_impl.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
83 void SetSummaryFinalCost(Solver::Summary* summary) {
165 // Basic callback to record the execution of the solver to a file for
214 const Solver::Options& options,
220 Solver::Summary* summary) {
276 const Solver::Options& options,
280 Solver::Summary* summary) {
317 void SolverImpl::Solve(const Solver::Options& options,
319 Solver::Summary* summary)
[all...] |
| solver_impl_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
286 Solver::Options options;
348 Solver::Options options;
417 Solver::Options options;
500 Solver::Options options;
510 Solver::Options options;
521 Solver::Options options;
532 Solver::Options options;
543 Solver::Options options
579 scoped_ptr<LinearSolver> solver; local
[all...] |
| /external/eigen/test/ |
| sparse_solver.h | 13 template<typename Solver, typename Rhs, typename DenseMat, typename DenseRhs>
14 void check_sparse_solving(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const DenseMat& dA, const DenseRhs& db)
16 typedef typename Solver::MatrixType Mat;
24 solver.compute(A);
25 if (solver.info() != Success)
27 std::cerr << "sparse solver testing: factorization failed (check_sparse_solving)\n";
31 x = solver.solve(b);
32 if (solver.info() != Success
[all...] |
| /external/ceres-solver/examples/ |
| helloworld.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
42 using ceres::Solver;
60 // mutated in place by the solver.
73 // Run the solver!
74 Solver::Options options;
76 Solver::Summary summary;
|
| helloworld_analytic_diff.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
42 using ceres::Solver;
85 // mutated in place by the solver.
96 // Run the solver!
97 Solver::Options options;
99 Solver::Summary summary;
|
| helloworld_numeric_diff.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
41 using ceres::Solver;
56 // mutated in place by the solver.
69 // Run the solver!
70 Solver::Options options;
72 Solver::Summary summary;
|
| quadratic.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
42 using ceres::Solver;
80 // Run the solver!
81 Solver::Options options;
85 Solver::Summary summary;
|
| quadratic_auto_diff.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
44 using ceres::Solver;
78 // Run the solver!
79 Solver::Options options;
83 Solver::Summary summary;
|
| quadratic_numeric_diff.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
43 using ceres::Solver;
73 // Run the solver!
74 Solver::Options options;
78 Solver::Summary summary;
|
| circle_fit.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
66 using ceres::Solver;
150 Solver::Options options;
153 Solver::Summary summary;
|
| powell.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
55 using ceres::Solver;
127 Solver::Options options;
143 // Run the solver!
144 Solver::Summary summary;
|
| curve_fitting.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
37 using ceres::Solver;
152 Solver::Options options;
157 Solver::Summary summary;
|
| bundle_adjuster.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
116 DEFINE_string(solver_log, "", "File to record the solver execution to.");
123 void SetLinearSolver(Solver::Options* options) {
137 void SetOrdering(BALProblem* bal_problem, Solver::Options* options) {
222 void SetMinimizerOptions(Solver::Options* options) {
240 Solver::Options* options) {
320 Solver::Options options;
325 Solver::Summary summary;
|
| data_fitting.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
37 using ceres::Solver;
154 Solver::Options options;
159 Solver::Summary summary;
|
| robust_curve_fitting.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
121 using ceres::Solver;
153 Solver::Options options;
157 Solver::Summary summary;
|
| /external/ceres-solver/include/ceres/ |
| solver.h | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
49 class Solver {
51 virtual ~Solver();
54 // the solver operates. The defaults should be suitable for a wide range of
356 // solver flakiness, the trust region strategy may return a
381 // Linear least squares solver options -------------------------------------
408 // step. Currently only the SPARSE_SCHUR solver is capable of
412 // The order in which variables are eliminated in a linear solver
420 // the solver about the variable elimination ordering to use. Thi
[all...] |
