Least regret control, virtual control and decomposition methods
"Least regret control" consists in trying to find a control which "optimizes the situation" with the constraint of not making things too worse with respect to a known reference control, in presence of more or less significant perturbations. This notion was introduced in [7]. It is recalled on a simple example (an elliptic system, with distributed control and boundary perturbation) in Section 2. We show that the problem reduces to a standard optimal control problem for augmented state equations. On...
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope of a given function , i.e. the largest function below which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope of a given function , i.e. the largest function below f which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.
In this paper we deal with the local exact controllability of the Navier-Stokes system with nonlinear Navier-slip boundary conditions and distributed controls supported in small sets. In a first step, we prove a Carleman inequality for the linearized Navier-Stokes system, which leads to null controllability of this system at any time T>0. Then, fixed point arguments lead to the deduction of a local result concerning the exact controllability to the trajectories of the Navier-Stokes system.
We study variational problems with volume constraints, i.e., with level sets of prescribed measure. We introduce a numerical method to approximate local minimizers and illustrate it with some two-dimensional examples. We demonstrate numerically nonexistence results which had been obtained analytically in previous work. Moreover, we show the existence of discontinuous dependence of global minimizers from the data by using a Γ-limit argument and illustrate this with numerical computations. Finally...