.png){kind=icon}
返回
Dynamic process optimization through adjoint formulations and constraint aggregation
.png){kind=icon}
PRE
AI
DOI：10.1021/ie9804733.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A dynamic optimization strategy is developed that makes use of existing differential-algebraic equation solvers and nonlinear programming strategies. In contrast to current dynamic optimization approaches, this approach applies an adjoint strategy for the calculation of objective function and constraint gradients. Furthermore, we consider two aggregation approaches, the Kreisselmeier-Steinhauser function and the smoothed penalty function, for state variable constraints. The advantage of this aggregation is to reduce the burden in the calculation of the adjoint system. The resulting implementation has a significant advantage over current strategies that rely on the solution of sensitivity equations, especially for large dynamic optimization problems. Performance of this approach is demonstrated on several dynamic optimization problems in process engineering.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.9
论文数:
4.0W
被引数:
9.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容