Maria Soledad Aronna
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Maria Soledad Aronna has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Joseph Frédéric Bonnans
INRIA-Saclay and CMAP, École Polytechnique, Palaiseau, France
13 shared publications - Lucas Machado Moschen
Department of Mathematics, Imperial College London, London, U.K.
6 shared publications - Franco Rampazzo
Università di Padova
5 shared publications Franco Rampazzo
4 shared publications- Monica Motta
Università di Padova
4 shared publications - Oscar Sierra
Escola de Matemática Aplicada, Fundação Getulio Vargas, Rio de Janeiro, Brazil
4 shared publications
Latest Publications
- Open Access
- 21 January 2026
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 32
Dynamic programming principle and Hamilton–Jacobi–Bellman equation for optimal control problems with uncertainty
We study the properties of the value function associated with an optimal control problem with uncertainties, known as average or Riemann–Stieltjes problem. Uncertainties are assumed to belong to a compact metric probability space, and appear in the dynamics, in the terminal cost and in the initial condition, which yield an infinite-dimensional formulation. By stating the problem as an evolution equation in a Hilbert space, we show that the value function is the unique lower semicontinuous proximal solution of the Hamilton–Jacobi–Bellman (HJB) equation. Our approach relies on invariance properties and the dynamic programming principle.
- 21 January 2026
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 32
Open AccessDynamic programming principle and Hamilton–Jacobi–Bellman equation for optimal control problems with uncertainty
We study the properties of the value function associated with an optimal control problem with uncertainties, known as average or Riemann–Stieltjes problem. Uncertainties are assumed to belong to a compact metric probability space, and appear in the dynamics, in the terminal cost and in the initial condition, which yield an infinite-dimensional formulation. By stating the problem as an evolution equation in a Hilbert space, we show that the value function is the unique lower semicontinuous proximal solution of the Hamilton–Jacobi–Bellman (HJB) equation. Our approach relies on invariance properties and the dynamic programming principle.
- 11 December 2025
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 33 (4) , 45
Average Optimal Control of Uncertain Control-Affine Systems
- 11 December 2025
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 33 (4) , 45
Average Optimal Control of Uncertain Control-Affine Systems
- 30 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 492-497
Bang-Bang Optimal Control of Vaccination in Metapopulation Epidemics With Linear Cost Structures
In this paper, we study optimal vaccination in a heterogeneous metapopulation epidemic model with state and mixed control-state constraints and a linear cost on the control, which better reflects real-world expenses compared to quadratic penalties. Within a general SIR / SEIR K-patch framework, we formulate the resulting control problem on a finite horizon, prove the existence of optimal control, and derive the necessary conditions via Pontryagin’s maximum principle extended to handle both shipment and per-region capacity limits. We use Pontryagin’s result to rule out the existence of singular arcs and obtain a complete characterization of the optimal policy as bang-bang, with at most one switching time per region per week. Numerical experiments on networks of 3 to 8 cities confirm that the predicted switching structure arises from the linear cost assumption, and we compare these findings with optimal quadratic-cost policies.
- 30 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 492-497
Bang-Bang Optimal Control of Vaccination in Metapopulation Epidemics With Linear Cost Structures
In this paper, we study optimal vaccination in a heterogeneous metapopulation epidemic model with state and mixed control-state constraints and a linear cost on the control, which better reflects real-world expenses compared to quadratic penalties. Within a general SIR / SEIR K-patch framework, we formulate the resulting control problem on a finite horizon, prove the existence of optimal control, and derive the necessary conditions via Pontryagin’s maximum principle extended to handle both shipment and per-region capacity limits. We use Pontryagin’s result to rule out the existence of singular arcs and obtain a complete characterization of the optimal policy as bang-bang, with at most one switching time per region per week. Numerical experiments on networks of 3 to 8 cities confirm that the predicted switching structure arises from the linear cost assumption, and we compare these findings with optimal quadratic-cost policies.
- Open Access
Singular Arcs on Average Optimal Control-Affine Problems
In this paper we address optimal control problems in which the system parameters follow a probability distribution, and the optimization is based on average performance. These problems, known as Riemann-Stieltjes optimal control or optimal ensemble control problems, involve uncertainties that influence system dynamics. Focusing on control-affine systems, we apply the Pontryagin Maximum Principle to characterize singular arcs in a feedback form. To demonstrate the practical relevance of our approach, we apply it to the sterile insect technique, a biological pest control method. Numerical simulations confirm the effectiveness of our framework in addressing control problems under uncertainty.
Open AccessSingular Arcs on Average Optimal Control-Affine Problems
In this paper we address optimal control problems in which the system parameters follow a probability distribution, and the optimization is based on average performance. These problems, known as Riemann-Stieltjes optimal control or optimal ensemble control problems, involve uncertainties that influence system dynamics. Focusing on control-affine systems, we apply the Pontryagin Maximum Principle to characterize singular arcs in a feedback form. To demonstrate the practical relevance of our approach, we apply it to the sterile insect technique, a biological pest control method. Numerical simulations confirm the effectiveness of our framework in addressing control problems under uncertainty.
- Open Access
- 1 December 2024
- Published by KEAI Publishing in Infectious Disease Modelling
- Vol. 9 (4) , 1198-1222
Optimal vaccination strategies on networks and in metropolitan areas
This study presents a mathematical model for optimal vaccination strategies in interconnected metropolitan areas, considering commuting patterns. It is a compartmental model with a vaccination rate for each city, acting as a control function. The commuting patterns are incorporated through a weighted adjacency matrix and a parameter that selects day and night periods. The optimal control problem is formulated to minimize a functional cost that balances the number of hospitalizations and vaccines, including restrictions of a weekly availability cap and an application capacity of vaccines per unit of time. The key findings of this work are bounds for the basic reproduction number, particularly in the case of a metropolitan area, and the study of the optimal control problem. Theoretical analysis and numerical simulations provide insights into disease dynamics and the effectiveness of control measures. The research highlights the importance of prioritizing vaccination in the capital to better control the disease spread, as we depicted in our numerical simulations. This model serves as a tool to improve resource allocation in epidemic control across metropolitan regions.
- 1 December 2024
- Published by KEAI Publishing in Infectious Disease Modelling
- Vol. 9 (4) , 1198-1222
Open AccessOptimal vaccination strategies on networks and in metropolitan areas
This study presents a mathematical model for optimal vaccination strategies in interconnected metropolitan areas, considering commuting patterns. It is a compartmental model with a vaccination rate for each city, acting as a control function. The commuting patterns are incorporated through a weighted adjacency matrix and a parameter that selects day and night periods. The optimal control problem is formulated to minimize a functional cost that balances the number of hospitalizations and vaccines, including restrictions of a weekly availability cap and an application capacity of vaccines per unit of time. The key findings of this work are bounds for the basic reproduction number, particularly in the case of a metropolitan area, and the study of the optimal control problem. Theoretical analysis and numerical simulations provide insights into disease dynamics and the effectiveness of control measures. The research highlights the importance of prioritizing vaccination in the capital to better control the disease spread, as we depicted in our numerical simulations. This model serves as a tool to improve resource allocation in epidemic control across metropolitan regions.
- Open Access
Dynamic Programming Principle and Hamilton-Jacobi-Bellman Equation for Optimal Control Problems with Uncertainty
We study the properties of the value function associated with an optimal control problem with uncertainties, known as average or Riemann-Stieltjes problem. Uncertainties are assumed to belong to a compact metric probability space, and appear in the dynamics, in the terminal cost and in the initial condition, which yield an infinite-dimensional formulation. By stating the problem as an evolution equation in a Hilbert space, we show that the value function is the unique lower semi-continuous proximal solution of the Hamilton-Jacobi-Bellman (HJB) equation. Our approach relies on invariance properties and the dynamic programming principle.
Open AccessDynamic Programming Principle and Hamilton-Jacobi-Bellman Equation for Optimal Control Problems with Uncertainty
We study the properties of the value function associated with an optimal control problem with uncertainties, known as average or Riemann-Stieltjes problem. Uncertainties are assumed to belong to a compact metric probability space, and appear in the dynamics, in the terminal cost and in the initial condition, which yield an infinite-dimensional formulation. By stating the problem as an evolution equation in a Hilbert space, we show that the value function is the unique lower semi-continuous proximal solution of the Hamilton-Jacobi-Bellman (HJB) equation. Our approach relies on invariance properties and the dynamic programming principle.
- Open Access
Optimal vaccination strategies on networks and in metropolitan areas
This study presents a mathematical model for optimal vaccination strategies in interconnected metropolitan areas, considering commuting patterns. It is a compartmental model with a vaccination rate for each city, acting as a control function. The commuting patterns are incorporated through a weighted adjacency matrix and a parameter that selects day and night periods. The optimal control problem is formulated to minimize a functional cost that balances the number of hospitalizations and vaccines, including restrictions of a weekly availability cap and an application capacity of vaccines per unit of time. The key findings of this work are bounds for the basic reproduction number, particularly in the case of a metropolitan area, and the study of the optimal control problem. Theoretical analysis and numerical simulations provide insights into disease dynamics and the effectiveness of control measures. The research highlights the importance of prioritizing vaccination in the capital to better control the disease spread, as we depicted in our numerical simulations. This model serves as a tool to improve resource allocation in epidemic control across metropolitan regions.
Open AccessOptimal vaccination strategies on networks and in metropolitan areas
This study presents a mathematical model for optimal vaccination strategies in interconnected metropolitan areas, considering commuting patterns. It is a compartmental model with a vaccination rate for each city, acting as a control function. The commuting patterns are incorporated through a weighted adjacency matrix and a parameter that selects day and night periods. The optimal control problem is formulated to minimize a functional cost that balances the number of hospitalizations and vaccines, including restrictions of a weekly availability cap and an application capacity of vaccines per unit of time. The key findings of this work are bounds for the basic reproduction number, particularly in the case of a metropolitan area, and the study of the optimal control problem. Theoretical analysis and numerical simulations provide insights into disease dynamics and the effectiveness of control measures. The research highlights the importance of prioritizing vaccination in the capital to better control the disease spread, as we depicted in our numerical simulations. This model serves as a tool to improve resource allocation in epidemic control across metropolitan regions.
- 9 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 22 (3) , 2123-2149
Modeling and Control of Malaria Dynamics in Fish Farming Regions
In this work we propose a model that represents the relation between fish ponds, the mosquito population and the transmission of malaria. It has been observed that in the Amazonic region of Acre, in the North of Brazil, fish farming is correlated to the transmission of malaria when carried out in artificial ponds that become breeding sites. Evidence has been found indicating that cleaning the vegetation from the edges of the crop tanks helps to control the size of the mosquito population. We use our model to determine the effective contribution of fish farming practices on malaria transmission dynamics. The model consists of a nonlinear system of ordinary differential equations with jumps at the cleaning time, which act as impulsive controls. We study the asymptotic behavior of the system in function of the intensity and periodicity of the cleaning, and the value of the parameters. In particular, we state sufficient conditions under which the mosquito population is eliminated or persists, and under which the malaria is eliminated or becomes endemic. We prove our conditions by applying results for cooperative systems with concave nonlinearities.
- 9 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 22 (3) , 2123-2149
Modeling and Control of Malaria Dynamics in Fish Farming Regions
In this work we propose a model that represents the relation between fish ponds, the mosquito population and the transmission of malaria. It has been observed that in the Amazonic region of Acre, in the North of Brazil, fish farming is correlated to the transmission of malaria when carried out in artificial ponds that become breeding sites. Evidence has been found indicating that cleaning the vegetation from the edges of the crop tanks helps to control the size of the mosquito population. We use our model to determine the effective contribution of fish farming practices on malaria transmission dynamics. The model consists of a nonlinear system of ordinary differential equations with jumps at the cleaning time, which act as impulsive controls. We study the asymptotic behavior of the system in function of the intensity and periodicity of the cleaning, and the value of the parameters. In particular, we state sufficient conditions under which the mosquito population is eliminated or persists, and under which the malaria is eliminated or becomes endemic. We prove our conditions by applying results for cooperative systems with concave nonlinearities.
- Open Access
Well-posedness of the shooting algorithm for control-affine problems with a scalar state constraint
We deal with a control-affine problem with scalar control subject to bounds, a scalar state constraint and endpoint constraints of equality type. For the numerical solution of this problem, we propose a shooting algorithm and provide a sufficient condition for its local convergence. We exhibit an example that illustrates the theory.
Open AccessWell-posedness of the shooting algorithm for control-affine problems with a scalar state constraint
We deal with a control-affine problem with scalar control subject to bounds, a scalar state constraint and endpoint constraints of equality type. For the numerical solution of this problem, we propose a shooting algorithm and provide a sufficient condition for its local convergence. We exhibit an example that illustrates the theory.
- 17 June 2023
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 42 (5) , 1-22
Well-posedness of the shooting algorithm for control-affine problems with a scalar state constraint
- 17 June 2023
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 42 (5) , 1-22
Well-posedness of the shooting algorithm for control-affine problems with a scalar state constraint