无约束非线性优化问题的算法比较

摘要

This paper discusses the current use of one-dimensional search to solve the problem of unconstrained nonlinear optimization algorithm for several major algorithms,including： 0.618,Fibonacci,Newton,Cubic interpolation.Numerical experiments verify the exist%详细论述了目前利用一维搜索来解决无约束非线性优化问题的几个主要算法,包括：0.618法、Fibonacci法、牛顿法和三次插值法.通过数值试验验证了这5种算法存在的优缺点,并指出了它们收敛速度快慢的原因.