Thereafter, a centralized algorithm was proposed, and the cross-layer optimization problem was divided into several sub-problems, which can be formulated as convex optimization problem and can be solved efficiently by some classical convex programming methods.
接着,指出该优化问题可以被分解为有限个子优化问题,每个子问题在满足流量限制的条件下是凸规划问题,可以使用经典的内点法求解,从而得到目标问题的最优解。
参考来源 - 无线Mesh网络容量研究和跨层协同设计·2,447,543篇论文数据，部分数据来源于NoteExpress
求线性约束凸规划问题的最优解。
Objective: To search optimal solutions of convex programming problems with linear constraints.
文中对CHIP方法进行了改进并利用改进的方法去求解更大一类的非凸规划问题。
In this paper, they modify the CHIP method and use the modified one to solve a broader class of non-convex programming problems.
研究了线性约束的非线性凸规划问题，基于最优性的充要条件，提出了求解它的一个神经网络。
The paper studies the nonlinear programming problem with linear constraints. Based on its optimality conditions, a neural network for solving it is proposed.
应用推荐