松弛算法 meaning in English
relaxation algorithm
Examples
- The fbc for connecting the subdomains on fictitious boundary is developed according to the actual field distribution in the waveguide to ensure the propagation of waves between adjacent subdomains . the relaxed algorithm is introduced to improve the iterative convergence
文中从实际场分布出发，在划分区域的虚拟边界上给出了连接子域的吸收虚拟边界条件，并通过引入松弛算法，构建了一种能够用于分析波导问题的松弛迭代区域分解法。 - Abstract : in this paper , we propose an improved lagrangian relaxation algorithm to solve job - shop scheduling problems . besides the addition of augmented objective , we expand the search scope of near - optimal solutions and improve the computational efficiency greatly by restricting the solution scope of sub - problems and modifying the search method of dual problem . at the same time , we develop a genetic algorithm combining with the lr ( lagrangian relaxation ) method . using the numerous useful solutions we get in the lagrangian relaxation as the original genes , we can improve the solution further . test results show that these methods achieve satisfied outcome for job - shop problems . they can also be applyed to other programming problems with constraints
文摘:针对车间调度问题，提出了一种改进的拉氏松弛算法.在增加辅助目标函数的基础上，通过对子问题的限制和搜索策略的改变，使拉氏算法的计算量减少，近优解的搜索能力有很大改善.本文还提出了一种基因优化算法，充分利用拉氏算法得到的多个近优解，进一步优化结果.仿真结果表明对车间调度问题得到了较好的结果.本方法也可用于其它有约束的规划问题 - Perceptron , relaxation , mse and ho - kashyap ( hk ) algorithm . hk is not robust to outliers . the modified hk with square approximation of the misclassification errors ( mhks ) tries to avoid this shortcoming and adopts similar principle to the support vector machine to maximize the separation margin
线性分类器因其简单、易于分析和实现且容易推广为非线性分类器的优点而成为模式分类最常用的分类器,并产生了感知器( perceptron ) 、松弛算法( relaxation ) 、最小平方误差( minimumsquareerror , mse )和ho - kashyap ( h - k )算法等经典算法。 - And it is obvious that pseudo - relaxation is a kind of local optimization method , so it cannot guarantee to get the global optimal solution . in this paper , a novel learning algorithm eprbam evolutionary psendo - relaxation learning algorithm for bidirectional association memory employing genetic algorithm and pseudo - relaxation method is proposed to get feasible solution of bam weight matrix
即使在和取定后，准松弛算法的训练和学习仍是一种局部最优化过程，它只是在初始权矩阵的附近找到第一个可行解就结束训练，这类算法并不能保证获得全局最优解。