Optimal control problem of evolution equation governed by hypergraph Laplacian
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_ | 1866912010161094656 |
|---|---|
| author | Fukao, Takeshi Ikeda, Masahiro Uchida, Shun |
| author_facet | Fukao, Takeshi Ikeda, Masahiro Uchida, Shun |
| contents | In this paper, we consider an optimal control problem of an ordinary differential inclusion governed by the hypergraph Laplacian, which is defined as a subdifferential of a convex function and then is a set-valued operator. We can assure the existence of optimal control for a suitable cost function by using methods of a priori estimates established in the previous studies. However, due to the multivaluedness of the hypergraph Laplacian, it seems to be difficult to derive the necessary optimality condition for this problem. To cope with this difficulty, we introduce an approximation operator based on the approximation method of the hypergraph, so-called ``clique expansion.'' We first consider the optimality condition of the approximation problem with the clique expansion of the hypergraph Laplacian and next discuss the convergence to the original problem. In appendix, we state some basic properties of the clique expansion of the hypergraph Laplacian for future works. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_00370 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal control problem of evolution equation governed by hypergraph Laplacian Fukao, Takeshi Ikeda, Masahiro Uchida, Shun Optimization and Control 49K15 (Primary) 05C65, 34G25, 49J15, 49J53 (Secondary) In this paper, we consider an optimal control problem of an ordinary differential inclusion governed by the hypergraph Laplacian, which is defined as a subdifferential of a convex function and then is a set-valued operator. We can assure the existence of optimal control for a suitable cost function by using methods of a priori estimates established in the previous studies. However, due to the multivaluedness of the hypergraph Laplacian, it seems to be difficult to derive the necessary optimality condition for this problem. To cope with this difficulty, we introduce an approximation operator based on the approximation method of the hypergraph, so-called ``clique expansion.'' We first consider the optimality condition of the approximation problem with the clique expansion of the hypergraph Laplacian and next discuss the convergence to the original problem. In appendix, we state some basic properties of the clique expansion of the hypergraph Laplacian for future works. |
| title | Optimal control problem of evolution equation governed by hypergraph Laplacian |
| topic | Optimization and Control 49K15 (Primary) 05C65, 34G25, 49J15, 49J53 (Secondary) |
| url | https://arxiv.org/abs/2409.00370 |