Reformulating ill-conditioned differential-algebraic equation optimization problems

Purt Tanartkit

doi:10.1021/ie950543v

Reformulating ill-conditioned differential-algebraic equation optimization problems

1996-06-06

10

PRE

AI

DOI：10.1021/ie950543v

原文链接

原文求助

摘要

En 中文

This paper discusses numerical issues in differential-algebraic equation (DAE) optimization concerning the stability and accuracy of the discretized nonlinear programming problems (NLP). First, a brief description of the solution strategy based on reduced-Hessian successive quadratic programming (rSQP) is presented, focusing on the decomposition step of the DAE constraints. Next, some difficulties associated with unstable DAE problem formulations are exposed via examples. A new procedure for detecting ill-conditioning and problem reformulation is then presented. Furthermore, some properties of this procedure as well as its limitations are also discussed. Numerical examples are provided, including a flowsheet optimization problem with an unstable reactor.

Keyword:

BOUNDARY-VALUE-PROBLEMS

ALGORITHMS

Reformulating ill-conditioned differential-algebraic equation optimization problems

摘要

AI总结

期刊

机构

引用论文