最优化与控制
We establish two concentration inequalities for nonlinear stochastic system under time-varying contraction conditions. The key to our approach is an energy function termed Averaged Moment Generating Function (AMGF). By combining it with…
We introduce a regulated stochastic diffusion model for the recycling rate and formulate a joint control problem over production and process innovation via the dynamics of recycling investment and product pricing. The resulting stochastic…
This paper develops boundary feedback controls to stabilize traffic congestion toward a predefined shock equilibrium in the Aw-Rascle-Zhang (ARZ) traffic flow model. We transform the corresponding moving-boundary $2\times2$ hyperbolic…
In this paper we propose a data-driven output-feedback controller synthesis method for discrete-time linear time-invariant systems in a specific autoregressive form. The synthesis goal is either to achieve dissipativity with respect to a…
We study how the optimization landscape of a neural network deforms as a non-linear activation is introduced through a smooth homotopy. Working first in an abstract local setting - a smooth one-parameter family of objective functions…
Existing macroscopic traffic control methods often struggle to strictly regulate rare, safety-critical extreme events under stochastic disturbances. In this paper, we develop a rare chance-constrained optimal control framework for…
We investigate the continuous-time Markowitz mean-variance portfolio selection problem within a multivariate class of fake stationary affine Volterra models. In this non-Markovian and non-semimartingale market framework with unbounded…
This paper studies the uniqueness of solutions to the dual optimal transport problem, both qualitatively and quantitatively (bounds on the diameter of the set of optimisers). On the qualitative side, we prove that when one marginal…
Neural networks are increasingly used as surrogates in optimization problems to replace computationally expensive models. However, embedding ReLU neural networks in mathematical programs introduces significant computational challenges,…
This paper investigates the dynamics and optimal harvesting of age-structured populations governed by McKendrick--von Foerster equations, contrasting two distinct harvesting mechanisms: rate-control and effort-control. For the rate-control…
A polynomial that is nonnegative need not be a sum of squares of polynomials. This classical gap, identified by Hilbert in 1888, lies at the heart of why the global optimization of multivariate quartic polynomials is NP-hard. Yet we show…
This work proposes a novel and unified sparse recovery framework, termed the difference of convex Elastic Net (DCEN). This framework effectively balances strong sparsity promotion with solution stability, and is particularly suitable for…
In this paper, we propose a suboptimal and reduced-order Model Predictive Control (MPC) architecture for discrete-time feedback-interconnected systems. The numerical MPC solver: (i) acts suboptimally, performing only a finite number of…
This paper investigates McKean-Vlasov backward stochastic variational inequalities (BSVIs) whose generator depends on the joint law of the solution. We first establish the existence and uniqueness of the solution under globally Lipschitz…
During an infectious disease outbreak, policymakers must balance medical costs with social and economic burdens and seek interventions that minimize both. To support this decision-making process, we developed a framework that integrates…
We study the shipper-side design of large-scale inbound transportation networks, motivated by the global supply chain of the carmaker Renault. We formalize the Shipper Transportation Planning Problem (STPP), which integrates discrete flow…
By generalizing the notion of linearization, a concept originally arising from microlocal analysis and symbolic calculus, to diffeological spaces, we make a first proposal setting for optimization problems in this category. We show how…
We propose two variants of the Primal Dual Hybrid Gradient (PDHG) algorithm for saddle point problems with block decomposable duals, hereafter called Multi-Timescale PDHG (MT-PDHG) and its accelerated variant (AMT-PDHG). Through novel…
In this paper, we introduce a practical GPU-enhanced matrix-free first-order method for solving large-scale conic programming problems, which we refer to as PDCS, standing for the Primal-Dual Conic Programming Solver. Problems that it…
Solving (Stampacchia) variational inequalities (SVIs) is a foundational problem at the heart of optimization. However, this expressivity comes at the cost of computational hardness. As a result, most research has focused on carving out…