Lines Matching refs:minimum
144 // Find the minimum in the subspace defined by the
251 // The subspace method finds the minimum of the two-dimensional problem
313 Vector2d minimum(0.0, 0.0);
314 if (!FindMinimumOnTrustRegionBoundary(&minimum)) {
323 // Test first order optimality at the minimum.
324 // The first order KKT conditions state that the minimum x*
331 // Here, as it is already known that the minimum lies on the boundary, the
336 // This condition should not be violated. If it is, the minimum was not
339 const Vector2d grad_minimum = subspace_B_ * minimum + subspace_g_;
340 const double cosine_angle = -minimum.dot(grad_minimum) /
341 (minimum.norm() * grad_minimum.norm());
355 dogleg_step = subspace_basis_ * minimum;
460 // root finding fails, the function returns false and minimum will be set
465 bool DoglegStrategy::FindMinimumOnTrustRegionBoundary(Vector2d* minimum) const {
466 CHECK_NOTNULL(minimum);
469 minimum->setZero();
494 // in the minimum, it is safe to consider all of them after projecting
501 *minimum = x_i;
