Searched refs:diagonal_ (Results 1 – 5 of 5) sorted by relevance
109 if (diagonal_.rows() != n) { in ComputeStep()110 diagonal_.resize(n, 1); in ComputeStep()121 jacobian->SquaredColumnNorm(diagonal_.data()); in ComputeStep()123 diagonal_[i] = min(max(diagonal_[i], min_diagonal_), max_diagonal_); in ComputeStep()125 diagonal_ = diagonal_.array().sqrt(); in ComputeStep()176 gradient_.array() /= diagonal_.array(); in ComputeGradient()188 (gradient_.array() / diagonal_.array()).matrix(); in ComputeCauchyPoint()208 dogleg_step.array() /= diagonal_.array(); in ComputeTraditionalDoglegStep()220 dogleg_step.array() /= diagonal_.array(); in ComputeTraditionalDoglegStep()251 dogleg_step.array() /= diagonal_.array(); in ComputeTraditionalDoglegStep()[all …]
76 if (diagonal_.rows() != num_parameters) { in ComputeStep()77 diagonal_.resize(num_parameters, 1); in ComputeStep()80 jacobian->SquaredColumnNorm(diagonal_.data()); in ComputeStep()82 diagonal_[i] = min(max(diagonal_[i], min_diagonal_), max_diagonal_); in ComputeStep()86 lm_diagonal_ = (diagonal_ / radius_).array().sqrt(); in ComputeStep()
58 diagonal_(diagonal) { in RegularizationCheckingLinearSolver()71 EXPECT_NEAR(per_solve_options.D[i], diagonal_[i], kTolerance) in SolveImpl()72 << i << " " << per_solve_options.D[i] << " " << diagonal_[i]; in SolveImpl()78 const double* diagonal_; member in ceres::internal::RegularizationCheckingLinearSolver
77 Vector diagonal_; // diagonal_ = diag(J'J) variable
119 Vector diagonal_; // sqrt(diag(J^T J)) variable