Lines Matching full:trust
133 // Trust Region and Line Search.
143 // 2. The trust region approach approximates the objective
145 // a subset of the search space known as the trust region. If the
147 // function the trust region is expanded; conversely, otherwise it
151 // Trust region methods are in some sense dual to line search methods:
152 // trust region methods first choose a step size (the size of the
153 // trust region) and then a step direction while line search methods
295 // The classical trust region methods are descent methods, in that
309 // non-monotonic trust region algorithm as described by Conn,
310 // Gould & Toint in "Trust Region Methods", Section 10.1.
333 // Trust region minimizer settings.
337 // Minimizer terminates when the trust region radius becomes
347 // trust region. Extremely small and large values along the
356 // solver flakiness, the trust region strategy may return a
358 // trust region size. So the TrustRegionMinimizer allows for a few
506 // beneficial to modify the way the trust region step is computed.
537 // Algorithm II, where once the Newton/Trust Region step has been
543 // linear in a_1 and a_2, i.e., Solve for the trust region step
583 // of inner iterations in subsequent trust region minimizer
621 // List of iterations at which the minimizer should dump the trust
