Searched refs:BFGS (Results 1 – 7 of 7) sorted by relevance
146 class BFGS : public LineSearchDirection { class148 BFGS(const int num_parameters, in BFGS() function in ceres::internal::BFGS165 virtual ~BFGS() {} in ~BFGS()320 if (options.type == ceres::BFGS) { in Create()321 return new ceres::internal::BFGS( in Create()
186 CASESTR(BFGS); in LineSearchDirectionTypeToString()198 STRENUM(BFGS); in StringToLineSearchDirectionType()
652 if ((original_options.line_search_direction_type == ceres::BFGS || in LineSearchSolve()
231 BFGS, enumerator
24 (Nonlinear CG and L-BFGS) solvers.
389 3. ``BFGS`` A generalization of the Secant method to multiple392 [NocedalWright]_. BFGS is currently the best known general395 4. ``LBFGS`` A limited memory approximation to the full ``BFGS``404 ``BFGS`` and ``LBFGS`` methods to be guaranteed to be satisfied the795 ``BFGS`` and ``LBFGS``.802 Note that in order for the assumptions underlying the ``BFGS`` and817 The L-BFGS hessian approximation is a low rank approximation to the840 As part of the ``BFGS`` update step / ``LBFGS`` right-multiply847 scaling in ``BFGS`` (before first iteration) and ``LBFGS`` (at each
21 #. ``BFGS`` line search direction. (Alex Stewart)84 #. Fix update of L-BFGS history buffers after they become full. (Alex