无约束极小化 meaning in Chinese
unconstrained minimization
Examples
- Application of sumt and ga to solving constrained nonlinear programming problem
序列无约束极小化技术和遗传算法在非线性规划中的应用 - On the application of sumt and ga to solving constrained nonlinear programming problem
序列无约束极小化技术和遗传算法在非线性规划中的应用 - It is known that the vip can be reformulated as an unconstrained minimization problem through the d - gap function
我们知道，通过广义d -间隙函数，可以将变分不等式问题转化为一个无约束极小化问题。 - There have been many study about the unconstrained equivalent formulation . many algorithms and theories have been constituted about this kind of formulation . but to the constrained equivalent formulation , there is no corresponding algorithm
无约束极小化变形的研究比较多，已经有了很多种算法，理论上也相对完备，但对于约束极小化变形，据作者所知，至今还没见过这方面的算法。 - Chapter 4 studies the techniques for numerical realization of the dual algorithms and generalization of the dual algorithms to general unconstrained nonlinear programming . at first , we construct modified dual algorithms to overcome the drawback that it needs to resolve a sequential unconstrained minimization problems exactly in the step 2 of the dual algorithms in chapter 2 and chapter 3
首先针对前两章的对偶算法由于需要精确求解一系列无约束极小化问题，因而实际计算中很难实现这一缺点，构造修正的对偶算法，即，关于势函数的无约束极小化问题无需精确求解的对偶算法。