Lines Matching defs:Solver
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. This
421 // can range from no hints, where the solver is free to decide the
423 // linear solver being used, to an exact order in which the
443 // same group and the solver is free to decide the best
458 // {0: x, y} - Solver gets to decide the elimination order.
470 // the solver will see that the user wants to use a Schur type solver
479 // Once assigned, Solver::Options owns this pointer and will
560 // Solver::Options::num_threads to the maximum number possible is
566 // 1. Let the solver heuristically decide which parameter blocks
568 // Solver::Options::inner_iteration_ordering untouched.
587 // Minimum number of iterations for which the linear solver should
591 // Maximum number of iterations for which the linear solver should
592 // run. If the solver does not converge in less than
597 // Forcing sequence parameter. The truncated Newton solver uses
608 // the linear least squares solver.
693 // The solver does NOT take ownership of these pointers.
696 // If non-empty, a summary of the execution of the solver is
704 // A brief one line description of the state of the solver after
708 // A full multiline description of the state of the solver after
717 // If the solver did not run, or there was a failure, a
815 // solver are reported in the summary object.
818 Solver::Summary* summary);
822 void Solve(const Solver::Options& options,
824 Solver::Summary* summary);
