1994 Polynomiality of infeasible-interior-point algorithms for linear programming(1994)

1994 Polynomiality of infeasible-interior-point algorithms for linear programming(1994)

ID:38812482

大小:552.23 KB

页数:11页

时间:2019-06-19

1994 Polynomiality of infeasible-interior-point algorithms for linear programming(1994)_第1页
1994 Polynomiality of infeasible-interior-point algorithms for linear programming(1994)_第2页
1994 Polynomiality of infeasible-interior-point algorithms for linear programming(1994)_第3页
1994 Polynomiality of infeasible-interior-point algorithms for linear programming(1994)_第4页
1994 Polynomiality of infeasible-interior-point algorithms for linear programming(1994)_第5页
资源描述:

《1994 Polynomiality of infeasible-interior-point algorithms for linear programming(1994)》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、MathematicalProgramming67(1994)109-119Polynomialityofinfeasible-interior-pointalgorithmsforlinearprogramming"ShinjiMizuno*TheInstituteofStatisticalMathematics,4-6-7Minami-Azabu,Minato-ku,Tokyo106,JapanReceived18June1992;revisedmanuscriptreceived7March1994Abstrac

2、tKojima,Megiddo,andMizunoinvestigateaninfeasible-interior-pointalgorithmforsolvingaprimal-dualpairoflinearprogrammingproblemsandtheydemonstrateitsglobalconvergence.Theiralgorithmfindsapproximateoptimalsolutionsofthepairifbothproblemshaveinteriorpoints,andtheydet

3、ectinfeasibilitywhenthesequenceofiteratesdiverges.Zhangprovespolynomial-timecon-vergenceofaninfeasible-interior-pointalgorithmundertheassumptionthatbothprimalanddualproblemshavefeasiblepoints.Inthispaper,weshowthatamodificationoftheKojima-Megiddo-Mizunoalgorithm

4、"solves"thepairofproblemsinpolynomialtimewithoutassumingtheexistenceoftheLPsolution.Furthermore,wedevelopanO(nL)-iterationcomplexityresultforavariantofthealgorithm.Keywords:Polynomial-time;Linearprogramming;Primal-dual;Interior-pointalgorithm1.IntroductionThepri

5、mal-dualinfeasible-interior-pointalgorithmforlinearprogrammingisasimplevariantoftheprimal-dual(feasible)interior-pointalgorithmdevelopedbyMegiddo[7],Kojima,Mizuno,andYoshise[2,3],MonteiroandAdler[9,10],andTanabe[12].Howeverthetheoreticalbehaviorofthealgorithmisn

6、otasweilknownasfortheinterior-pointalgorithm.ThealgorithmhasbeenstudiedbyLustig[4],Lustig,Marsten,andShanno[5],Marsten,Subramanian,Saltzman,Lustig,andShanno[6],Tanabe[13],etc.,andis*Theoriginaltitlewas"PolynomialityoftheKojima-Megiddo-Mizunoinfeasible-interior-p

7、ointalgorithmforlinearprogramming".*ResearchperformedwhilevisitingCornellUniversity(April1992-Januar3,1993)asanOverseasResearchScholaroftheMinistryofScience,EducaüonandCultureofJapan.0025-5610©1994---TheMathematicalProgrammingSociety,Inc.AllrightsreservedSSD1002

8、5-5610(94)00026-P110S.Mizuno/MathematicalProgramming67(1994)109-119knownasoneofthemostefficientinterior-pointalgorithms(seeforexample[5,6]).Kojima,Megiddo,andMizuno[1

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

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

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