| 一个凸函数曲线极值初始区间的搜索算法及其在优化中的应用 |
| |
| 引用本文： | 谭建荣,宗晔.一个凸函数曲线极值初始区间的搜索算法及其在优化中的应用[J].浙江大学学报(自然科学版 ),1993(6). |
| |
| 作者姓名： | 谭建荣 宗晔 |
| |
| 作者单位： | 浙江大学CAD＆CG国家重点实验室、设备处
(谭建荣)，浙江大学CAD＆CG国家重点实验室、设备处(宗晔) |
| |
| 摘 要： | 本文从剖析优化方法中传统进退法的缺点着手,提出了一个凸函数曲线极值初始区间的搜索算法,在优化方法中确定初始区间时,利用凸函数曲线的割线斜率和函数值本身信息来构造搜索步长,经几个不同算法运行结果对照表明,改进以后的方法比传统的进退法在运行时间、调用函数次数、初始区间的长度等方面都具有明显的优越性。
|
| 关 键 词： | 凸函数曲线 优化方法 一维搜索 初始区间 |
A searching algorithm for the minimal value of convex functional curves and its applications in optimization |
| |
| Tan Jianrong Zong Ye.A searching algorithm for the minimal value of convex functional curves and its applications in optimization[J].Journal of Zhejiang University(Engineering Science),1993(6). |
| |
| Authors: | Tan Jianrong Zong Ye |
| |
| Affiliation: | State Key Lab. of CAD & CG |
| |
| Abstract: | In this paper, we analysed the traditional algorithm tor finding initial area in optimization method. On this basis, we presented a searching algorithm for the minimal value of convexfunctional curves and made use of slope of secatan of convex functional curves to constructstep length in one-dimensional search. By a series of tests and applications, it indicated that improved algorithm has avdentages over traditional algorithms in runing time, calling functional times and the length of initial area. |
| |
| Keywords: | convex functional curves optimization method one-dimensional search Initial area |
| 本文献已被 CNKI 等数据库收录！ |
