Searched refs:subspace_g_ (Results 1 – 2 of 2) sorted by relevance
344 const Vector2d grad_minimum = subspace_B_ * minimum + subspace_g_; in ComputeSubspaceDoglegStep()429 polynomial(2) = r2 * (trB * trB + 2.0 * detB) - subspace_g_.squaredNorm(); in MakePolynomialForBoundaryConstrainedProblem()430 polynomial(3) = -2.0 * (subspace_g_.transpose() * B_adj * subspace_g_ in MakePolynomialForBoundaryConstrainedProblem()432 polynomial(4) = r2 * detB * detB - (B_adj * subspace_g_).squaredNorm(); in MakePolynomialForBoundaryConstrainedProblem()448 return -B_i.partialPivLu().solve(subspace_g_); in ComputeSubspaceStepFromRoot()454 return 0.5 * x.dot(subspace_B_ * x) + subspace_g_.dot(x); in EvaluateSubspaceModel()699 subspace_g_ = subspace_basis_.transpose() * gradient_; in ComputeSubspaceModel()
75 Vector subspace_g() const { return subspace_g_; } in subspace_g()158 Vector2d subspace_g_; variable