Lines Matching full:solve
116 // regularize the Gauss-Newton solve and that defines the
373 // For any given y, we can solve (2) for x as
444 return -B_i.partialPivLu().solve(subspace_g_);
453 // This function attempts to solve the boundary-constrained subspace problem
526 // If the solve fails, the multiplier to the diagonal is increased
532 // multiplier starts out from the last successful solve.
540 // that we need to solve the normal equations more or less
557 // As in the LevenbergMarquardtStrategy, solve Jy = r instead
561 linear_solver_summary = linear_solver_->Solve(jacobian,
618 // to doing a pure Gauss-Newton solve.
