论文部分内容阅读
针对内点算法求解半定规划进行三维无线传感器网络定位无法满足实际的需求,利用变量变换将半定规划问题转换为非线性规划问题,提出了解决非线性规划化问题的可行方向算法.在此基础上,取非线性规划问题变量的列数为3,阻止高秩解的产生.为了进一步提高计算效率,采用限制未知节点的度对三维网络图进行稀疏.仿真结果表明,可行方向算法是行之有效的,而且计算速度优于已有的稀疏半定规划内点算法.
In order to solve the problem of semi-definite programming, the localization of three-dimensional wireless sensor network can not meet the actual demand, and the semi-definite programming problem is converted into a nonlinear programming problem by using the variable transformation. A feasible direction algorithm for solving nonlinear programming problems is proposed Based on which the number of variables in the nonlinear programming problem is set to 3 to prevent the generation of high rank solutions.In order to further improve the computational efficiency, the three-dimensional network graph is sparsely constrained by unknown nodes.The simulation results show that the feasible direction algorithm is Which is faster than the existing sparse semidefinite programming interior point algorithm.