Lines Matching refs:Solver
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);
74 static void LineSearchSolve(const Solver::Options& options,
76 Solver::Summary* summary);
79 static void LineSearchMinimize(const Solver::Options &options,
83 Solver::Summary* summary);
93 static Program* CreateReducedProgram(Solver::Options* options,
98 // Create the appropriate linear solver, taking into account any
100 // selected linear solver, which may be different from what the user
103 static LinearSolver* CreateLinearSolver(Solver::Options* options,
117 const Solver::Options& options,
133 static bool IsOrderingValid(const Solver::Options& options,
142 const Solver::Options& options,
145 Solver::Summary* summary);
147 // If the linear solver is of Schur type, then replace it with the
148 // closest equivalent linear solver. This is done when the user
149 // requested a Schur type solver but the problem structure makes it
152 // If the linear solver is not of Schur type, the function is a
155 Solver::Options* options);
196 // If the linear solver type is SPARSE_SCHUR and support for
