| Issue |
ESAIM: COCV
Volume 28, 2022
|
|
|---|---|---|
| Article Number | 73 | |
| Number of page(s) | 19 | |
| DOI | https://doi.org/10.1051/cocv/2022072 | |
| Published online | 22 December 2022 | |
Equivalence of three kinds of optimal control problems for linear heat equations with memory
1
School of Mathematics and Statistics, Computational Science Hubei Key Laboratory, Wuhan University,
Wuhan
430072,
China
2
School of Mathematics and Statistics, Lingnan Normal University,
Zhanjiang
524048,
China
* This work was supported by the National Natural Science Foundation of China under grant 12171377.
** This work was supported by the National Natural Science Foundation of China under grants 11926331 and 11601213.
*** Corresponding author: zhouxiuxiang@163.com
Received:
25
April
2022
Accepted:
31
October
2022
This paper studies an equivalence theorem for three different kinds of optimal control problems, which are optimal time control problems, optimal norm control problems, and optimal target control problems. The controlled systems in this paper are internally controlled linear heat equations with memory.
Mathematics Subject Classification: 35K05 / 49J20 / 93C20
Key words: Equivalence of optimal controls / optimal target / optimal time / optimal norm / heat equation with memory
© The authors. Published by EDP Sciences, SMAI 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.