1) Lagrangian dual
拉格朗日对偶
1.
A deterministic global optimization algorithm based on Lagrangian dual is proposed for solving the nonconvex quadratic programming with nonconvex quadratic constraints,which is often encountered in technical design and operational research.
针对带有非凸二次函数约束的非凸二次规划问题(NQP),提出了一个基于拉格朗日对偶的确定型全局优化算法,这类优化算法可广泛应用于工程设计和非线性系统的鲁棒稳定性分析等实际问题中。
2) Dual Lagrange method
对偶拉格朗日法
1.
Furthermore the oscillation phenomenon bring about by the use of penalty function is also analyzed, and then put forward an intercross iteration method for PSO calculation based on Dual Lagrange method.
该方法克服了随机初始化粒子时不能保证粒子合理分布的缺点,对提高初始粒子质量、加速 PSO 算法的收敛速度起到了有效的作用;同时分析了罚函数形式的适应度函数使迭代过程产生振荡的现象,根据对偶拉格朗日法,提出了一种交叉迭代法,克服了罚函数法的不足。
3) Lagrange duality
拉格朗日对偶性
4) Lagrangian duality theory
拉格朗日对偶法
1.
Then, by use of multiple carrier system\'s frequency-sharing property and convex optimization, a subcarrier and power optimal allocation algorithm is proposed based on Lagrangian duality theory.
然后,运用凸优化技术分析了该资源分配问题,并基于拉格朗日对偶法给出了一种子载波和功率最优分配算法。
6) Lagrangian dual method
拉格朗日对偶方法
1.
We formulated this optimization problem and solved it using the Lagrangian dual method and interpreted it from the angle of economics.
针对问题的非凸性,提出了基于拉格朗日对偶方法的最优子信道、速率和功率分配算法,并从经济学的角度予以解释。
补充资料：第二类拉格朗日方程
见拉格朗日方程。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条