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...
Uloženo v:
| Vydáno v: | Control and cybernetics Ročník 53; číslo 1; s. 231 - 246 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Warsaw
Instytut Badan Systemowych Polskiej Akademii Nauk
01.01.2024
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services |
| Témata: | |
| ISSN: | 0324-8569, 2720-4278 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|---|
| Bibliografie: | 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 |