Sufficient approximate optimality condition for the inverse one-phase Stefan problem
We investigate the identification problem for the one-phase Stefan problem. As the inverse Stefan problem is not well posed, an optimal control problem is considered instead. In the paper we develop a dual dynamic programming approach to derive sufficient approximate optimality conditions for that o...
Saved in:
| Published in: | Control and cybernetics Vol. 53; no. 1; pp. 231 - 246 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Warsaw
Instytut Badan Systemowych Polskiej Akademii Nauk
01.01.2024
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services |
| Subjects: | |
| ISSN: | 0324-8569, 2720-4278 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We investigate the identification problem for the one-phase Stefan problem. As the inverse Stefan problem is not well posed, an optimal control problem is considered instead. In the paper we develop a dual dynamic programming approach to derive sufficient approximate optimality conditions for that optimal control problem. As a next step we formulate and prove a verification theorem for approximate solution. The verification Theorem 4.1 is the basis for the development of a numerical algorithm. Having the verification theorem we do not need the convergence of our algorithm. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0324-8569 2720-4278 |
| DOI: | 10.2478/candc-2024-0010 |