基于盲人探路尋優(yōu)思想的二階近似式定點(diǎn)法研究
發(fā)布時(shí)間:2019-01-08 20:46
【摘要】:分析一維和多維二階近似式定點(diǎn)法的迭代點(diǎn)計(jì)算公式,提出基于盲人探路尋優(yōu)思想的改進(jìn)算法,給出算法步驟、程序流程圖及計(jì)算機(jī)子程序。對(duì)于目標(biāo)函數(shù)為二次函數(shù)正弦的算例,極值點(diǎn)基本上在由當(dāng)前點(diǎn)指向極值點(diǎn)的方向上。對(duì)于目標(biāo)函數(shù)為二次函數(shù)八分之一次方的算例,極值點(diǎn)在該方向上,且須反向?qū)ふ易顑?yōu)點(diǎn)。對(duì)于目標(biāo)函數(shù)為二次函數(shù)四次方的算例,第一個(gè)點(diǎn)的迭代點(diǎn)指向極值點(diǎn),且步長(zhǎng)為當(dāng)前點(diǎn)離極值點(diǎn)距離的整數(shù)分之一。結(jié)果表明,提出的基于盲人探路尋優(yōu)思想的優(yōu)化算法具有實(shí)用性強(qiáng)、計(jì)算量小的優(yōu)點(diǎn)。
[Abstract]:This paper analyzes the iterative point calculation formula of one-dimensional and multi-dimensional second-order approximate fixed-point method, puts forward an improved algorithm based on the idea of blind search, and gives the steps of the algorithm, the program flow chart and the computer subroutine. For an example where the objective function is a sinusoidal quadratic function, the extreme point is basically in the direction from the current point to the extreme point. For an example where the objective function is a quadratic function to the power of 1/8, the extremum is in this direction and the best point must be found in reverse. For an example where the objective function is a quadratic function to the fourth power, the iteration point of the first point points to the extremum point, and the step size is one integral part of the distance between the current point and the extremum point. The results show that the proposed optimization algorithm based on the idea of blind road finding has the advantages of strong practicability and low computational cost.
【作者單位】: 中國(guó)石油大學(xué)勝利學(xué)院;東營(yíng)市勝利第二中學(xué);東營(yíng)市勝利第一中學(xué);
【基金】:山東省自然科學(xué)基金項(xiàng)目(Q2006A08) 中國(guó)石油大學(xué)勝利學(xué)院科技計(jì)劃項(xiàng)目(KY2015025)
【分類(lèi)號(hào)】:O224
本文編號(hào):2405099
[Abstract]:This paper analyzes the iterative point calculation formula of one-dimensional and multi-dimensional second-order approximate fixed-point method, puts forward an improved algorithm based on the idea of blind search, and gives the steps of the algorithm, the program flow chart and the computer subroutine. For an example where the objective function is a sinusoidal quadratic function, the extreme point is basically in the direction from the current point to the extreme point. For an example where the objective function is a quadratic function to the power of 1/8, the extremum is in this direction and the best point must be found in reverse. For an example where the objective function is a quadratic function to the fourth power, the iteration point of the first point points to the extremum point, and the step size is one integral part of the distance between the current point and the extremum point. The results show that the proposed optimization algorithm based on the idea of blind road finding has the advantages of strong practicability and low computational cost.
【作者單位】: 中國(guó)石油大學(xué)勝利學(xué)院;東營(yíng)市勝利第二中學(xué);東營(yíng)市勝利第一中學(xué);
【基金】:山東省自然科學(xué)基金項(xiàng)目(Q2006A08) 中國(guó)石油大學(xué)勝利學(xué)院科技計(jì)劃項(xiàng)目(KY2015025)
【分類(lèi)號(hào)】:O224
【相似文獻(xiàn)】
相關(guān)期刊論文 前3條
1 蔡偉琦;黃朝紅;許惠英;蔡志平;黃嘉福;;級(jí)聯(lián)拉曼激光器的二階近似解[J];中國(guó)激光;2008年10期
2 鞠晶;趙建東;;多分子生化反應(yīng)模型在正平衡點(diǎn)的二階近似攝動(dòng)解[J];數(shù)學(xué)的實(shí)踐與認(rèn)識(shí);2009年24期
3 ;[J];;年期
相關(guān)博士學(xué)位論文 前1條
1 麻凱;結(jié)構(gòu)區(qū)間參數(shù)的二階近似動(dòng)態(tài)優(yōu)化方法[D];吉林大學(xué);2007年
,本文編號(hào):2405099
本文鏈接:http://sikaile.net/kejilunwen/yysx/2405099.html
最近更新
教材專(zhuān)著