期刊
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
卷 121, 期 3, 页码 613-646出版社
KLUWER ACADEMIC/PLENUM PUBL
DOI: 10.1023/B:JOTA.0000037606.79050.a7
关键词
deterministic global optimization; convex underestimators; linear systems theory; interval analysis
This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据