For function optimization problems, according to the nature of the objective function domain, can be divided into discrete function optimization and continuous function optimization.
基于1个网页-相关网页
For function optimization problems, according to the nature of the objective function domain, can be divided into discrete function optimization and continuous function optimization.
对于函数优化这个问题，根据目标函数定义域的性质，可以分为离散函数最优化和连续函数最优化。
Then, we consider a new filled function method with parameter free for solving general global optimization problems.
然后，对于一般结构的全局优化问题，我们给出了一个新的无参数的填充函数方法。
In this paper, a filled function method for solving global optimization problems with inequality and equality constraints is proposed.
提出了一种解决含有等式约束及不等式约束的全局优化问题的填充函数方法。
应用推荐