Related papers: An adaptive POD approximation method for the contr…
Classically, the optimal control problem in the presence of an adversary is formulated as a two-player zero-sum differential game or an $H_\infty$ control problem. The solution to these problems can be obtained by solving the…
A space-time interface-fitted approximation of an inverse source problem for the advection-diffusion equation with moving subdomains is investigated. The problem is reformulated as an optimization problem using Tikhonov regularization. A…
This paper investigates the near optimal control for a kind of linear stochastic control systems governed by the forward backward stochastic differential equations, where both the drift and diffusion terms are allowed to depend on controls…
We analyze a high order unfitted hybridizable discontinuous Galerkin (HDG) method for an optimal control problem governed by a convection-diffusion equation posed in a domain with piecewise-wise $\mathcal{C}^2$ boundary $\partial \Omega$.…
We consider a distributed optimal control problem governed by an elliptic convection diffusion PDE, and propose a hybridizable discontinuous Galerkin (HDG) method to approximate the solution. We use polynomials of degree $k+1$ and $k \ge 0$…
The evaluation of robustness and reliability of realistic structures in the presence of uncertainty involves costly numerical simulations with a very high number of evaluations. This motivates model order reduction techniques like the…
We present methods for locally solving the Dynamic Programming Equations (DPE) and the Hamilton Jacobi Bellman (HJB) PDE that arise in the infinite horizon optimal control problem. The method for solving the DPE is the discrete time version…
We introduce a local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations. The proposed method is based on a coarse grid and iteratively improves the solution's accuracy by solving local elliptic problems in…
Proper Orthogonal Decomposition (POD) is a widely used technique for the construction of low-dimensional approximation spaces from high-dimensional input data. For large-scale applications and an increasing amount of input data vectors,…
In this paper, we consider the adaptive Eulerian--Lagrangian method (ELM) for linear convection-diffusion problems. Unlike the classical a posteriori error estimations, we estimate the temporal error along the characteristics and derive a…
A learning technique for finite horizon optimal control problems and its approximation based on polynomials is analyzed. It allows to circumvent, in part, the curse dimensionality which is involved when the feedback law is constructed by…
The main focus of the present work is the inclusion of spatial adaptivity for the snapshot computation in the offline phase of model order reduction utilizing Proper Orthogonal Decomposition (POD-MOR) for nonlinear parabolic evolution…
This paper considers a convex optimization problem with cost and constraints that evolve over time. The function to be minimized is strongly convex and possibly non-differentiable, and variables are coupled through linear constraints. In…
In this paper we study the problem of approximating the general solution to an optimal control problem whose dynamics arise from a $2\times 2$ skew-symmetric evolutionary game with arbitrary initial condition. Our approach uses a Fourier…
We study some optimal control problems on networks with junctions, approximate the junctions by a switching rule of delay-relay type and study the passage to the limit when $\varepsilon$, the parameter of the approximation, goes to zero.…
A novel robust nonlinear model predictive control strategy is proposed for systems with nonlinear dynamics and convex state and control constraints. Using a sequential convex approximation approach and a difference of convex functions…
In this paper, we consider the problem of optimally guiding a large-scale swarm of underwater vehicles that is tasked with the indirect control of an advection-diffusion environmental field. The microscopic vehicle dynamics are governed by…
This paper considers unconstrained convex optimization problems with time-varying objective functions. We propose algorithms with a discrete time-sampling scheme to find and track the solution trajectory based on prediction and correction…
Diffusion approximation provides weak approximation for stochastic gradient descent algorithms in a finite time horizon. In this paper, we introduce new tools motivated by the backward error analysis of numerical stochastic differential…
To avoid ineffective collisions between the equilibrium states, the hybrid method with deviational particles (HDP) has been proposed to integrate the Vlasov-Poisson-Landau system, while leaving a new issue in sampling deviational particles…