% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{Caspari:877452,
      author       = {Caspari, Adrian and Lüken, Lukas and Schäfer, Pascal and
                      Vaupel, Yannic and Mhamdi, Adel and Biegler, Lorenz T. and
                      Mitsos, Alexander},
      title        = {{D}ynamic optimization with complementarity constraints:
                      {S}moothing for direct shooting},
      journal      = {Computers $\&$ chemical engineering},
      volume       = {139},
      issn         = {0098-1354},
      address      = {Amsterdam [u.a.]},
      publisher    = {Elsevier Science},
      reportid     = {FZJ-2020-02205},
      pages        = {106891 -},
      year         = {2020},
      abstract     = {We consider optimization of differential-algebraic
                      equations (DAEs) with complementarity constraints (CCs) of
                      algebraic state pairs. Formulating the CCs as smoothed
                      nonlinear complementarity problem (NCP) functions leads to a
                      smooth DAE, allowing for the solution in direct shooting. We
                      provide sufficient conditions for well-posedness. Thus, we
                      can prove that with the smoothing parameter going to zero,
                      the solution of the optimization problem with smoothed DAE
                      converges to the solution of the original optimization
                      problem. Four case studies demonstrate the applicability and
                      performance of our approach: (i) optimal loading of an
                      overflow weir buffer tank, (ii) batch vaporization setpoint
                      tracking, (iii) operation of a tank cascade, and (iv)
                      optimal start-up of a rectification column. The numerical
                      results suggest that the presented approach scales
                      favorably: the computational time for solution of the tank
                      cascade problem scales not worse than quadratically with the
                      number of tanks and does not scale with the control grid.},
      cin          = {IEK-10},
      ddc          = {660},
      cid          = {I:(DE-Juel1)IEK-10-20170217},
      pnm          = {899 - ohne Topic (POF3-899)},
      pid          = {G:(DE-HGF)POF3-899},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:000555543100008},
      doi          = {10.1016/j.compchemeng.2020.106891},
      url          = {https://juser.fz-juelich.de/record/877452},
}