摘要
对于不可微的一元目标函数,我们用一维搜索去解决。本文给出了一维搜索中的三个算法:二分法,三等分算法,黄金分割法各自的C语言源程序,从而可以求出目标函数比较精确的近似最优点。
To objective function with one unknown which is not differentiable,we have linear search to solve.This paper gives the programs of C to three algorithms of linear search,so that we will get the objective function’s approximate optimal point which is accurate enough.
出处
《沈阳教育学院学报》
2002年第4期104-106,共3页
Journal of Shenyang College of Education
