constrained minimization 中文意思是什麼

constrained minimization 解釋
約束極小化
  • constrained : adj. 被強迫的；受壓制的；不自然的，勉強的。 a constrained manner 不自然的[局促的]樣子。 a constrained smile （勉強做作的）苦笑。adv. -ly
  • minimization : 化為極小值
  1. Abstract firstly, convert a programming problem with multiple constraints into a programming problem with single constraint, secondly, several convexification and concavification transformations for the constrained problem with strictly monotone constraint functions are proposed according to the transformed problem with single constraint, then this constrained programming problem can be converted into a concave minimization or a reverse convex programming problem

    摘要首先將一個具有多個約束的規劃問題轉化為一個只有一個約束的規劃問題，然後通過利用這個單約束的規劃問題，對原來的多約束規劃問題提出了一些凸化、凹化的方法，這樣這些多約束的規劃問題可以被轉化為一些凹規劃、反凸規劃同題。
  2. Constrained minimization problem

    約束最小化問題
  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 ）解的性能指標。
  4. In this chapter, we consider the method of constrained equivalent formulation. we use the merit function based on the restrained ncp function and convert the origin problem ncp ( f ) to minimization problem which constrained on rn +

    我們在這一章里就考慮了ncp （ f ）的約束極小化變形，通過限制的ncp函數來構造ncp問題的merit函數，將原始的問題ncp （ f ）轉化為（
  5. In this article, we consider the methods for solving nonlinear complementarity problems from two aspects : one is the equivalent formulation of minimization, the other is the equivalence formulation of equation. to the former, we give a new derivative - free descent algorithm based on constrained minimization formulation. to the later, we construct a new homotopy equation and give its algorithm

    在本篇論文中，我們從兩個方面考慮非線性互補問題的解決方法，一個是利用原始問題的極小化等價變形，給出了求解約束極小化問題的derivative - free下降演算法；另一個是利用方程形式等價變形，構造了新的同倫方程並給出了相應的演算法。
  6. With merit function, the origin problem can be conformed to unconstrained or constrained minimization problems

    利用merit函數的極小化變形可分為無約束和約束兩種類型。
  7. In this paper, we consider identifications of physical parameters in the following parabolic initial - boundary value problems. the identification problem is formulated as a constrained minimization problem by using the output least squares approach with the h1 - regularization

    作為一個最優控制問題，我們視溫度分佈v為輸出，參數q （ x ）為控制，考慮了一類最優控制問題的逆問題。
  8. A dynamic approach for the minimization subproblem in alm method is discussed, and then a neural network iterative algorithm is proposed for general constrained nonlinear optimization. 3

    使用增廣lagrange乘子法求解時，雖然可以避免罰參數無限增大的弊病，但同時也提出了一個難以求解的子命題。
分享友人
分享到 Line

分享到臉書