MIT教材，系统优化与调度ppt 使用美国麻省理工的教材，系统优化与调度，权威ppt Modeling Optimization of Complex Networked Systems Applications to Operations Scheduling Supply Network Management.pptVIP

下载本文档

5
0
约1.24万字
约 27页
2018-01-28 发布于浙江
举报
版权申诉

MIT教材，系统优化与调度ppt 使用美国麻省理工的教材，系统优化与调度，权威ppt Modeling Optimization of Complex Networked Systems Applications to Operations Scheduling Supply Network Management.ppt

1、本文档共27页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

MIT教材，系统优化与调度ppt使用美国麻省理工的教材，系统优化与调度，权威pptModeling

9/14/2001 Fall 2001, Copy Right P. B. Luh Reading Assignment: Bertsekas Sections 12 - 1.4, and Appendix C Problem Set 1: 1.1.3, 1.1.4, 1.2.1, 1.2.9, 1.3.1, 1.3.5, 1.4.3 Web: /lectures_cfins.html or 2/CFINSCourseOutline01FLuhR4.htm Last Time: Introduction and Unconstrained Optimization Motivation and Course Overview Problem Classification Optimality Conditions for Unconstrained Optimization Gradient Methods ? Framework Today: One-dimensional Search Methods Gradient Methods ? Convergence and Rate of Convergence Newtons Method and Variations Next Time: Bertsekas Sections 1.6, 2.1 - 2.3 Iterative optimization: Minimize f(x), with x ? X ? Rn Start with an initial point x0, evaluate f(x0), ?f(x0) (and possibly ?2f(x0)) Based on the information, select a search direction “d” emanating from x0 Find the next point x1 along the direction d, and evaluate f(x1), ?f(x1) (and possibly ?2f(x1)), then repeat Key Questions: Which direction to go? How far? Is the algorithm guaranteed to reach x*? How fast to reach x*? xk+1 = xk + ?k dk as long as ?f(x) d 0 f(xk+1) = f(xk) + ?k?f(xk)d + o(?k) f(xk) for small ?k A specific form: dk = - Dk ?f(xk) with Dk 0 ? Gradient methods How far to go along the direction d, or how to select the step size? What are the advantages and disadvantages of each method? 1.5 One-dimensional Search Methods There are several possibilities Minimization Approximate Stepsizing ? the Armijo Rule Diminishing Stepsize (Read yourself) A key component in multi-dimensional optimization Need to trade off between solution accuracy vs. computational efforts Minimization Minimizing f(x) along the dk direction ? “Line Search.” ?k = arg min ?? 0 f(xk + ? dk), Suppose f ? C1 (continuously differentiable), g(?) ? f(xk + ? dk), and g(?) = ?f(xk + ? dk) dk. Assume that g(0) = ?f(xk)dk 0, i.e., dk is a descent direction How to determine ?k via minimization? Quadratic Interpolation: How? Function evaluations can be costly, depending o