We discuss the application of the augmented Lagrangian method to the convex optimization problem of instationary variational mean field games with diffusion. The problem is first discretized with space-time tensor product piecewise polynomial bases. This leads to a sequence of linear problems posed on the space-time cylinder that are second order in the temporal variable and fourth order in the spatial variable. To solve these large linear problems with the preconditioned conjugate gradients method we propose a preconditioner that is based on a temporal transformation coupled with a spatial multigrid. This preconditioner is thus based on standard components and is particularly suitable for parallel computation. It is conditionally parameter...
AbstractA multi-step Lagrangian scheme at discrete times is proposed for the approximation of a nonl...
A general decomposition framework for large convex optimization problems based on augmented Lagrangi...
International audienceLinear programming relaxations are central to MAP inference in discrete Markov...
We discuss the application of the augmented Lagrangian method to the convex optimization problem of ...
Many problems from mass transport can be reformulated as variational problems under a prescribed div...
Many problems from mass transport can be reformulated as variational problems under a prescribed div...
This paper is a brief presentation of those Mean Field Games with congestion penalization which have...
Ce rapport présente l'adaptation de l'algorithme ALG2 [1] en vue de résoudre numériquement des jeux ...
This work deals with a numerical method for solving a mean-field type control problem with congestio...
International audienceWe analyze linear convergence of an evolution strategy for constrained optimiz...
A general decomposition framework for large convex optimization problems based on augmented Lagrangi...
This project investigates numerical methods for solving fully coupled forward-backward stochastic di...
In this work we consider first and second order Mean Field Games (MFGs) systems, introduced in \cite...
Mean field games (MFG) and mean field control (MFC) are critical classes of multiagent models for th...
International audienceIn order to lower the computational cost of the variational data assimilation ...
AbstractA multi-step Lagrangian scheme at discrete times is proposed for the approximation of a nonl...
A general decomposition framework for large convex optimization problems based on augmented Lagrangi...
International audienceLinear programming relaxations are central to MAP inference in discrete Markov...
We discuss the application of the augmented Lagrangian method to the convex optimization problem of ...
Many problems from mass transport can be reformulated as variational problems under a prescribed div...
Many problems from mass transport can be reformulated as variational problems under a prescribed div...
This paper is a brief presentation of those Mean Field Games with congestion penalization which have...
Ce rapport présente l'adaptation de l'algorithme ALG2 [1] en vue de résoudre numériquement des jeux ...
This work deals with a numerical method for solving a mean-field type control problem with congestio...
International audienceWe analyze linear convergence of an evolution strategy for constrained optimiz...
A general decomposition framework for large convex optimization problems based on augmented Lagrangi...
This project investigates numerical methods for solving fully coupled forward-backward stochastic di...
In this work we consider first and second order Mean Field Games (MFGs) systems, introduced in \cite...
Mean field games (MFG) and mean field control (MFC) are critical classes of multiagent models for th...
International audienceIn order to lower the computational cost of the variational data assimilation ...
AbstractA multi-step Lagrangian scheme at discrete times is proposed for the approximation of a nonl...
A general decomposition framework for large convex optimization problems based on augmented Lagrangi...
International audienceLinear programming relaxations are central to MAP inference in discrete Markov...