{"title":"稳健的资源分配","authors":"M. Schubert, H. Boche","doi":"10.1109/ITW2.2006.323695","DOIUrl":null,"url":null,"abstract":"We propose a framework for robust power allocation based on worst-case interference functions, which are determined by a parameter-dependent coupling matrix. The power allocation is optimized with respect to the worst-case interference. One main contribution of this paper is to show that these worst-case interference functions have useful properties, which can be exploited for the design of an efficient iterative algorithm. The proposed iteration minimizes the total transmit power while the worst-case SINR of each user achieves a given target value. By analyzing the properties of the interference functions, we show monotonicity and super-linear global convergence, even though the original problem is non-convex. The iteration always requires less steps than an alternative fixed-point iteration, which has only linear convergence.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Robust Resource Allocation\",\"authors\":\"M. Schubert, H. Boche\",\"doi\":\"10.1109/ITW2.2006.323695\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a framework for robust power allocation based on worst-case interference functions, which are determined by a parameter-dependent coupling matrix. The power allocation is optimized with respect to the worst-case interference. One main contribution of this paper is to show that these worst-case interference functions have useful properties, which can be exploited for the design of an efficient iterative algorithm. The proposed iteration minimizes the total transmit power while the worst-case SINR of each user achieves a given target value. By analyzing the properties of the interference functions, we show monotonicity and super-linear global convergence, even though the original problem is non-convex. The iteration always requires less steps than an alternative fixed-point iteration, which has only linear convergence.\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323695\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323695","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We propose a framework for robust power allocation based on worst-case interference functions, which are determined by a parameter-dependent coupling matrix. The power allocation is optimized with respect to the worst-case interference. One main contribution of this paper is to show that these worst-case interference functions have useful properties, which can be exploited for the design of an efficient iterative algorithm. The proposed iteration minimizes the total transmit power while the worst-case SINR of each user achieves a given target value. By analyzing the properties of the interference functions, we show monotonicity and super-linear global convergence, even though the original problem is non-convex. The iteration always requires less steps than an alternative fixed-point iteration, which has only linear convergence.