首页 | 本学科首页   官方微博 | 高级检索  
     


Analysis of a new algorithm for one-dimensional minimization
Authors:Siv Ing Petter Bjørstad  Jorge Nocedal
Affiliation:1. Computer Science Department Numerical Analysis, Stanford University, Serra House, Serra Street, 94305, Stanford, CA, USA
Abstract:Davidon has recently introduced a new approach to optimization using the idea of nonlinear scaling. In this paper we study the algorithm that results when applying his ideas to the one-dimensional case. We show that the algorithm is locally convergent withQ-order equal 2 and compare it with the method of cubic interpolation.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号