您要查找的是不是：
- By means of the penalty function method and the project variable metric algorithm, we obtain a revised method with its global convergence and superlinear convergence rate. 利用罰函數和投影變尺度方法，得到了一個(gè)修正的算法及其全局收斂與超線(xiàn)性收斂率。
- Penalty function is introduced in the adaptive value function to speed up the convergence of the algorithm and ensure that the assignment reduction includes fewer attributes with stronger support. 在交叉規則中，采用了單點(diǎn)交叉，最大迭代代數被作為停止準則，算法獲得較佳的搜索效果。
- It can speed the local rate of convergence and improve the accuracy of solution, and to solve nonlinear constraint optimization problems, COA was combined with exact non-differentiable penalty function. 它利用混沌變量的特定內在隨機性和遍歷性跳出局部最優(yōu)點(diǎn)，并在局部搜索空間經(jīng)過(guò)線(xiàn)性搜索提高解的搜索速度和精度，通過(guò)結合精確不可微罰函數以用于求解非線(xiàn)性約束優(yōu)化問(wèn)題。
- The frequency constraint and other constraints are separately treated with the combined penalty function strategy in order to satisfy all constraint conditions and improve the convergence rate of PSO. 采用混合罰函數法分開(kāi)處理結構固有頻率約束和其他約束條件，既保證所有約束能夠嚴格滿(mǎn)足，又提高了微粒群算法的收斂速度。
- Finally, this algorithm is applied to some test problems and it has the better results than using the penalty function algorithm. 最后，本算法應用于幾個(gè)典型例題，并與罰函數法相比較，數值結果表明該算法是可行的，有效的。
- In this paper, we try to apply Binary System Particle Swarm Optimization (BSPSO) with death Penalty function to solve 0/1 knapsack problem. 摘要將帶有死亡罰函數的二進(jìn)制粒子群優(yōu)化算法應用于0/1背包問(wèn)題。
- Penalty function method for solving constrained (minimum) optimization problem of a class of better algorithms. 罰函數方法是求解約束（極?。﹥?yōu)化問(wèn)題的一類(lèi)較好的算法。
- Furthermore.The theory about penalty function method of bilevel multiobjective programming is established. 在單層化的基礎上，建立了兩層多目標規劃的罰函數理論。
- Firstly, we can convert the constraint LMIP into unconstraint one by using the penalty function. 通過(guò)構造一種罰函數化有約束的LMIP為無(wú)約束或簡(jiǎn)單約束的LMIP。
- In the Genetic Algorithm, penalty function is often used to deal with constrains. 摘要在遺傳算法中，約束的處理一般采用罰函數法。
- Combined with exact non-differentiable penalty function, a new chaos genetic optimization algorithm is presented. 并結合精確不可微罰函數求解非線(xiàn)性約束優(yōu)化問(wèn)題，提出了求解此類(lèi)問(wèn)題的混沌遺傳算法。
- Lastly, PWL predictive control which uses the upper bound of optimal control as penalty function under certain conditions is proved to be stable. 最后證明了在一定條件下將最優(yōu)控制的上限作為PWL系統預測控制的最終懲罰項可使預測控制算法保持穩定。
- This thesis analyses thecommon penalty function method and modified coulomb friction model used for contactanalysis in sheet metal forming simulation. 分析了常用的罰函數法接觸算法和用于板料成形數值模擬的修正庫侖摩擦模型。
- Through multiple generation calculation, the minimum point of penalty function value was obtained, then the optimalc reduction distribution was found. 通過(guò)粒子群多代運算，求出罰函數值最小點(diǎn)，得到壓下負荷最佳分配點(diǎn)。
- By introducing penalty function terms,the problems,which would arise in the case of pure Lagrange multiplier method or penalty function method. 通過(guò)附加懲罰函數項，克服了單純使用拉格朗日乘子法或懲罰函數法時(shí)存在的問(wèn)題。
- And the model about the PM's direct kinematics is rebuilt with the exterior point penalty function method so as to adapt to the PSO. 同時(shí)結合外點(diǎn)罰函數法,對并聯(lián)機器人運動(dòng)學(xué)正解問(wèn)題重新進(jìn)行建模,以便于使用粒子群算法進(jìn)行求解。
- Penalty function based method is a very effective method to estimate the number of sinusoid in presence of additive noise. 摘要在加性噪聲情形下，懲罰函數方法是一種簡(jiǎn)潔有效的諧波信號個(gè)數估計方法。
- By means of the SUMT method, the optimal problem with the control constrains is converted to a minimum value problem of penalty function with no constraint. 采用SUMT算法，將有控制約束的最優(yōu)化問(wèn)題轉化為求罰函數的無(wú)約束極小值問(wèn)題。
- There are many classical solution methods for bilevel programming such as culmination searching algorithm,branch and bound algorithm and penalty function algorithm. 對于二層規劃問(wèn)題有許多經(jīng)典的求解方法,如極點(diǎn)搜索法、分支定界法和罰函數法等。
- In this model,the authors established the integro-differential equation for the expected discounted penalty function at ruin in the case of constant force of interest. 就利息力為常數的情形,給出該模型下破產(chǎn)時(shí)刻罰金折現期望滿(mǎn)足的積分-微分方程。
