Mixed-Integer Semidefinite Relaxation of Joint Admission Control and Beamforming: An SOC-Based Outer Approximation Approach with Provable Guarantees

S. Ni, A. M. So
{"title":"Mixed-Integer Semidefinite Relaxation of Joint Admission Control and Beamforming: An SOC-Based Outer Approximation Approach with Provable Guarantees","authors":"S. Ni, A. M. So","doi":"10.1109/SPAWC.2018.8446045","DOIUrl":null,"url":null,"abstract":"We consider the joint admission control and multicast downlink beamforming (JABF) problem, which is a fundamental problem in signal processing and admits a natural mixed-integer quadratically constrained quadratic program (MIQCQP) formulation. One popular approach to tackling such MIQCQP formulation is to develop convex relaxations of both the binary and continuous variables. However, most existing convex relaxations impose rather weak relationships between the binary and continuous variables and thus do not yield high-performance solutions. To overcome this weakness, we propose to keep the binary constraints intact and apply the semidefinite relaxation (SDR) technique to continuous variables. Although the resulting relaxation takes the form of a mixed-integer semidefinite program (MISDP) and is theoretically intractable in general, by exploiting the fact that such MISDP arises as a mixed-integer SDR of an MIQCQP and harnessing recent computational advances in solving large-scale mixed-integer second-order cone programming (MISOCP) problems, we develop a novel, practically efficient algorithm that provably converges to an optimal solution to the MISDP in a finite number of steps. The key idea of our algorithm is to construct successively tighter second-order cone (SOC) outer approximations of the constraints in the MISDP and solve a sequence of MISOCPs to obtain an optimal solution to the MISDP. Our work also provides, to the best of our knowledge, the first general framework for solving MISDPs that arise as mixed-integer SDRs of MIQCQPs. Next, we show that by applying a Gaussian randomization procedure to the optimal solution to the MISDP, we obtain a feasible solution to the JABF problem whose approximation accuracy is on the order of M, the number of users in the network. This improves upon the approximation accuracy guarantee of an existing convex relaxation method. Lastly, we present numerical results to demonstrate the viability of our proposed approach.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2018.8446045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

We consider the joint admission control and multicast downlink beamforming (JABF) problem, which is a fundamental problem in signal processing and admits a natural mixed-integer quadratically constrained quadratic program (MIQCQP) formulation. One popular approach to tackling such MIQCQP formulation is to develop convex relaxations of both the binary and continuous variables. However, most existing convex relaxations impose rather weak relationships between the binary and continuous variables and thus do not yield high-performance solutions. To overcome this weakness, we propose to keep the binary constraints intact and apply the semidefinite relaxation (SDR) technique to continuous variables. Although the resulting relaxation takes the form of a mixed-integer semidefinite program (MISDP) and is theoretically intractable in general, by exploiting the fact that such MISDP arises as a mixed-integer SDR of an MIQCQP and harnessing recent computational advances in solving large-scale mixed-integer second-order cone programming (MISOCP) problems, we develop a novel, practically efficient algorithm that provably converges to an optimal solution to the MISDP in a finite number of steps. The key idea of our algorithm is to construct successively tighter second-order cone (SOC) outer approximations of the constraints in the MISDP and solve a sequence of MISOCPs to obtain an optimal solution to the MISDP. Our work also provides, to the best of our knowledge, the first general framework for solving MISDPs that arise as mixed-integer SDRs of MIQCQPs. Next, we show that by applying a Gaussian randomization procedure to the optimal solution to the MISDP, we obtain a feasible solution to the JABF problem whose approximation accuracy is on the order of M, the number of users in the network. This improves upon the approximation accuracy guarantee of an existing convex relaxation method. Lastly, we present numerical results to demonstrate the viability of our proposed approach.
联合接纳控制和波束形成的混合整数半定松弛:一种基于soc的可证明保证的外逼近方法
考虑联合接纳控制和组播下行波束形成(JABF)问题,这是信号处理中的一个基本问题,它允许一个自然的混合整数二次约束规划(MIQCQP)公式。处理这种MIQCQP公式的一种流行方法是开发二元变量和连续变量的凸松弛。然而,大多数现有的凸松弛在二元变量和连续变量之间施加了相当弱的关系,因此不能产生高性能的解决方案。为了克服这一缺点,我们建议保持二元约束的完整性,并将半定松弛(SDR)技术应用于连续变量。尽管由此产生的松弛以混合整数半定规划(MISDP)的形式出现,并且在理论上通常是难以处理的,但通过利用这样的MISDP作为MIQCQP的混合整数SDR出现的事实,并利用最近在解决大规模混合整数二阶锥规划(MISOCP)问题方面的计算进展,我们开发了一种新颖的,实际有效的算法,可以证明在有限的步骤中收敛到MISDP的最优解。该算法的核心思想是构造MISDP约束的连续更紧二阶锥(SOC)外逼近,并求解一系列MISDP约束,从而得到MISDP的最优解。据我们所知,我们的工作还提供了解决misdp的第一个通用框架,这些misdp是MIQCQPs的混合整数sdr。接下来,我们证明了通过对MISDP的最优解应用高斯随机化过程,我们得到了JABF问题的可行解,其逼近精度为网络中用户数量M的数量级。这在现有的凸松弛法保证逼近精度的基础上进行了改进。最后,我们给出了数值结果来证明我们提出的方法的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信