{"title":"Robust Beamforming with Magnitude Response Constraints Using Alternating Minimization","authors":"L. Gao, Bin Gao","doi":"10.1109/ICEICT.2019.8846418","DOIUrl":null,"url":null,"abstract":"We consider the robust beamforming problem with magnitude response constraints to deal with direction-of-arrival (DOA) mismatch in this paper. Because of the non-convex constraints, the traditional convex optimization methods cannot be applied directly. Although semidefinite relaxation (SDR) has been widely applied to tackle non-convex problems, its performance cannot be guaranteed in certain situations. Towards this end, an Alternating Minimization Algorithm (AMA) is proposed. Specifically, the rank-one constraint is first transformed into a trace inequality. Then, this new function is solved by using the proposed alternating optimization method, which converges to the locally optimum rank-one solution. It is verified by simulation results that the proposed beamformer has better robustness.","PeriodicalId":382686,"journal":{"name":"2019 IEEE 2nd International Conference on Electronic Information and Communication Technology (ICEICT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 2nd International Conference on Electronic Information and Communication Technology (ICEICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEICT.2019.8846418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We consider the robust beamforming problem with magnitude response constraints to deal with direction-of-arrival (DOA) mismatch in this paper. Because of the non-convex constraints, the traditional convex optimization methods cannot be applied directly. Although semidefinite relaxation (SDR) has been widely applied to tackle non-convex problems, its performance cannot be guaranteed in certain situations. Towards this end, an Alternating Minimization Algorithm (AMA) is proposed. Specifically, the rank-one constraint is first transformed into a trace inequality. Then, this new function is solved by using the proposed alternating optimization method, which converges to the locally optimum rank-one solution. It is verified by simulation results that the proposed beamformer has better robustness.