9. Dynamic Optimization Methods with Embedded DAE Solvers

Lorenz T. BieglerSociety 2010 · DOI · OpenAlex

Abstract

This chapter develops dynamic optimization strategies that couple solvers for differential algebraic equations (DAEs) with NLP algorithms developed in the previous chapters. First, to provide a better understanding of DAE solvers, widely used Runge—Kutta and linear multistep methods are described, and a summary of their properties is given. A framework is then described for sequential dynamic optimization approaches that rely on DAE solvers to provide function information to the NLP solver. In addition, gradient information is provided by direct and adjoint sensitivity methods. Both methods are derived and described along with examples. Unfortunately, the sequential approach can fail on unstable and ill-conditioned systems. To deal with this case, we extend the sequential approach through the use of multiple shooting and concepts of boundary value solvers. Finally, a process case study is presented that illustrates both sequential and multiple shooting approaches.
BibTeX
@inproceedings{biegler2010dynamic,
  author = {Lorenz T. Biegler},
  title = {{9. Dynamic Optimization Methods with Embedded DAE Solvers}},
  booktitle = {Society},
  year = {2010},
  doi = {10.1137/1.9780898719383.ch9},
}

Loading related content...

Figure