Optimization of a class of non-convex objectives on the Gaussian MIMO multiple access channel: Algorithm development and convergence analysis

Daniel Calabuig, R. Gohary, H. Yanikomeroglu
{"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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
高斯MIMO多址信道上一类非凸目标的优化:算法开发与收敛性分析
本文提出了一种计算最优传输参数的算法,该算法包括传输协方差、分时和用户排序,这些参数在高斯多天线多址信道的容量区域上定义了最小化一类特定目标。这类物镜包括二次可微、非递增和用户速率凸的物镜,但在上述传输参数中不一定是凸的。因此,此类包括非凸的设计目标,并且如果没有提出的算法,通常很难解决这些目标。该算法是迭代的,每次迭代的复杂度为多项式,并保证收敛到全局最优。通过一个最大化比例公平的数值例子说明了该算法的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Unifying viewpoints on distributed asynchronous optimization for MISO interference channels Sparse channel estimation including the impact of the transceiver filters with application to OFDM Towards a principled approach to designing distributed MAC protocols Information rates employing 1-bit quantization and oversampling at the receiver Suppression of pilot-contamination in massive MIMO systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1