经典LBG算法的局部极小值问题是制约其性能的重要因素。
The local minimum problem is a much important factor which restricts the performance of the classic LBG algorithm.
通过多次选择初始变换的搜索策略，解决了搜索过程中出现的局部极小值问题。
Depending on the strategy of choosing initial transformations many a time, the local minimum problem in process of iterative detection have been solved.
对于传统BP算法存在的收敛速度慢和易陷入局部极小值问题，人们提出了径向基函数网络。
People put forward radial basis function networks considering the conventional BP algorithm problems of slow convergence speed and easily getting into local dinky value.
另外，R BF神经网络是一种局部逼近网络，问题有唯一确定的解，不存在BP网中所遇到的局部极小值问题。
The RBF nerve network is one kind partial approaches network and the question has the only determination solution, moreover, the BP net often meets the partial minimum problem.
通过以一个极小值问题来描述反转过程，针对基于实例的皮肤变形方案，本文提出了一个可以整合形状插值的统一模型。
Describing the inverse as a minimum problem, in view of a example-based skin deformation plan, we have proposed a unified model that incorporating the shape interpolation.
在培训过程中采用培训时间控制策略和再学习策略，有效地防止了培训过度，可作为解决局部极小值问题的一种实用措施。
Strategy of limited training time and learning again prevent the network from over-training, and from being lost in local minimum.
基于敏感性分析的基本原理，将施工控制目标转化为有约束的极小值问题，推导了结构设计参数对控制目标的敏感因子计算公式。
Based on the theory of sensitivity analysis, the problem of construction control was translated into a minimum problem with restraints, and the expression for sensitivity index was denied.
本文分析了传统的人工势场法由于局部最小问题而导致规划失败的原因，对可能产生局部极小值区域的障碍物外部几何形状进行分析。
Analysis of the traditional artificial potential field failed in path planning due to the local minimum and the possible local minimum area of the external obstacles on the geometry.
采用段法(区域法)求解正问题，反演中采用求目标函数极小值的共轭梯度法。
The energy equation is solved by the zonal method, and the inverse radiation problem is solved through the minimization of performance function with the conjugated gradient method.
从本质上讲，无功优化调度问题是具有大量的局部极小值的多约束全局优化问题，且含有大量的离散变量。
Essentially, optimal reactive power dispatch is the multi-restraint overall optimization problem with plentiful local minima and discrete variables.
并对禁忌公式进行了修改，使其不仅可以解决极小值最优问题，而且可以解决极大值最优问题。
And carried on a modification to Tabu Search's formula, make it can solve the problems both the minimum optimal and the maximum optimal.
该类算法的基本思想是通过求解一系列二次函数在信赖域中的极小值点逼近最优化问题的解。
The basic idea of these methods is to approximate the optimization problem by a sequence of quadratic minimization problems subject to some trust region.
该类算法的基本思想是通过求解一系列二次函数在信赖域中的极小值点逼近最优化问题的解。
The basic idea of these methods is to approximate the optimization problem by a sequence of quadratic minimization problems subject to some trust region.
应用推荐