Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/323339 
Erscheinungsjahr: 
2025
Quellenangabe: 
[Journal:] Computational Optimization and Applications [ISSN:] 1573-2894 [Volume:] 90 [Issue:] 3 [Publisher:] Springer US [Place:] New York [Year:] 2025 [Pages:] 649-689
Verlag: 
Springer US, New York
Zusammenfassung: 
Abstract We present a branch-and-bound algorithm for globally solving parabolic optimal control problems with binary switches that have bounded variation and possibly need to satisfy further combinatorial constraints. More precisely, for a given tolerance  ε>0, we show how to compute in finite time an ε-optimal solution in function space, independently of any prior discretization. The main ingredients in our approach are an appropriate branching strategy in infinite dimension, an a posteriori error estimation in order to obtain safe dual bounds, and an adaptive refinement strategy in order to allow arbitrary switching points in the limit. The performance of our approach is demonstrated by extensive experimental results.
Schlagwörter: 
PDE-constrained optimization
Switching time optimization
Global optimization
Branch-and-bound
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article
Dokumentversion: 
Published Version
Erscheint in der Sammlung:

Datei(en):
Datei
Größe





Publikationen in EconStor sind urheberrechtlich geschützt.