1995 Solving linear systems involved in constrained optimization

1995 Solving linear systems involved in constrained optimization

ID:38812872

大小:463.12 KB

页数:15页

时间:2019-06-19

1995 Solving linear systems involved in constrained optimization_第1页
1995 Solving linear systems involved in constrained optimization_第2页
1995 Solving linear systems involved in constrained optimization_第3页
1995 Solving linear systems involved in constrained optimization_第4页
1995 Solving linear systems involved in constrained optimization_第5页
资源描述:

《1995 Solving linear systems involved in constrained optimization》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、NORTH.HOLLCNDSolvingLinearSystemsInvolvedinConstrainedOptimizationYixunShiDepartmentofMathematics&ComputerScienceBloomsburgUniversityofPennsylvaniaBloomsburg,Pennsylvania17815SubmittedbyRichardA.BrualdiABSTRACTManyinteriorpointmethodsforlargescalelinearprogramming,quadraticpr

2、ogramming,theconvexprogrammingsolvean(n+m)×(n+m)linearsystemineachiteration.Thelastmequationsrequireexactsolutionsinordertomaintainthefeasibility.Currentimplementationsreducethatsteptosolvinganm×mlinearsystem.Thesolutionmustbeexact,becauseotherwisetheerrorwouldbeentirelypasse

3、dontothelastmequationsoftheoriginalsystem.Thismakesthecomputationcostlyandsometimesimpractical.Inthispaper,weproposeaninexpensiveiterativemethodforsolvingthat(n+m)×(n+m)system.Itguaranteesexactsolutionstothelastmequations.Theconvergenceisproved,andtheimplementationalissuesare

4、discussed.Somepreliminarynumericalresultsarealsoreported.1.INTRODUCTIONAn(n+m)X(nXm)linearsystemoftheformDx-ATy=b,(1)Ax=0needstobesolvedineachiterationofmanyinteriorpointmethodsforlargescalelinearprogramming,quadraticprogramming,andconvexprogramming,LINEARALGEBRAANDITSAPPLICA

5、TIONS229:175-189(1995)©ElsevierScienceInc.,19950024-3795/95/$9.50655AvenueoftheAmericas,NewYork,NY10010SSDI0024-3795(94)00007-Z176YIXUNSHIwhereD~Rn×niseitherapositivediagonalmatrixorthesumofapositivediagonalmatrixandasymmetricpositivesemidefinitematrix,A~Rmxn,m

6、,and0=(0,0.....0)T~Rm.ThematricesDandbwillchangeineachiteration,whileA,astheoriginalconstraintmatrix,staysthesame.Toseejustafewexamplesamongmanyothers,welistthefollowingcases.Case1(linearprogramming).Y.Ye(1992)describesaprimal-dualinteriorpointalgorithmforsolvingthelinearprog

7、rammingproblemmincTx(2)s.t.Ax=b,x>~0whereA~Rmxn,mO,andtakeYo~R'~suchthatso=c-AVyo>O.Fork=O,1,2,...untilconvergence,do(i)-(iii).(i)SolveforAxandAyfromthesystem(Xk)-lSkAx-Ar

8、Ay=Ok(Xk)-lpk,(3)AAx=0,whereXk=Diag(xk)isthepositivediagonalmatrixwh

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

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

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