| 无约束非线性优化问题的算法比较 |
| |
| 引用本文： | 吴睿.无约束非线性优化问题的算法比较[J].衡水学院学报,2011,13(4):19-21. |
| |
| 作者姓名： | 吴睿 |
| |
| 作者单位： | 西安欧亚学院基础部,陕西西安,710065 |
| |
| 基金项目： | 西安欧亚学院院级课题(ZKB-10-02) |
| |
| 摘 要： | 详细论述了目前利用一维搜索来解决无约束非线性优化问题的几个主要算法,包括:0.618法、Fibonacci法、牛顿法和三次插值法.通过数值试验验证了这5种算法存在的优缺点,并指出了它们收敛速度快慢的原因.
|
| 关 键 词： | 非线性规划 一维搜索 收敛性 |
Comparison of Algorithms for the Unconstrained Nonlinear Uptimization Question |
| |
| WU Rui.Comparison of Algorithms for the Unconstrained Nonlinear Uptimization Question[J].Journal of Hengshui University,2011,13(4):19-21. |
| |
| Authors: | WU Rui |
| |
| Institution: | WU Rui (Department of Basic Courses,Xi'an Eurasia University,Xi'an,Shanxi 710065,China) |
| |
| Abstract: | 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 existence of the advantages and disadvantages of the four algorithms,and points out the reasons for their speed of convergence. |
| |
| Keywords: | nonlinear programming one dimensional search convergence |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
