基于SDP松弛的干扰资源优化分配技术研究  

Jamming Resources Distribution Optimization Technology Based on SDP Relaxation

作　　者：陆文博[1] 刘春生[1] 周青松[1] 

机构地区：[1]电子工程学院,安徽合肥230037

出　　处：《现代防御技术》2014年第6期167-172,共6页Modern Defence Technology

摘　　要：提出一种基于semidefinite programming(简称SDP)松弛的干扰资源优化分配算法。在问题优化过程中首先对模型中非凸的约束条件进行松弛,变为凸约束,将原来的数学模型转化成SDP求解形式,利用内点算法对松弛后的模型求解。该算法利用解析的手段使得干扰资源优化分配问题中的NP难问题在多项式时间内得以解决,并且有较高的可靠性。仿真结果验证了算法的有效性。A new method called semi-definite programming（ SDP） relaxation for jamming resources distribution optimization is proposed. In the optimization process,the non convex constraints in the model is relaxed into convex constraints,the mathematical model of the original is converted into a SDP problem,then interior point algorithm is used to solve the model after relaxation. The algorithm using the analytical means making interference resource allocation problems in NP hard problem can be solved in polynomial time with high reliability. The simulation results verify the effectiveness of the algorithm.

关 键 词：凸优化 SDP松弛 干扰资源 优化分配 

分 类 号：TN97[电子电信—信号与信息处理] TP301.6[电子电信—信息与通信工程]