{"title":"Optimization of a class of non-convex objectives on the Gaussian MIMO multiple access channel: Algorithm development and convergence analysis","authors":"Daniel Calabuig, R. Gohary, H. Yanikomeroglu","doi":"10.1109/SPAWC.2014.6941315","DOIUrl":null,"url":null,"abstract":"In this paper we develop an algorithm for computing the optimal transmission parameters, which include the transmission covariance, the time-shares and the user-orderings that minimize a particular class of objectives defined over the capacity region of Gaussian multiple antenna multiple access channels. This class includes objectives that are twice-differentiable, non-increasing and convex in the users' rates, but not necessarily convex in the aforementioned transmission parameters. As such, this class includes design objectives that are non-convex and that, without the proposed algorithm, are difficult to solve in general. The proposed algorithm is iterative with polynomial complexity per iteration and with convergence to the global optimal guaranteed. The utility of this algorithm is illustrated via a numerical example for maximizing proportional fairness.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2014.6941315","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper we develop an algorithm for computing the optimal transmission parameters, which include the transmission covariance, the time-shares and the user-orderings that minimize a particular class of objectives defined over the capacity region of Gaussian multiple antenna multiple access channels. This class includes objectives that are twice-differentiable, non-increasing and convex in the users' rates, but not necessarily convex in the aforementioned transmission parameters. As such, this class includes design objectives that are non-convex and that, without the proposed algorithm, are difficult to solve in general. The proposed algorithm is iterative with polynomial complexity per iteration and with convergence to the global optimal guaranteed. The utility of this algorithm is illustrated via a numerical example for maximizing proportional fairness.