1. Line searchIn optimization, the line search strategy is one of two basic iterative approaches to finding a local minimum of an objective function . The other approach is trust region. The line search approach first finds a descent direction along which the objective function will be reduced and then computes a step size that decides how far should move along that direction. The descent direction can be computed by various methods, such as gradient descent, Newton's method and Quasi-Newton method.
Read “Line search” on English Wikipedia
Read “直線探索” on Japanese Wikipedia
Read “Line search” on DBpedia
Read “Line search” on English Wikipedia
Read “直線探索” on Japanese Wikipedia
Read “Line search” on DBpedia
Discussions
Log in to talk about this word.