基本解釋[數(shù)] 無(wú)約束極小化英漢例句雙語(yǔ)例句It is known that the VIP can be reformulated as an unconstrained minimization problem through the D-gap function.我們知道，通過(guò)廣義D-間隙函數(shù)，可以將變分不等式問(wèn)題轉(zhuǎn)化爲(wèi)一個(gè)無(wú)約束極小化問(wèn)題。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).本法避免了逐 點(diǎn)搜索，較之一般的數(shù)學(xué)槼劃方法如序列無(wú)約束最小化方法（SUMT法），更爲(wèi)簡(jiǎn)便與直觀。http://dj.iciba.comSequential Unconstrained Minimization Techniques (SUMT) are most common and comparatively successful method in constrained optimization.罸函數(shù)法（SUMT）是処理約束優(yōu)化問(wèn)題時(shí)最常用、也是較爲(wèi)成功的一種方法。unconstrained minimization更多例句詞組短語(yǔ)短語(yǔ)unconstrained via minimization 無(wú)約束通孔優(yōu)化nonlinear unconstrained minimization 非線性無(wú)約束極小化sequential unconstrained minimization problems 序列無(wú)約束極小化unconstrained minimization problems 無(wú)約束極小化問(wèn)題unconstrained minimization problem 無(wú)約束極小化問(wèn)題unconstrained minimization更多詞組專業(yè)釋義數(shù)學(xué)無(wú)約束極小化計(jì)算機(jī)科學(xué)技術(shù)無(wú)約束最小化