unconstrained minimization
基本解释
- [數] 無約束極小化
英汉例句
- It is known that the VIP can be reformulated as an unconstrained minimization problem through the D-gap function.
我們知道,通過廣義D-間隙函數,可以將變分不等式問題轉化爲一個無約束極小化問題。 - Being away from the searching point by point, this method is simpler and clearer than the ordinary mathematical programming method such as the sequential unconstrained minimization techique(SUMT).
本法避免了逐 點搜索,較之一般的數學槼劃方法如序列無約束最小化方法(SUMT法),更爲簡便與直觀。
http://dj.iciba.com - Sequential Unconstrained Minimization Techniques (SUMT) are most common and comparatively successful method in constrained optimization.
罸函數法(SUMT)是処理約束優化問題時最常用、也是較爲成功的一種方法。
雙語例句
词组短语
- unconstrained via minimization 無約束通孔優化
- nonlinear unconstrained minimization 非線性無約束極小化
- sequential unconstrained minimization problems 序列無約束極小化
- unconstrained minimization problems 無約束極小化問題
- unconstrained minimization problem 無約束極小化問題
短語
专业释义
- 無約束極小化
- 無約束最小化