penalty function algorithm 中文意思是什麼

penalty function algorithm 解釋
罰函數演算法
  • penalty : n. 1. 刑罰，懲罰。2. 罰款；違約罰金。3. 報應。4. 【牌戲】罰點；【體育】（犯規）處罰。5. （行為等造成的）困難、障礙、不利後果 （＝handicap）。
  • function : n 1 功能，官能，機能，作用。2 〈常 pl 〉職務，職責。3 慶祝儀式；（盛大的）集會，宴會。4 【數學】...
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. It is proven that these modified dual algorithms still have the same convergence results as those of the conceptional dual algorithms in chapter 2 and chapter 3. secondly, a dual algorithm is constructed for general constrained nonlinear programming problems and the local convergence theorem is established accordingly. the condition number of modified lagrange function ' s hessian is estimated, which also depends on the penalty parameter

    證明這些修正的對偶演算法仍具有同前兩章的概念性對偶演算法相同的收斂性結果，我們還進一步構造了一般約束非線性規劃問題的對偶演算法，建立了相應的局部收斂理論，最後估計了修正lagrange函數的hesse陣的條件數，它同樣依賴于罰參數。
  2. A dynamical system is built which is satisfied to lyapunov function whose energy function is penalty function in augmented lagrange multiplier method. the dynamical system is global stable, and its stable solution is the optimization solution of sub - problem in augmented lagrange multiplier method according to lasalle invariance principle. finally a complete optimization algorithm is developed

    針對這種工業過程，本文基於一個lqr的性能指標（本性能指標和衰減系數和自然頻率密切相關） ，提出應用本文提出的mmlaax優化演算法，對不確定工業過程進行魯棒pto控制器的設計，取得令人滿意的效果。
  3. Genetic algorithm with fuzzy penalty function and its application in curve smoothing

    模糊罰函數遺傳演算法及其在曲線光順中的應用
  4. Non - parameter penalty function multi - objective orthogonal genetic algorithm for nonlinear programming problem

    解非線性規劃問題的非參數罰函數多目標正交遺傳演算法
  5. Details are as follows : we deal with properties of bilevel linear programming and prove the equivalence of bilevel linear programming and optimization over the efficient set. a class of multi - objective tow level programming, i. e. the upper - level is single objective and the lower - level is linear multi - objective, is mainly discussed. it can be converted into the optimization over the efficient set with parameter and an algorithm is given with its finite termination being proved ; when the upper - level is linear function, an exact penalty function algorithm is given

    分層（分級）遞階系統是社會組織管理的主要形式，多層規劃是研究這類系統優化問題的基本模型，其鮮明的實際背景和廣泛的應用前景引起了人們的廣泛關注，成為一個新興的活躍的研究領域，本論文研究了二層規劃中的若干問題，主要工作如下：討論了二層線性規劃的性質，並證明了它與零有效集上優化問題的等價性；對一類二層多目標規劃（上層為單目標規劃、下層為線性多目標規劃的問題）進行了探討，將其轉化為含參變量的有效集上的優化問題，進而給出了一種演算法，並證明了該演算法的有限終止性；當上層為線性單目標時，給出了一種罰函數方法
  6. In this paper, an optimal model for arrangement is designed, which is with multi - objective function and nonlinear constraints, and an improved genetic algorithm with penalty strategy is proposed to solve the optimization problem

    本文建立生料漿調配過程的優化模型，針對模型中的多目標函數以及非線性約束特點，提出一種結合懲罰策略的改進遺傳演算法進行尋優。
  7. The paper exploits then method of combining the simulated annealing algorithm with genetic algorithm for the question and designs the coding way which based on ordinal characters, builds up fitness function on the basis of penalty function, adopts the basal technology, such as crossover, mutation etc. to deal with the model and put forward adjustable algorithms for trains occupying time sets

    將模擬退火演算法和演化演算法混合起來運用於該問題，設計有序的字元串編碼方法，構造了基於罰函數的適應度函數，採用交叉和變異等技術，求解該模型。並提出了車列佔用時區調整的相關演算法。
  8. Finally, this algorithm is applied to some test problems and it has the better results than using the penalty function algorithm

    最後，本演算法應用於幾個典型例題，並與罰函數法相比較，數值結果表明該演算法是可行的，有效的。
  9. Chapter 3 is devoted to the study of the convergence theory of a dual algorithm for unconstrained minimax problems. a dual algorithm for solving unconstrained minimax problems, based on the penalty function of bertsekas ( 1982 ), is presented. we prove that there exits a threshold of the penalty parameter satisfying that the sequences generated by the dual algorithm converge locally to the kuhn - tuker point of the unconstrained minimax problems when the penalty parameter is less than the threshold

    第3章給出無約束極大極小問題的一個對偶演算法的收斂理論，給出一個基於bertsekas （ 1982 ）罰函數的求解無約束極大極小問題的對偶演算法，證明罰參數存在一個閥值，當罰參數小於這一閥值時，該對偶演算法產生的序列局部收斂到問題的kuhn - tuker點，並建立了參數解的誤差估計式，同樣估計了罰函數的hesse陣的條件數，它也依賴于罰參數。
  10. According to the internal character of price control problem, the authors use the related results of exact penalty function and equilibrium complementarities to transform the price control problem with hi - level special property into equivalent single level mathematical program that consists of equality and inequality constraints, consequently, to offer some basis for optimality condition arid algorithm of this problem

    摘要針對價格控制問題具有的內在特點，利用均衡互補及精確罰函數的相關理論，把具有二層特性的價格控制問題轉化為與其等價的具有等式和不等式約束的單層數學規劃，從而為研究此類問題的最優性條件和求解演算法提供一定的依據。
  11. 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

    在交叉規則中，採用了單點交叉，最大迭代代數被作為停止準則，演算法獲得較佳的搜索效果。
  12. We analyze such methods in detail and designed a new penalty function, experiment result proved that the genetic algorithm used such penalty function can get better quality of the solution in solving nonlinear programming problems

    在這里我們還提出了一種新的罰函數。將運用這種罰函數的遺傳演算法用於優化非線性約束函數，能夠有效的提高解的質量。
分享友人
分享到 Line

分享到臉書