Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition最新文献

筛选
英文 中文
Chapter 1: Introduction to Nonlinear Programming 第1章:非线性规划导论
Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition Pub Date : 2020-01-01 DOI: 10.1137/1.9781611976199.ch1
{"title":"Chapter 1: Introduction to Nonlinear Programming","authors":"","doi":"10.1137/1.9781611976199.ch1","DOIUrl":"https://doi.org/10.1137/1.9781611976199.ch1","url":null,"abstract":"A nonlinear program (NLP) is similar to a linear program in that it is composed of an objective function, general constraints, and variable bounds. The difference is that a nonlinear program includes at least one nonlinear function, which could be the objective function, or some or all of the constraints. Many real systems are inherently nonlinear, e.g. modelling the drop in signal power with distance from a transmitting antenna, so it is important that optimization algorithms be able to handle them. The problem is that nonlinear models are inherently much more difficult to optimize. There are twelve main reasons for this, as described below. Reason 1: It's hard to distinguish a local optimum from a global optimum. Numerical methods for solving nonlinear programs have limited information about the problem, typically only information about the current point (and stored information about past points that have been visited). The usual available information is (i) the point x itself, (ii) the value of the objective function at x, (iii) the values of the constraint functions at x, (iv) the gradient at x (the derivative in a 1-variable problem), and (v) the Hessian matrix (i.e. the second derivative in a 1-variable problem). This is enough information to recognize when you are at a local maximum or minimum, but there is no way of knowing whether there exists a different and better local maximum, or even how to proceed towards it. This also means that there is no way to easily determine where the global optimum is. These ideas are illustrated for a 1-variable unconstrained problem in Fig. 16.1. Formally, a local optimum x* is a feasible point that has a better value than any other feasible point in a small neighbourhood around it, say within some small ball with radius ε. The global optimum, on the other hand, is the point with the best value of the objective function anywhere in the feasible region. Note that the global optimum will also be a local optimum. Reason 2: Optima are not restricted to extreme points. There are a limited number of places to look for the optimum in a linear program: we need only check the extreme points, or corner points, of the feasible region polytope. This isn't so for nonlinear programs: an optimum (local or global) could be anywhere: at an extreme point, along an edge of the feasible region, or in the interior …","PeriodicalId":145755,"journal":{"name":"Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128145661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Back Matter 回到问题
Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition Pub Date : 2020-01-01 DOI: 10.1137/1.9781611976199.bm
{"title":"Back Matter","authors":"","doi":"10.1137/1.9781611976199.bm","DOIUrl":"https://doi.org/10.1137/1.9781611976199.bm","url":null,"abstract":"","PeriodicalId":145755,"journal":{"name":"Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132316487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Chapter 6: Partial Differential Equations 第六章:偏微分方程
Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition Pub Date : 2020-01-01 DOI: 10.1137/1.9781611976199.ch6
{"title":"Chapter 6: Partial Differential Equations","authors":"","doi":"10.1137/1.9781611976199.ch6","DOIUrl":"https://doi.org/10.1137/1.9781611976199.ch6","url":null,"abstract":"","PeriodicalId":145755,"journal":{"name":"Practical Methods for Optimal Control Using Nonlinear Programming, Third Edition","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134553005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书