Matches in DBpedia 2016-04 for { ?s ?p "In (unconstrained) minimization, a backtracking line search, a search scheme based on the Armijo–Goldstein condition, is a line search method to determine the maximum amount to move along a given search direction. It involves starting with a relatively large estimate of the step size for movement along the search direction, and iteratively shrinking the step size (i.e., \"backtracking\") until a decrease of the objective function is observed that adequately corresponds to the decrease that is expected, based on the local gradient of the objective function."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Backtracking_line_search abstract "In (unconstrained) minimization, a backtracking line search, a search scheme based on the Armijo–Goldstein condition, is a line search method to determine the maximum amount to move along a given search direction. It involves starting with a relatively large estimate of the step size for movement along the search direction, and iteratively shrinking the step size (i.e., \"backtracking\") until a decrease of the objective function is observed that adequately corresponds to the decrease that is expected, based on the local gradient of the objective function.".