最优化理论期末作业

最优化理论期末作业

ID:41681808

大小:170.35 KB

页数:24页

时间:2019-08-29

最优化理论期末作业_第1页
最优化理论期末作业_第2页
最优化理论期末作业_第3页
最优化理论期末作业_第4页
最优化理论期末作业_第5页
资源描述:

《最优化理论期末作业》由会员上传分享,免费在线阅读,更多相关内容在工程资料-天天文库

1、XEpsjnqj9I/I/SI0ZLUOJsXgUOUBUIJOJUIpUBUOpB0IUnUJUIO3:JO闻N:QI呻pius****SuiuiuibjSojjJEauiqjojpoqppvjuiod-jouajuj(Bnp-iBiuudpucpoqpj[jaujcguopcziuipdoXAOJOJ屮OM

2、BUIJBarrierMethodandPrimal-dualInterior-pointMethodforLinearProgrammingSchoolofInformationScienceandEngineer

3、ing,ShandongUniversity,P.R.China,250100*@maii.sdu.edu.cnAbstract:Interior-pointmethods(IMP)forsolvingconvexoptimizationproblemsthatincludeinequalityconstraints.ThemostattractivefeaturesofIMPareitsspeedofconvergenceanditsrobustcapabilityofhandlingequalityandinequalit

4、yconstraints;makingitselfapracticaltoolforsolvinglarge-scaleoptimizationproblems.Inthispaper,twokindsofinterior-pointmethods—bairiermethodandprimal-dualinterior-pointmethod,arediscussed.AndComparisonofthesetwomethodsisgiven、basedonsolvingthestandardLP.Keywords:Inter

5、ior-pointmethod,BaiTiermethod,Primal-dualinterior-pointmethod,LP.1IntroductionTheinterior-pointmethodisalmostusedtosolveconvexoptimizationproblemsthatincludeinequalityconstraints.Interior-pointmethodssolvetheproblem(ortheKKTconditions)byapplyingNewton'smethodtoasequ

6、enceofequalityconstrainedproblems,ortoasequenceofmodifiedversionsoftheKKTconditions・Wecanviewinterior-pointmethodsasanotherlevelinthehierarchyofconvexoptimizationalgorithms.Linearequalityconstrainedquadraticproblemsarethesimplest.FortheseproblemstheKKTconditionsarea

7、setoflinearequations,whichcanbesolvedanalytically.Newton,smethodisthenextlevelinthehierarchy.WecanthinkofNewton'smethodasatechniqueforsolvingalinearequalityconstrainedoptimizationproblem,withtwicedifferentiableobjective,byreducingittoasequenceoflinearequalityconstra

8、inedquadraticproblems.Interior-pointmethodsformthenextlevelinthehierarchy:Theysolveanoptimizationproblemwithlinearequalityandinequalityconstraintsbyreducingittoasequenceoflinearequalityconstrainedproblems.2Theorybasisinthischapterwcdiscussinterior-pointmethodsforsol

9、vingconvexoptimizationproblemsthatincludeinequalityconstraints,minimize/o(x)s.t.fiM<0,i=1,2•••m(2.1)Ax=bwhere...fm:R"tRarcconvexandtwiceco

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

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

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