罰函數法 的英文怎麼說

中文拼音 [fáhánshǔfǎ]
罰函數法 英文
penalty function method
  • 罰 : Ⅰ動詞[書面語] （處罰） punish; penalize; fine; forfeit Ⅱ名詞（處罰） punishment; penalty
  • 函 : 名詞1. [書面語] （匣; 封套） case; envelope 2. （信件） letter 3. （姓氏） a surname
  • 數 : 數副詞（屢次） frequently; repeatedly
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 函數 : [數學] function函數計算機 function computer; 函數計算器 function calculator; 函數運算 functional operation
  1. On the basis of analyzing limitation of using penalty function method dealing with constraints, an amending method based on the knowlege regulating strategy is suggested to amende the mapping relationship of infeasible constraints in decoding, thus making the regulated individuals map into the space to obtain the most promising optimal solution

    在分析懲罰函數法對約束處理效率較低的情況下，提出了一種基於知識調整策略的修正法，對解碼中不滿足約束的映射關系進行修正，使調整后個體映射到最有希望獲得最優解的空間中。
  2. Penalty function for the nonlinear complementarity problem

    非線性互補問題的罰函數法
  3. 3 ) improving the method of penalty function inosculating with simulated annealing. delivery is very important in logistics system

    3 ）融入模擬退火演算法降溫處理的知識，對約束條件處理的罰函數法進行了改進。
  4. The method of wing shape optimization of space shutlle has been developed with penalty function approach in which the objective function is the mass of the wing and the constraints are the hypersonic re - entry flight cross range, lift / drag ratio, and subsonic flight lift / drag ratio, the margin of the longitudial static stability and the magnitude of the horizontal landing speed etc

    摘要介紹了在滿足高超音速再入橫向機動航程，高超音速再入飛行時的升阻比，亞音速進場飛行時的升阻比，縱向靜穩定性裕度和水平著陸速度等飛行性能設計要求下，用罰函數法尋求使航天飛機機翼質量為最小的外形優化方法並給出了算例。
  5. The parameter control methods are very similar to penalty function methods, both of them are to solve constrained optimization problems by solving a series of sub - unconstrained optimization problems. but parameter control methods are different from penalty function methods. firstly, the penalty coefficient of penalty function methods are preassigned, while the parameters of parameter control methodsare generated automatically according to some rule prescribed

    參數控制演算法雖然與罰函數法非常類似，都是通過求解一系列無約束極小化問題來逼近約束優化問題的最優解，但罰函數法中的罰因子是預先設定的，而參數控制演算法中的參數是自動產生的。
  6. Optimal design with three variables is then done to the elbow - bar mechanism of the mp1040b moulding machine by utilizing the method of punishing function for constraint problems and variational scale for unconstraint problems. the optimal target function is the maxium of gradient in one work travel for the moulding plank of the elbow - bar mechanism. the result shows that the maximal gradient of moulding plank in one motion period declines by 25. 7 after optimization, and the angular acceleration of the bottom moulding plank decreases greatly

    動力學分析中，各構件的質量和轉動慣量是通過pro / engineer軟體，先建立各個構件幾何模型而求得；然後，利用解決約束問題的罰函數法和處理無約束問題的變尺度法對mp1040b型模切機肘桿機構進行三個設計變量的優化設計，優化目標函數為肘桿機構的下模切板在一個工作行程中達到的最大傾斜程度；通過優化設計，模切機肘桿機構的下模切板在一個工作行程中的最大傾斜程度降低了25 . 7 ，其角加速度明顯減小，提高了模切機動力學性能。
  7. First, the nonlinear ls problem without constraint is converted to that subjected to inequality constraints by putting constraints on the do as of the received signals and toas of the first arrived signal with geometrically based single - bounce ( gbsb ) statistical channel model and cost - 207 model. then, a penalty function is used in the estimation of ms position

    首先，用基於幾何結構的單次反射圓模型和cost - 207模型，對期望定位用戶的各條多徑信號的波達方向和最先到達多徑信號的時間進行約束，將傳統的解無約束的非線性最小二乘定位問題或近似線性最小二乘定位問題轉化為解不等式約束的非線性最小二乘定位問題；然後，用內點罰函數法估計移動臺的位置。
  8. It is based on mpf, which treats inequality constraints with a modified penalty term. the mpf method alternatively minimizes the mpf and updates the lagrange multipliers. the mpf method avoids the in - differentiability of the max { x, 0 }

    修改的罰函數法所用的罰函數消除了經典罰函數的主要缺點，修改的罰函數存在解，且在解的鄰域內保持目標函數和約束函數的光滑性。
  9. In the fourth chapter, several methods for handling constrains by genetic algorithms for nonlinear programming problems are introduced. these methods were grouped into four categories : methods based on preserving feasibility of solutions, methods based on penalty functions, methods which make a clear distinction between feasible and infeasible solutions and other hybrid methods

    在第四章中介紹了處理約束的四類方法：運算元修正法，罰函數法，可行域搜索法，以及混合遺傳演算法，並對這些方法做了詳細的分析，指出了他們優劣之處。
  10. Monte - carlo method for calculating multiple integral and its optimized method

    應用內外混合罰函數法
  11. Based on the genetic algorithm ' s global searching capability with probability regulation and euclid ' s space distance metric to settle multi - objective, the algorithm that integrates multi - objective ' s decision - making into the modified genetic algorithm to solute the optimal model with discrete variables and multi - objective is proposed. during the algorithm ' s design, the euclid ' s space distance metric is proposed to transform the multi - objective problem into single objective problem. and some modified measure to fitness function and crossover probability and mutation probability are used to improve the performance of the algorithm and avoid premature convergence

    演算法設計過程中，利用歐幾里德空間距離準則和罰函數法，將含有約束條件的多目標規劃問題轉化為無約束的單目標優化問題；針對簡單遺傳演算法出現的早熟，構造隨進化代數動態調整適應度的適應度函數和隨個體適應度自適應調整的交叉、變異概率；提出比例選擇與精英保留策略相結合的選擇、兩點交叉和簡單變異的改進遺傳演算法。
  12. The collision is considered in the solution, so that the manipulator based on this solution method can move more flexible

    同時在求解的過程中利用罰函數法，對逆解過程進行避碰優化，使得基於該逆解方法的機械手運動控制更具靈活性。
  13. Based on the variational characteristic of eigenvalue, the neural network solving method of other eigenvalues based on penalty function method was presented

    從特徵值的變分特性出發，給出了基於罰函數法的其他特徵值的神經網路求解方案。
  14. In this method, penalty functions were used as constraints, and each particle was used to represent a group of rules set to describe concrete batching planning

    在該方法中，採用罰函數法處理約束條件，每個粒子都代表一組可用於描述具體批量計劃方案的規則組合。
  15. There are considerable numbers of research concerning finite element method on contact problem and a lot of techniques such as mathematics programming, penalty method and so on

    針對于接觸問題的求解，目前已經發展了很多計算方法，如數學規劃法、罰函數法等。
  16. It confirms the movement equation of particle and adopts death penalty function to deal with all constraint term, and provides with the step of algorithms to solve 0 / 1 knapsack problem

    確定了該演算法中粒子的運動方程，採用死亡罰函數法處理了約束條件，給出了該演算法求解0 / 1背包問題的實現步驟，並對實驗數據進行了測試。
  17. We present and analyze a modified penalty functions ( mpf ) method for solving constrained optimization problems with inequality constraints. this method combines the modified penalty and the lagrangian methods

    本文提出並分析一種解決不等式約束最優化問題的修改的罰函數法，這一方法綜合利用修改的罰函數和拉格朗日法。
  18. Secondly, the penalty coefficient may converge to infinity in many situations when the iterative point is closely near the bound of feasible set, while the parameters are bounded if the solution set of constrained optimization is nonempty, which is available for numerical computation

    另外在很多情況下，罰函數法中的罰因子當迭代點接近可行域邊界時趨于無窮大，而參數控制演算法中，只要約束優化問題有最優解，則參數是有界的，這對數值計算是有利的。
  19. Using method of sumt and powell, the thesis carries out optimization design for air rocket with double - push accelerated velocity and spin - rate regularity, which dramatically decreases air rocket dispersion. in the end, some valuable conclusions are achieved for application

    綜合利用雙推力加速度，轉速規律，同時採用內點罰函數法和powell共軛方向法，對航空火箭彈的主要參數進行優化設計，實現了大幅度減小航空火箭彈散布的目的，得到了一些有應用價值的結論。
  20. This paper proposes the array chain chromosome coding and the adaptive ga ( aga ) that combines the self - adaptive mutation probability and simulation anneal punishment function

    提出了數組鏈染色體編碼方式，以及基於自適應性變異概率和模擬退火懲罰函數法的適應性遺傳演算法（ aga ） 。
分享友人
分享到 Line

分享到臉書