Lines Matching refs:minimum
149 // Find the minimum in the subspace defined by the
256 // The subspace method finds the minimum of the two-dimensional problem
318 Vector2d minimum(0.0, 0.0);
319 if (!FindMinimumOnTrustRegionBoundary(&minimum)) {
328 // Test first order optimality at the minimum.
329 // The first order KKT conditions state that the minimum x*
336 // Here, as it is already known that the minimum lies on the boundary, the
341 // This condition should not be violated. If it is, the minimum was not
344 const Vector2d grad_minimum = subspace_B_ * minimum + subspace_g_;
345 const double cosine_angle = -minimum.dot(grad_minimum) /
346 (minimum.norm() * grad_minimum.norm());
360 dogleg_step = subspace_basis_ * minimum;
465 // root finding fails, the function returns false and minimum will be set
470 bool DoglegStrategy::FindMinimumOnTrustRegionBoundary(Vector2d* minimum) const {
471 CHECK_NOTNULL(minimum);
474 minimum->setZero();
499 // in the minimum, it is safe to consider all of them after projecting
506 *minimum = x_i;