A projection subgradient algorithm for the Lagrangian dual problem of the relaxed quadratic problem is employed to general lower bounds of the optimal value for the original problem.
采用椭球剖分策略剖分可行域为小的椭球，用投影次梯度算法解松弛二次规划问题的拉格朗日对偶问题，从而获得原问题的一个下界。
We formulated this optimization problem and solved it using the Lagrangian dual method and interpreted it from the angle of economics.
针对问题的非凸性，提出了基于拉格朗日对偶方法的最优子信道、速率和功率分配算法，并从经济学的角度予以解释。
We formulated this optimization problem and solved it using the Lagrangian dual method and interpreted it from the angle of economics.
针对问题的非凸性，提出了基于拉格朗日对偶方法的最优子信道、速率和功率分配算法，并从经济学的角度予以解释。
应用推荐