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）是处理约束优化问题时最常用、也是较为成功的一种方法。