HomeSort by relevance Sort by last modified time
    Searched refs:BFGS (Results 1 - 4 of 4) sorted by null

  /external/ceres-solver/internal/ceres/
line_search_direction.cc 117 << "Ceres bug: NextDirection() called on L-BFGS after inverse Hessian "
130 LOG(WARNING) << "Numerical failure in L-BFGS update: inverse Hessian "
146 class BFGS : public LineSearchDirection {
148 BFGS(const int num_parameters,
155 << "BFGS line search being created with: " << num_parameters_
158 << ", consider using the L-BFGS memory-efficient line search direction "
165 virtual ~BFGS() {}
171 << "Ceres bug: NextDirection() called on BFGS after inverse Hessian "
180 VLOG(2) << "Skipping BFGS Update, delta_x_dot_delta_gradient too "
222 // Efficient O(num_parameters^2) BFGS update [2]
    [all...]
types.cc 186 CASESTR(BFGS);
198 STRENUM(BFGS);
solver_impl.cc 652 if ((original_options.line_search_direction_type == ceres::BFGS ||
657 "ceres::WOLFE when using (L)BFGS to ensure that underlying "
    [all...]
  /external/ceres-solver/include/ceres/
types.h 177 // BFGS, and it's limited memory approximation L-BFGS, are quasi-Newton
186 // remaining degrees-of-freedom. (L)BFGS methods uniquely deteremine the
191 // (L)BFGS & DFP). (L)BFGS is currently regarded as being the best known
194 // The principal difference between BFGS and L-BFGS is that whilst BFGS
195 // maintains a full, dense approximation to the (inverse) Hessian, L-BFGS
203 // For more details on BFGS see
    [all...]

Completed in 328 milliseconds