無約束極小化 的英文怎麼說

中文拼音 [wúyāoshùjíxiǎohuà]
無約束極小化 英文
unconstrained minimization
  • 無 : 無Ⅰ動詞（沒有） not have; there is not; be without Ⅱ名詞1 （沒有） nothing; nil 2 （姓氏） a surn...
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 極 : i 名詞1 （頂點; 盡頭） the utmost point; extreme 2 （地球的南北兩端; 磁體的兩端; 電源或電器上電流...
  • 小 : Ⅰ形容詞1 （體積、面積、數量、強度等不大） small; little; petty; minor 2 （年紀小的; 年幼的） youn...
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  1. 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

    參數控制演算法雖然與罰函數法非常類似，都是通過求解一系列無約束極小化問題來逼近約束優化問題的最優解，但罰函數法中的罰因子是預先設定的，而參數控制演算法中的參數是自動產生的。
  2. Application of sumt and ga to solving constrained nonlinear programming problem

    序列無約束極小化技術和遺傳演算法在非線性規劃中的應用
  3. On the application of sumt and ga to solving constrained nonlinear programming problem

    序列無約束極小化技術和遺傳演算法在非線性規劃中的應用
  4. It is known that the vip can be reformulated as an unconstrained minimization problem through the d - gap function

    我們知道，通過廣義d -間隙函數，可以將變分不等式問題轉化為一個無約束極小化問題。
  5. There have been many study about the unconstrained equivalent formulation. many algorithms and theories have been constituted about this kind of formulation. but to the constrained equivalent formulation, there is no corresponding algorithm

    無約束極小化變形的研究比較多，已經有了很多種演算法，理論上也相對完備，但對于約束極小化變形，據作者所知，至今還沒見過這方面的演算法。
  6. Chapter 4 studies the techniques for numerical realization of the dual algorithms and generalization of the dual algorithms to general unconstrained nonlinear programming. at first, we construct modified dual algorithms to overcome the drawback that it needs to resolve a sequential unconstrained minimization problems exactly in the step 2 of the dual algorithms in chapter 2 and chapter 3

    首先針對前兩章的對偶演算法由於需要精確求解一系列無約束極小化問題，因而實際計算中很難實現這一缺點，構造修正的對偶演算法，即，關于勢函數的無約束極小化問題無需精確求解的對偶演算法。
  7. By intro - ducing a penalty function as the following, for every e > 0, we construct a sequence of unconstrained minimization problems to approximate the constrained minimization problem. the solutions of such a sequence of unconstrained minimization problems all exist, and they converge to the solution of the constrained minimization problem in a certain sense

    這列無約束極小化問題（ p _ ）的解都是存在的，並且在某種意義下收斂至原始約束極小化問題（ p ）的解，不僅如此，它們的性能指標也收斂至原始問題（ p ）解的性能指標。
  8. In unconstrained optimization, we deal with the standard problem of finding the minimum of a function f : rn - r. if we assume that the function is twice continuously differentiable, many methods can be applied to find the minimum

    在無約束最優化中，考慮尋找f ： r ~ n r的極小點。假設f是二次連續可微的，可以有許多方法尋找它的極小點。
  9. This dissertation studies mainly theories and according numerical implementation of a class of dual algorithms for nonlinear optimization problems, including unconstrained minimax problems and constrained nonlinear programming problems

    本文主要研究非線性優化中的一類對偶演算法，包括無約束極大極小問題的對偶演算法和約束非線性規劃問題的一類對偶演算法的理論與相應的數值實現。
  10. With merit function, the origin problem can be conformed to unconstrained or constrained minimization problems

    利用merit函數的極小化變形可分為無約束和約束兩種類型。
  11. We apply these dual algorithms to solve a large number of nonlinear optimization problems with relative small scale, including inequality constrained optimization problems, unconstrained minimax problems and general constrained optimization problems

    用這些演算法計算大量的規模不是很大的不等式約束優化問題，無約束極大極小問題，一般約束優化問題，數值結果表明它們是有效的
分享友人
分享到 Line

分享到臉書