unconstrained minimization 中文意思是什麼
unconstrained minimization
解釋
無約束極小化- unconstrained : adj. 1. 不受強制的，自由的。2. 非強迫的，自發的，自動的。3. （態度）不勉強的，從容的。adv. -ly
- minimization : 化為極小值
-
It is known that the vip can be reformulated as an unconstrained minimization problem through the d - gap function
我們知道，通過廣義d -間隙函數，可以將變分不等式問題轉化為一個無約束極小化問題。 -
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
首先針對前兩章的對偶演算法由於需要精確求解一系列無約束極小化問題，因而實際計算中很難實現這一缺點，構造修正的對偶演算法，即，關于勢函數的無約束極小化問題無需精確求解的對偶演算法。 -
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 ）解的性能指標。 -
With merit function, the origin problem can be conformed to unconstrained or constrained minimization problems
利用merit函數的極小化變形可分為無約束和約束兩種類型。 -
We constitute the corresponding derivative - free descent algorithm. after we proved the well - definition and global convergence of our derivative - free descent algorithm, we compare our algorithm with some existent derivative - free descent algorithms based on unconstrained minimization formulation
在證明了所構造的derivative - free演算法的合理性以及整體收斂性之後，我們將所構造的演算法與以前已經存在的無約束型的derivative - free演算法進行了比較。
分享友人