Have a personal or library account? Click to login
Sufficient approximate optimality condition for the inverse one-phase Stefan problem Cover

Sufficient approximate optimality condition for the inverse one-phase Stefan problem

Open Access
|Jan 2025

Abstract

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.

DOI: https://doi.org/10.2478/candc-2024-0010 | Journal eISSN: 2720-4278 | Journal ISSN: 0324-8569
Language: English
Page range: 231 - 246
Submitted on: May 1, 2024
Accepted on: Jul 1, 2024
Published on: Jan 17, 2025
Published by: Systems Research Institute Polish Academy of Sciences
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2025 Marta Lipnicka, Artur Lipnicki, Andrzej Nowakowski, published by Systems Research Institute Polish Academy of Sciences
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.