Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/323339 
Year of Publication: 
2025
Citation: 
[Journal:] Computational Optimization and Applications [ISSN:] 1573-2894 [Volume:] 90 [Issue:] 3 [Publisher:] Springer US [Place:] New York [Year:] 2025 [Pages:] 649-689
Publisher: 
Springer US, New York
Abstract: 
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.
Subjects: 
PDE-constrained optimization
Switching time optimization
Global optimization
Branch-and-bound
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.