unconstrained minimization

基本解釋

It is known that the VIP can be reformulated as an unconstrained minimization problem through the D-gap function.
我們知道，通過廣義D-間隙函數(shù)，可以將變分不等式問題轉(zhuǎn)化爲(wèi)一個(gè)無約束極小化問題。
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é)槼劃方法如序列無約束最小化方法（SUMT法），更爲(wèi)簡(jiǎn)便與直觀。
http://dj.iciba.com
Sequential Unconstrained Minimization Techniques (SUMT) are most common and comparatively successful method in constrained optimization.
罸函數(shù)法（SUMT）是処理約束優(yōu)化問題時(shí)最常用、也是較爲(wèi)成功的一種方法。