.png){kind=icon}
Return
Dynamic process optimization through adjoint formulations and constraint aggregation
.png){kind=icon}
PRE
AI
DOI：10.1021/ie9804733.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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 Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.9
Papers:
4.0W
Citations:
9.6W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
ShareSaveShareSave
View more