- Journal Home
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
We consider an optimal control problem described by semilinear parabolic partial differential equations, with control and state constraints. Since this problem may have no classical solutions, it is also formulated in the relaxed form. The classical control problem is then discretized by using a finite element method in space and the implicit Crank-Nicolson midpoint scheme in time, while the controls are approximated by classical controls that are bilinear on pairs of blocks. We prove that strong accumulation points in $L^2$ of sequences of optimal (resp. admissible and extremal) discrete controls are optimal (resp. admissible and weakly extremal classical) for the continuous classical problem, and that relaxed accumulation points of sequences of optimal (resp. admissible and extremal relaxed) discrete controls are optimal (resp. admissible and weakly extremal relaxed) for the continuous relaxed problem. We then apply a penalized gradient projection method to each discrete problem, and also a progressively refining version of the discrete method to the continuous classical problem. Under appropriate assumptions, we prove that accumulation points of sequences generated by the first method are admissible and extremal for the discrete problem, and that strong classical (resp. relaxed) accumulation points of sequences of discrete controls generated by the second method are admissible and weakly extremal classical (resp. relaxed) for the continuous classical (resp. relaxed) problem. For nonconvex problems whose solutions are non-classical, we show that we can apply the above methods to the problem formulated in Gamkrelidze relaxed form. Finally, numerical examples are given.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/912.html} }We consider an optimal control problem described by semilinear parabolic partial differential equations, with control and state constraints. Since this problem may have no classical solutions, it is also formulated in the relaxed form. The classical control problem is then discretized by using a finite element method in space and the implicit Crank-Nicolson midpoint scheme in time, while the controls are approximated by classical controls that are bilinear on pairs of blocks. We prove that strong accumulation points in $L^2$ of sequences of optimal (resp. admissible and extremal) discrete controls are optimal (resp. admissible and weakly extremal classical) for the continuous classical problem, and that relaxed accumulation points of sequences of optimal (resp. admissible and extremal relaxed) discrete controls are optimal (resp. admissible and weakly extremal relaxed) for the continuous relaxed problem. We then apply a penalized gradient projection method to each discrete problem, and also a progressively refining version of the discrete method to the continuous classical problem. Under appropriate assumptions, we prove that accumulation points of sequences generated by the first method are admissible and extremal for the discrete problem, and that strong classical (resp. relaxed) accumulation points of sequences of discrete controls generated by the second method are admissible and weakly extremal classical (resp. relaxed) for the continuous classical (resp. relaxed) problem. For nonconvex problems whose solutions are non-classical, we show that we can apply the above methods to the problem formulated in Gamkrelidze relaxed form. Finally, numerical examples are given.