However, since these approaches take no account of complexity control and have no guarantee of global minimum, they often suffer from unstable performance.
但是由于这些方法不考虑复杂度的控制以及不能保证全局最小值,所以它们的性能不稳定。
In most cases, these circuit structures may avoid some local minima and find a global minimum.
许多情况下,该电路可以避免一些局部最小值,而找到一个全局最小值。
But the convergence speed is still slow and the ICP algorithm may not converge to a global minimum.
但ICP配准算法的收敛速度较慢,且不能保证收敛到全局最优点。
This algorithm can not only keep the merits of the original EM, but also facilitate the results converge o the global minimum.
该算法既保持了原EM算法的优点,又有利于训练结果收敛到全局极小。
It is shown that this algorithm ensures convergence to a global minimum with probability 1in a compact region of a weight vector space.
关于算法分析的定理证明了这种混合算法对于紧致集内的权向量构成的任意连续函数能依概率1收敛于全局极小值。
In this paper a global optimization algorithm is proposed for locating global minimum of sum of linear ratios problem (p) with coefficients.
对带系数的线性比式和问题(p)提出一确定性全局优化算法。
Four reasonable geometries on the potential energy hypersurface of glycine and water system are considered with the global minimum being a cyclic double-hydrogen bonded structure.
在这个体系中,我们找到了甘氨酸和水作用的四种稳定构型,其中最稳定的构型是一个环状的双氢键结构。
The algorithm can get global minimum easily with a wide variety of functions of hidden neurons, and no problems such as local minima and slow rate of convergence are suffered like BP algorithm.
新算法选择很广一类的隐层神经元函数,可以直接求得全局最小点,不存在BP算法的局部极小、收敛速度慢等问题。
New optimality conditions of the integral global minimization are applied to characterize global minimum in functional space as a sequence of approximating solutions in finite-dimensional Spaces.
本文用有限维逼近无限维的方法来讨论函数空间中的总体最优化问题。
New optimality conditions of the integral global minimization are applied to characterize global minimum in functional space as a sequence of approximating solutions in finite-dimensional Spaces.
本文用有限维逼近无限维的方法来讨论函数空间中的总体最优化问题。
应用推荐