When solving optimal control problems over a long time horizon, one can introduce additional parallelism in time by subdividing the time horizon into smaller, non-overlapping time intervals and by solving these subproblems in parallel. If the intermediate state and adjoint between time intervals are known exactly, this procedure yields the exact solution. Thus, the problem reduces to solving a nonlinear system in these intermediate states, which are related via certain propagation operators. In this talk, we present a parareal approach for solving this nonlinear system: here, the global problem is approximated by a simpler one using coarse propagators, while the fine propagation is performed in parallel over different time intervals. One th...
International audienceIn this paper, we consider the problem of accelerating the numerical simulatio...
International audienceWe introduce a micro-macro parareal algorithm for the time-parallel integratio...
In this paper we present a new steepest-descent type algorithm for convex optimization problems. Our...
International audienceThe time parallel solution of optimality systems arising in PDE constrained op...
In this paper, we present a method that enables solving in parallel the Euler-Lagrange system associ...
The parareal algorithm is a method to solve time dependent problems parallel in time: it approximate...
The parareal algorithm is a method to solve time-dependent problems parallel in time: it approximate...
The parareal algorithm is a method to solve time-dependent problems parallel in time: it approximate...
The parareal algorithm is a method to solve time dependent problems parallel in time: it approximate...
In this paper, we present a method that enables to solve in parallel the Euler-Lagrange system assoc...
The numerical studies of control problems in quantum chemistry go through the computer simulation of...
Abstract. The parareal algorithm, which permits us to solve evolution problems in a time parallel fa...
In this paper, we consider the problem of accelerating the numerical simulation of time dependent pr...
We propose a modified parallel-in-time - Parareal - multi-level time integration method which, in co...
International audienceThe aim of this article is to design parareal algorithms in the context of the...
International audienceIn this paper, we consider the problem of accelerating the numerical simulatio...
International audienceWe introduce a micro-macro parareal algorithm for the time-parallel integratio...
In this paper we present a new steepest-descent type algorithm for convex optimization problems. Our...
International audienceThe time parallel solution of optimality systems arising in PDE constrained op...
In this paper, we present a method that enables solving in parallel the Euler-Lagrange system associ...
The parareal algorithm is a method to solve time dependent problems parallel in time: it approximate...
The parareal algorithm is a method to solve time-dependent problems parallel in time: it approximate...
The parareal algorithm is a method to solve time-dependent problems parallel in time: it approximate...
The parareal algorithm is a method to solve time dependent problems parallel in time: it approximate...
In this paper, we present a method that enables to solve in parallel the Euler-Lagrange system assoc...
The numerical studies of control problems in quantum chemistry go through the computer simulation of...
Abstract. The parareal algorithm, which permits us to solve evolution problems in a time parallel fa...
In this paper, we consider the problem of accelerating the numerical simulation of time dependent pr...
We propose a modified parallel-in-time - Parareal - multi-level time integration method which, in co...
International audienceThe aim of this article is to design parareal algorithms in the context of the...
International audienceIn this paper, we consider the problem of accelerating the numerical simulatio...
International audienceWe introduce a micro-macro parareal algorithm for the time-parallel integratio...
In this paper we present a new steepest-descent type algorithm for convex optimization problems. Our...