填充函数法是一种解无约束全局极小化问题的方法。
The filled function method is an approach for solving unconstrained global minimization problem.
研究了用束方法求解非光滑逐点最大凸函数的极小化问题。
In this paper, a bundle method for the minimization of the convex nonsmooth function in point by point maximum is suggested.
给出总体极小化问题的神经网络模型，分析了网络的电路实现。
Neural networks for problems of the global optimization are proposed in this paper and the global convergence of the equilibrium point set is also proven.
应用推荐