Searched refs:LBFGS (Results 1 – 9 of 9) sorted by relevance
99 class LBFGS : public LineSearchDirection { class101 LBFGS(const int num_parameters, in LBFGS() function in ceres::internal::LBFGS109 virtual ~LBFGS() {} in ~LBFGS()354 if (options.type == ceres::LBFGS) { in Create()355 return new ceres::internal::LBFGS( in Create()
46 type(LBFGS), in Options()
187 CASESTR(LBFGS); in LineSearchDirectionTypeToString()199 STRENUM(LBFGS); in StringToLineSearchDirectionType()
245 options.line_search_direction_type == ceres::LBFGS) && in LineSearchOptionsAreValid()381 line_search_direction_type(LBFGS), in Summary()519 if (line_search_direction_type == LBFGS) { in FullReport()
244 LBFGS, enumerator
63 line_search_direction_type = LBFGS; in Options()
60 of Non-linear Conjugate Gradients, BFGS and LBFGS.
411 4. ``LBFGS`` A limited memory approximation to the full ``BFGS``420 ``BFGS`` and ``LBFGS`` methods to be guaranteed to be satisfied the815 Default: ``LBFGS``818 ``BFGS`` and ``LBFGS``.826 ``LBFGS`` line search direction algorithms to be guaranteed to be863 As part of the ``BFGS`` update step / ``LBFGS`` right-multiply870 scaling in ``BFGS`` (before first iteration) and ``LBFGS`` (at each2147 If the type of the line search direction is `LBFGS`, then this
55 #. LBFGS is faster due to fewer memory copies.420 gradient descent, non-linear conjugate gradient and LBFGS search