阅读作业bertsekas节上一次共轭方向法研一上auluh01flec04.pptx

阅读作业bertsekas节上一次共轭方向法研一上auluh01flec04.pptx

  1. 1、本文档共27页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多

Lecture04CopyRightP.B.Luh1ReadingAssignment:BertsekasSections3.1and3.2LastTime:ConjugateDirectionMethods2. OPTIMIZATIONOVERACONVEXSETNecessaryandSufficientConditionsforOptimalityFeasibleDirectionsandtheGradientProjectionMethods Today:LagrangeMultiplierTheory:NecessaryConditionsforEqualityConstraintsTheLagrangianRelaxationApproachSufficientConditionsandSensitivityAnalysisNextTime:BertsekasSections3.3,3.4,4.3(?),and5.1ModelingOptimizationofComplexNetworkedSystems:ApplicationstoOperationsSchedulingSupplyNetworkManagement

Lecture04CopyRightP.B.Luh2ConjugateDirectionMethodsMakingthebestuseofquadraticpropertiesxk+1=xk+?kdk,?kobtainedbylineminimizationdk=-?f(xk)+?kdk-1,withConditionsforConstrainedOptimality?f(x*)(x-x*)?0?x?X?Anyfeasibledirectionleadstoincreaseinf(x)atleastlocallyFeasibleDirectionsandtheGradientProjectionMethodsConstraintsarealwayssatisfied~thePrimalApproachIfweareontheboundary,projectnegativegradientbackontothesetofactiveconstraintsWith?kchosenbytheArmijoruleorthelimitedminimizationrule,everylimitpointof{xk}isstationaryConvergencesimilartothegradientmethod

Lecture04CopyRightP.B.Luh3LagrangeMultiplierTheory:NecessaryConditionsforEqualityConstraintsA“dual”approachwithoutrequiringtheconstraintstobesatisfiedacrosstheiterationsWeshallfirstpresentintuitiveideasaboutnecessaryconditions,andfollowupbymorerigorousderivationsAmotivatingexampleMinxf(x),withf(x)?x12+x22,subjecttox1+x2=1Whatistheproblem?x1+x2=1Howmanymethodsaretheretosolvetheproblem?Howdotheywork?Prosandcons?Whatisthesolution?

Lecture04CopyRightP.B.Luh4Method1:GraphicalinspectionMethod2:Directsubstitutionx2=1-x1f(x1,(1-x1))=x12+(1-x1)2=2x12-2x1+1?F(x1)?AnunconstrainedoptimizationdF(x1)/dx1=0=4x1

文档评论(0)

136****1820 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档