多用户干扰系统的全局直流优化

Yang Xu, T. Le-Ngoc
{"title":"多用户干扰系统的全局直流优化","authors":"Yang Xu, T. Le-Ngoc","doi":"10.1109/CAMSAP.2007.4498002","DOIUrl":null,"url":null,"abstract":"The weighted sum capacity of a Gaussian interference system is a nonconvex function of transmit power allocation vector of all users in the system. This paper shows that, by representing its objective function as a difference of two convex functions (d.c.), the non-convex optimization problem can be converted into an equivalent d.c. global optimization problem, which can be solved efficiently by various developed d.c. algorithms. In particular, a modified prismatic branch -and-bound algorithm that only requires solving a sequence of linear programming sub-problems, is introduced to find the global optimum. Simulation results in wireless flat-fading channel show that the proposed global d.c. optimization formulation outperforms considerably the local optimization methods in terms of achievable ergodic sum-rate capacity.","PeriodicalId":220687,"journal":{"name":"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Global D.C. Optimization for Multi-User Interference Systems\",\"authors\":\"Yang Xu, T. Le-Ngoc\",\"doi\":\"10.1109/CAMSAP.2007.4498002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The weighted sum capacity of a Gaussian interference system is a nonconvex function of transmit power allocation vector of all users in the system. This paper shows that, by representing its objective function as a difference of two convex functions (d.c.), the non-convex optimization problem can be converted into an equivalent d.c. global optimization problem, which can be solved efficiently by various developed d.c. algorithms. In particular, a modified prismatic branch -and-bound algorithm that only requires solving a sequence of linear programming sub-problems, is introduced to find the global optimum. Simulation results in wireless flat-fading channel show that the proposed global d.c. optimization formulation outperforms considerably the local optimization methods in terms of achievable ergodic sum-rate capacity.\",\"PeriodicalId\":220687,\"journal\":{\"name\":\"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAMSAP.2007.4498002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMSAP.2007.4498002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

高斯干扰系统的加权和容量是系统中所有用户发射功率分配向量的非凸函数。本文表明,通过将非凸优化问题的目标函数表示为两个凸函数(dc)的差,可以将非凸优化问题转化为一个等价的dc全局优化问题,并可以通过各种已开发的dc算法有效地求解。特别地,引入了一种只需要求解一系列线性规划子问题的改进的棱镜分支定界算法来求全局最优解。在无线平衰落信道中的仿真结果表明,所提出的全局直流电优化方法在可实现的遍历和速率容量方面明显优于局部优化方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Global D.C. Optimization for Multi-User Interference Systems
The weighted sum capacity of a Gaussian interference system is a nonconvex function of transmit power allocation vector of all users in the system. This paper shows that, by representing its objective function as a difference of two convex functions (d.c.), the non-convex optimization problem can be converted into an equivalent d.c. global optimization problem, which can be solved efficiently by various developed d.c. algorithms. In particular, a modified prismatic branch -and-bound algorithm that only requires solving a sequence of linear programming sub-problems, is introduced to find the global optimum. Simulation results in wireless flat-fading channel show that the proposed global d.c. optimization formulation outperforms considerably the local optimization methods in terms of achievable ergodic sum-rate capacity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信