@Article{NM-15-299, author = {J. Li, H. Zhu, X. Zhou and W. Song }, title = {A rapidly convergence algorithm for linear search and its application}, journal = {Numerical Mathematics, a Journal of Chinese Universities}, year = {2006}, volume = {15}, number = {4}, pages = {299--305}, abstract = { The essence of the linear search is one-dimension nonlinear minimization problem, which is an important part of the multi-nonlinear optimization, it will be spend the most of operation count for solving optimization problem. To improve the efficiency, we set about from quadratic interpolation, combine the advantage of the quadratic convergence rate of Newton's method and adopt the idea of Anderson-Bjorck extrapolation, then we present a rapidly convergence algorithm and give its corresponding convergence conclusions. Finally we did the numerical experiments with the some well-known test functions for optimization and the application test of the ANN learning examples. The experiment results showed the validity of the algorithm. }, issn = {}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/nm/8037.html} }