Lines Matching full:line
31 // Interface for and implementation of various Line search algorithms.
50 // Line search is another name for a one dimensional optimization
51 // algorithm. The name "line search" comes from the fact one
58 // condition used, we get a variety of different line search
80 // Armijo and Wolfe line search parameters.
82 // Solving the line search problem exactly is computationally
83 // prohibitive. Fortunately, line search based optimization
85 // exact solution, the line search algorithm returns a solution
93 // In each iteration of the Armijo / Wolfe line search,
103 // In each iteration of the Armijo / Wolfe line search,
112 // If during the line search, the step_size falls below this
116 // Maximum number of trial step size iterations during each line search,
118 // this number of trials, the line search will terminate.
121 // Wolfe-specific line search parameters.
132 // Where f() is the line search objective and f'() is the derivative
147 // The one dimensional function that the line search algorithm
152 // An object used by the line search to access the function values
163 // Evaluate the line search objective
176 // Result of the line search.
200 // Perform the line search.
206 // summary must not be null and will contain the result of the line
250 // Backtracking and interpolation based Armijo line search. This
251 // implementation is based on the Armijo line search that ships in the
265 // Bracketing / Zoom Strong Wolfe condition line search. This implementation
