Parabolic optimal control problems with combinatorial switching constraints -- Part III: Branch-and-bound algorithm
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916096647364608 |
|---|---|
| author | Buchheim, Christoph Grütering, Alexandra Meyer, Christian |
| author_facet | Buchheim, Christoph Grütering, Alexandra Meyer, Christian |
| contents | 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 $\varepsilon>0$, we show how to compute in finite time an $\varepsilon$-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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_10018 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Parabolic optimal control problems with combinatorial switching constraints -- Part III: Branch-and-bound algorithm Buchheim, Christoph Grütering, Alexandra Meyer, Christian Optimization and Control 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 $\varepsilon>0$, we show how to compute in finite time an $\varepsilon$-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. |
| title | Parabolic optimal control problems with combinatorial switching constraints -- Part III: Branch-and-bound algorithm |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2401.10018 |