Optimal control of the coagulation-fragmentation equation
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914475770118144 |
|---|---|
| author | Sartor, Enrico |
| author_facet | Sartor, Enrico |
| contents | We formulate and analyse an optimal control problem for the coagulation-fragmentation equation, where a scalar, time-dependent control modulates the coagulation rate by multiplying the coagulation kernel. The objective functional consists of a quadratic penalisation of the control and a terminal cost depending on the final size distribution. In a weighted $L^1$ framework, we prove weak-to-weak continuity of the control-to-state map under perturbations of the coefficients and obtain existence of optimal controls by the direct method. We then establish $Γ$-convergence of the corresponding cost functionals, providing stability of optimal controls and justifying truncation of unbounded kernels in the optimisation setting. For bounded coagulation kernels we show differentiability of the dynamics, derive an adjoint equation, and obtain a Pontryagin-type minimum principle. Lipschitz continuity of the gradient with respect to the control yields, at the continuous level, convergence of a projected-gradient algorithm with Armijo backtracking. A proof-of-concept finite-volume implementation is then used in a numerical study targeting the number of particles within a prescribed size window, demonstrating that a single low-dimensional actuator can effectively reshape an infinite-dimensional particle-size distribution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_13937 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Optimal control of the coagulation-fragmentation equation Sartor, Enrico Optimization and Control 49J20, 49K20, 45K05 We formulate and analyse an optimal control problem for the coagulation-fragmentation equation, where a scalar, time-dependent control modulates the coagulation rate by multiplying the coagulation kernel. The objective functional consists of a quadratic penalisation of the control and a terminal cost depending on the final size distribution. In a weighted $L^1$ framework, we prove weak-to-weak continuity of the control-to-state map under perturbations of the coefficients and obtain existence of optimal controls by the direct method. We then establish $Γ$-convergence of the corresponding cost functionals, providing stability of optimal controls and justifying truncation of unbounded kernels in the optimisation setting. For bounded coagulation kernels we show differentiability of the dynamics, derive an adjoint equation, and obtain a Pontryagin-type minimum principle. Lipschitz continuity of the gradient with respect to the control yields, at the continuous level, convergence of a projected-gradient algorithm with Armijo backtracking. A proof-of-concept finite-volume implementation is then used in a numerical study targeting the number of particles within a prescribed size window, demonstrating that a single low-dimensional actuator can effectively reshape an infinite-dimensional particle-size distribution. |
| title | Optimal control of the coagulation-fragmentation equation |
| topic | Optimization and Control 49J20, 49K20, 45K05 |
| url | https://arxiv.org/abs/2604.13937 |