Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Potschka, A. (2014). Direct Optimization: Problem discretization. In: A Direct Method for Parabolic PDE Constrained Optimization Problems. Advances in Numerical Mathematics. Springer Spektrum, Wiesbaden. https://doi.org/10.1007/978-3-658-04476-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-658-04476-3_3
Published:
Publisher Name: Springer Spektrum, Wiesbaden
Print ISBN: 978-3-658-04475-6
Online ISBN: 978-3-658-04476-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)