Lines Matching refs:ceres
0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
40 #include "ceres/ceres.h"
270 ceres::ConstMatrixRef kY(kYData, kYRows, kYCols);
272 class PointToLineSegmentContourCostFunction : public ceres::CostFunction {
312 ceres::MatrixRef(jacobians[i + 1], 2, 2).setZero();
325 static ceres::CostFunction* Create(const int num_segments,
350 static ceres::CostFunction* Create(const double& sqrt_weight) {
351 return new ceres::AutoDiffCostFunction<EuclideanDistanceFunctor, 2, 2, 2>(
359 bool SolveWithFullReport(ceres::Solver::Options options,
360 ceres::Problem* problem,
364 ceres::Solver::Summary summary;
365 ceres::Solve(options, problem, &summary);
372 return summary.termination_type == ceres::CONVERGENCE;
410 ceres::Problem problem;
436 ceres::Solver::Options options;
438 options.linear_solver_type = ceres::SPARSE_NORMAL_CHOLESKY;
