Searched refs:BFGS (Results 1 – 8 of 8) sorted by relevance
145 class BFGS : public LineSearchDirection { class147 BFGS(const int num_parameters, in BFGS() function in ceres::internal::BFGS164 virtual ~BFGS() {} in ~BFGS()361 if (options.type == ceres::BFGS) { in Create()362 return new ceres::internal::BFGS( in Create()
188 CASESTR(BFGS); in LineSearchDirectionTypeToString()200 STRENUM(BFGS); in StringToLineSearchDirectionType()
244 if ((options.line_search_direction_type == ceres::BFGS || in LineSearchOptionsAreValid()
245 BFGS, enumerator
43 - Line search solvers (L-BFGS and Nonlinear CG)
60 of Non-linear Conjugate Gradients, BFGS and LBFGS.
405 3. ``BFGS`` A generalization of the Secant method to multiple408 [NocedalWright]_. BFGS is currently the best known general411 4. ``LBFGS`` A limited memory approximation to the full ``BFGS``420 ``BFGS`` and ``LBFGS`` methods to be guaranteed to be satisfied the818 ``BFGS`` and ``LBFGS``.825 Note that in order for the assumptions underlying the ``BFGS`` and840 The L-BFGS hessian approximation is a low rank approximation to the863 As part of the ``BFGS`` update step / ``LBFGS`` right-multiply870 scaling in ``BFGS`` (before first iteration) and ``LBFGS`` (at each
230 #. ``BFGS`` line search direction. (Alex Stewart)296 #. Fix update of L-BFGS history buffers after they become full. (Alex