Related papers: Polynomial Approximation of Value Functions and No…
The Hamilton Jacobi Bellman Equation (HJB) provides the globally optimal solution to large classes of control problems. Unfortunately, this generality comes at a price, the calculation of such solutions is typically intractible for systems…
The homogeneous second-order descent method (Zhang et al. 2025, Mathematics of Operations Research) was initially proposed for unconstrained optimisation problems. HSODM shows excellent performance with respect to the global complexity rate…
This paper investigates a new class of homogeneous stochastic control problems with cone control constraints, extending the classical homogeneous stochastic linear-quadratic (LQ) framework to encompass nonlinear system dynamics and…
In this work we study convergence properties of sparse polynomial approximations for a class of affine parametric saddle point problems. Such problems can be found in many computational science and engineering fields, including the Stokes…
In this paper we study the optimal stochastic control problem for stochastic differential systems reflected in a domain. The cost functional is a recursive one, which is defined via generalized backward stochastic differential equations…
Stochastic Optimal Control Problems (SOCPs) plays a major role in the sequential decision-making challenges. There exist various iterative algorithms, under framework of stochastic maximum principle, that sequentially find the optimal…
In this work, we consider the local Cahn-Hilliard-Navier-Stokes equation with regular potential in two dimensional bounded domain. We formulate distributed optimal control problem as the minimization of a suitable cost functional subject to…
We study optimal control problems governed by abstract infinite dimensional stochastic differential equations using the dynamic programming approach. In the first part, we prove Lipschitz continuity, semiconcavity and semiconvexity of the…
This paper investigates the convergence properties of the upwind difference scheme for the Hamilton--Jacobi--Bellman (HJB) equation, a central partial differential equation in optimal control theory. First, assuming the existence of a…
Neural operator (NO) architectures learn nonlinear maps between infinite-dimensional function spaces and are widely used to accelerate simulation and enable data-driven model discovery. While universality results ensure expressivity, they…
The sparse polynomial approximation of continuous functions has emerged as a prominent area of interest in function approximation theory in recent years. A key challenge within this domain is the accurate estimation of approximation errors.…
This paper presents an inverse optimality method to solve the Hamilton-Jacobi-Bellman equation for a class of nonlinear problems for which the cost is quadratic and the dynamics are affine in the input. The method is inverse optimal because…
We consider a convexity constrained Hamilton-Jacobi-Bellman-type obstacle problem for the value function of a zero-sum differential game with asymmetric information. We propose a convexity-preserving probabilistic numerical scheme for the…
We consider a kind of stochastic exit time optimal control problems, in which the cost function is defined through a nonlinear backward stochastic differential equation. We study the regularity of the value function for such a control…
We study the convergence problem for mean field control, also known as optimal control of McKean-Vlasov dynamics. We assume that the data is smooth but not convex, and thus the limiting value function $\mathcal{U} :[0,T] \times…
Lasserre's moment-SOS hierarchy consists of approximating instances of the generalized moment problem (GMP) with moment relaxations and sums-of-squares (SOS) strenghtenings that boil down to convex semidefinite programming (SDP) problems.…
High-order tensor methods that employ Taylor-based local models (of degree $p\ge 3$) within adaptive regularization frameworks have been recently proposed for both convex and nonconvex optimization problems. They have been shown to have…
Feedback control problems involving autonomous polynomial systems are prevalent, yet there are limited algorithms and software for approximating their solution. This paper represents a step forward by considering the special case of the…
We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of Optimal Control Problems (OCPs) constrained by random partial…
Studies regarding the computation of Optimal Control Problems (OCPs) with terminal inequality constraint, under the frame of the Variation Evolving Method (VEM), are carried out. The attributes of equality constraints and inequality…