2014 | OriginalPaper | Buchkapitel
Direct Optimization: Problem discretization
verfasst von : Andreas Potschka
Erschienen in: A Direct Method for Parabolic PDE Constrained Optimization Problems
Verlag: Springer Fachmedien Wiesbaden
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The goal of this chapter is to obtain a discretized version of OCP (2.6). We discuss a so-called direct approach and summarize its main advantages and disadvantages in Section 3.1 in comparison with alternative approaches. In Sections 3.2 and 3.3 we discretize OCP (2.6) in two steps. First we discretize in space and obtain a large-scale ODE constrained OCP which we then discretize in time to obtain a large-scale Nonlinear Programming Problem (NLP) presented in Section 3.5. The numerical solution of this NLP is the subject of Part II in this thesis.