/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, 70 Solver::Summary* summary) [all...] |
summary_utils.h | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 35 #include "ceres/solver.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);
|
solver_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 31 #include "ceres/solver.h" 47 Solver::Options options; 54 Solver::Options options; 85 TEST(Solver, UpdateStateEveryIterationOption) { 95 Solver::Options options; 101 Solver::Summary summary; 162 TEST(Solver, TrustRegionProblemHasNoParameterBlocks) { 164 Solver::Options options [all...] |
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; 72 Solver::Options solver_options; 75 Solver::Summary summary; 90 Solver::Options solver_options; 93 Solver::Summary summary;
|
summary_utils.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 34 #include "ceres/solver.h" 39 void SetSummaryFinalCost(Solver::Summary* summary) { 49 void SummarizeGivenProgram(const Program& program, Solver::Summary* summary) { 57 void SummarizeReducedProgram(const Program& program, 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);
|
coordinate_descent_minimizer.h | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 40 #include "ceres/solver.h" 68 Solver::Summary* summary); 85 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/ 35 #include "ceres/solver.h" 71 Solver::Summary* summary);
|
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) { 124 // Number of times the linear solver should be retried in case of 191 Solver::Summary* summary); 199 Solver::Summary* summary) = 0 [all...] |
solver.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 33 #include "ceres/solver.h" 54 ss << string("Solver::Options::" #x " = ") << options.x << ". "; \ 56 ss << string("Solver::Options::" #x " " #OP " "#y); \ 65 ss << string("Solver::Options::" #x " = ") << options.x << ". "; \ 66 ss << string("Solver::Options::" #y " = ") << options.y << ". "; \ 68 ss << string("Solver::Options::" #x ); \ 69 ss << string(#OP " Solver::Options::" #y "."); \ 81 bool CommonOptionsAreValid(const Solver::Options& options, string* error) 334 Solver solver; local [all...] |
solver_impl_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 84 Solver::Options options; 87 Solver::Summary summary;
|
minimizer.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 42 Solver::Summary* summary) {
|
/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;
|
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/ 125 void SetLinearSolver(Solver::Options* options) { 141 void SetOrdering(BALProblem* bal_problem, Solver::Options* options) { 226 void SetMinimizerOptions(Solver::Options* options) { 244 Solver::Options* options) { 320 Solver::Options options; 324 Solver::Summary summary;
|
robot_pose_mle.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 145 using ceres::Solver; 305 ceres::Solver::Options solver_options; 308 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/llvm/include/llvm/CodeGen/PBQP/ |
Graph.h | 179 SolverT *Solver; 347 Graph() : Solver(nullptr) {} 350 Graph(GraphMetadata Metadata) : Metadata(Metadata), Solver(nullptr) {} 358 /// @brief Lock this graph to the given solver instance in preparation 359 /// for running the solver. This method will call solver.handleAddNode for 361 /// solver an opportunity to set up any requried metadata. 363 assert(!Solver && "Solver already set. Call unsetSolver()."); 364 Solver = &S [all...] |
/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/ 50 class CERES_EXPORT Solver { 52 virtual ~Solver(); 55 // the solver operates. The defaults should be suitable for a wide range of 370 // solver flakiness, the trust region strategy may return a 395 // Linear least squares solver options ------------------------------------- 427 // step. Currently only the SPARSE_SCHUR solver is capable of 431 // The order in which variables are eliminated in a linear solver 439 // the solver about the variable elimination ordering to use. Thi [all...] |
/external/eigen/bench/spbench/ |
spbenchsolver.h | 83 int best_time_id; // id of the best solver for the current system 107 out <<" <SOLVER ID='" << EIGEN_UMFPACK << "'>\n"; 110 out << " </SOLVER> \n"; 113 out <<" <SOLVER ID='" << EIGEN_SUPERLU << "'>\n"; 116 out << " </SOLVER> \n"; 119 out <<" <SOLVER ID='" << EIGEN_CHOLMOD_SIMPLICIAL_LLT << "'>\n"; 122 out << " </SOLVER> \n"; 124 out <<" <SOLVER ID='" << EIGEN_CHOLMOD_SUPERNODAL_LLT << "'>\n"; 127 out << " </SOLVER> \n"; 129 out <<" <SOLVER ID='" << EIGEN_CHOLMOD_LDLT << "'>\n"; 315 UmfPackLU<SpMat> solver; local 323 SuperLU<SpMat> solver; local 332 PastixLU<SpMat> solver; local 341 PardisoLU<SpMat> solver; local 348 SparseLU<SpMat, COLAMDOrdering<int> > solver; local 354 SparseLU<SpMat, MetisOrdering<int> > solver; local 362 BiCGSTAB<SpMat> solver; local 368 BiCGSTAB<SpMat, IncompleteLUT<Scalar> > solver; local 382 GMRES<SpMat, IncompleteLUT<Scalar> > solver; local 392 SimplicialLDLT<SpMat, Lower> solver; local 400 CholmodDecomposition<SpMat, Lower> solver; local 410 PastixLDLT<SpMat, Lower> solver; local 419 PardisoLDLT<SpMat, Lower> solver; local 432 SimplicialLLT<SpMat, Lower> solver; local 441 CholmodDecomposition<SpMat, Lower> solver; local 455 PastixLLT<SpMat, Lower> solver; local 464 PardisoLLT<SpMat, Lower> solver; local 472 ConjugateGradient<SpMat, Lower> solver; local [all...] |