报告主题：一类非凸复二次规划问题的新SDP松弛及其在无线通信中的应用
报告人：刘亚锋 副研究员 (中国科学院数学与系统科学研究院）
报告时间：2018年10月22日（周一）9:30
报告地点：校本部G507
邀请人：徐 姿
主办部门：太阳成集团tyc33455数学系
报告摘要：In this talk, we shall consider a special class of nonconvex Complex Quadratic Problems (CQP), which finds many important and interesting applications in wireless communications. In this talk, we shall first develop a new and Enhanced Complex SemiDefinite Program, called ECSDP, for the considered CQP and then apply the ECSDP to MIMO detection, a fundamental problem in modern wireless communications. As our main result, we show the tightness of the ECSDP for MIMO detection under an easily checkable condition. This result answers an open question posed by So in 2010. Based on the ECSDP, we can also develop a branch-and-bound algorithm for globally solving the MIMO detection problem (even though the above condition does not hold true).
欢迎教师、员工参加 ！
