离散化
数学优化
先验与后验
背景(考古学)
计算机科学
搭配(遥感)
最优化问题
计算
最大化
极限(数学)
双层优化
非线性系统
数学
应用数学
算法
数学分析
古生物学
哲学
物理
认识论
量子力学
机器学习
生物
作者
Evgeny Lazutkin,Abebe Geletu,Pu Li
标识
DOI:10.1021/acs.iecr.7b03361
摘要
To numerically solve a dynamic optimization problem, the model equations need to be discretized over a time horizon. The very first step therefore is to decide the number of time intervals. In principle, the decision is made to achieve a compromise between the numerical accuracy of the discretization and the computation load for solving the discretized optimization problem. However, there have been no comprehensive rules for this purpose. In the context of collocation on finite elements, we propose a novel bilevel approach to evaluate an upper limit of the approximation error by formulating and solving an error maximization problem. In this way, a minimum number of time intervals can be determined a priori, which guarantees a user-defined error tolerance. In addition, the impact of the initial conditions on the maximum approximation error is taken into account so that the determined number of intervals is valid for varying initial conditions and thus can be applied to nonlinear model predictive control. Several case studies are used to demonstrate the efficacy of the proposed approach.
科研通智能强力驱动
Strongly Powered by AbleSci AI