Optimality of Dual Methods for Discrete Multiuser Multicarrier Resource Allocation Problems.pdf

Optimality of Dual Methods for Discrete Multiuser Multicarrier Resource Allocation Problems.pdf

ID:34568301

大小:247.59 KB

页数:8页

时间:2019-03-08

Optimality of Dual Methods for Discrete Multiuser Multicarrier Resource Allocation Problems.pdf_第1页
Optimality of Dual Methods for Discrete Multiuser Multicarrier Resource Allocation Problems.pdf_第2页
Optimality of Dual Methods for Discrete Multiuser Multicarrier Resource Allocation Problems.pdf_第3页
Optimality of Dual Methods for Discrete Multiuser Multicarrier Resource Allocation Problems.pdf_第4页
Optimality of Dual Methods for Discrete Multiuser Multicarrier Resource Allocation Problems.pdf_第5页
资源描述:

《Optimality of Dual Methods for Discrete Multiuser Multicarrier Resource Allocation Problems.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、3810IEEETRANSACTIONSONWIRELESSCOMMUNICATIONS,VOL.11,NO.10,OCTOBER2012OptimalityofDualMethodsforDiscreteMultiuserMulticarrierResourceAllocationProblemsSimonG¨ortzenandAnkeSchmeink,Member,IEEEAbstractDualmethodsbasedonLagrangianrelaxationareusuallyinadditiontotheconcavecase.In[13],adiscretethest

2、ateofthearttosolvemultiusermulticarrierresourceRAPisanalysedwithaMinimumCostNetworkFlowmodelallocationproblems.Thisappliestoconcaveutilityfunctionsanddualmethodsareapplied.Thislistisnotintendedtobeaswellastopracticalsystemsemployingadaptivemodulation,exhaustivebutshowcasesthepopularityofdualme

3、thodsininwhichusersdataratescanbedescribedbystepfunctions.Weshowthatthisdiscreteresourceallocationproblemcanthisfield.Todate,dualmethodsareappliedasapowerfultoolbeformulatedasanintegerlinearprogrambelongingtothetosolvearbitraryRAPs,whichareoftendiscreteduetotheirclassofmultiple-choiceknapsackpr

4、oblems.Asaknapsackapplicationinpracticalsystems.Theperformanceoftheseproblemwithadditionalconstraints,thisproblemisNP-hard,methodsisattributedtothefactthatthedualitygapvanishesbutfacilitatesapproximationalgorithmsbasedonLagrangianwhenthenumberofsubcarrierstendstoinfinity,whichcanrelaxation.Wesh

5、owthatthesedualmethodscanbedescribedasroundingmethods.Asanimmediateresult,weconcludethatbeinterpretedasallowingarbitrarytime-sharingwithinthepriorclaimsofoptimality,basedonavanishingdualitygap,aresystem.Inthispaper,weshowthatthevanishingdualitygapinsufficient.Toanswerthequestionofoptimalityofdu

6、almethodsofdiscreteRAPsaloneisnotsufficienttoguaranteenear-fordiscretemulticarrierresourceallocationproblems,wepresentoptimalperformanceofdualmethods.boundsontheabsoluteintegralitygapforthreeexemplarydownlinkresourceallocationproblemswithdifferentobjectivesTothebestoftheauthorsknowledge,thesedi

7、screteprob-whenemployingroundingmethods.Theobtainedboundsarelemformulationshaveneverbeenanalysedindetailfromtheasymptoticallyoptimalinthesensethattherelativeperformanceperspectiveoflinearandintegerlinearoptimization.Inthislossvanishesas

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。