En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK

Théorie du contrôle et optimisation 98 résultats

Filtrer
Sélectionner : Tous / Aucun
Q
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Advancements in the control of dynamic matching markets - Aouad, Ali (Auteur de la conférence) | CIRM H

Multi angle

This talk will cover two recent advancements in the theory of online algorithms for dynamic matching markets. The first set of results concern a stochastic model of matching with Poisson arrivals and memoryless departures over edge-weighted graphs. The second set of results focus on the incorporation of serial correlation properties in classical online stochastic matching models. We develop new mathematical programming relaxations and correlated rounding schemes, yielding the first constant-factor performance guarantees in such settings.[-]
This talk will cover two recent advancements in the theory of online algorithms for dynamic matching markets. The first set of results concern a stochastic model of matching with Poisson arrivals and memoryless departures over edge-weighted graphs. The second set of results focus on the incorporation of serial correlation properties in classical online stochastic matching models. We develop new mathematical programming relaxations and correlated ...[+]

05C85 ; 90C40 ; 91B68 ; 90C35

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Dynamics of strategic agents and algorithms as PDEs - Hoffmann, Franca (Auteur de la conférence) | CIRM H

Multi angle

We propose a PDE framework for modeling the distribution shift of a strategic population interacting with a learning algorithm. We consider two particular settings one, where the objective of the algorithm and population are aligned, and two, where the algorithm and population have opposite goals. We present convergence analysis for both settings, including three different timescales for the opposing-goal objective dynamics. We illustrate how our framework can accurately model real-world data and show via synthetic examples how it captures sophisticated distribution changes which cannot be modeled with simpler methods.[-]
We propose a PDE framework for modeling the distribution shift of a strategic population interacting with a learning algorithm. We consider two particular settings one, where the objective of the algorithm and population are aligned, and two, where the algorithm and population have opposite goals. We present convergence analysis for both settings, including three different timescales for the opposing-goal objective dynamics. We illustrate how ...[+]

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
We discuss the natural Lagrangian and Eulerian formulations of multi-agent deterministic optimal control problems, analyzing their relations with a novel Kantorovich formulation. We exhibit some equivalence results among the various representations and compare the respective value functions, by combining techniques and ideas from optimal transport, control theory, Young measures and evolution equations in Banach spaces. We further exploit the connections among Lagrangian and Eulerian descriptions to derive consistency results as the number of particles/agents tends to infinity. (In collaboration with Giulia Cavagnari, Stefano Lisini and Carlo Orrieri)[-]
We discuss the natural Lagrangian and Eulerian formulations of multi-agent deterministic optimal control problems, analyzing their relations with a novel Kantorovich formulation. We exhibit some equivalence results among the various representations and compare the respective value functions, by combining techniques and ideas from optimal transport, control theory, Young measures and evolution equations in Banach spaces. We further exploit the ...[+]

49N80 ; 49Q22

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Path constrained unbalanced optimal transport - Charon, Nicolas (Auteur de la conférence) | CIRM H

Multi angle

We will present a variation of the unbalanced optimal transport model and Wasserstein Fisher-Rao metric on positive measures, in which one imposes additional affine integral equality constraints. This is motivated by multiple examples from mathematics and applied mathematics that naturally involve comparing and interpolating between two measures in particular subspaces or in which one enforces some constraints on the interpolating path itself. Building from the dynamic formulation of the Wasserstein Fisher-Rao metric, we introduce a class of constrained problems where the interpolating measure at each time must satisfy a given stationary or time-dependent constraint in measure space. We then specifically derive general conditions under which the existence of minimizing paths can be guaranteed, and then examine some of the properties of the resulting models and the metrics that are induced on measures. We will further hint at the potential of this approach in various specific situations such as the comparison of measures with prescribed moments, the unbalanced optimal transport under global mass evolution or obstacle constraints, and emphasize some connections with the construction of Riemannian metrics on the space of all convex shapes in an Euclidean space. We shall conclude with a few remaining unsolved/open questions.[-]
We will present a variation of the unbalanced optimal transport model and Wasserstein Fisher-Rao metric on positive measures, in which one imposes additional affine integral equality constraints. This is motivated by multiple examples from mathematics and applied mathematics that naturally involve comparing and interpolating between two measures in particular subspaces or in which one enforces some constraints on the interpolating path itself. ...[+]

49Q22

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Barycenters for transport costs - Delon, Julie (Auteur de la conférence) | CIRM H

Multi angle

optimal transport; Wasserstein barycenters

60A10 ; 49J40 ; 49K21 ; 49N15

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

On the space highway to Lagrange points! - Trélat, Emmanuel (Auteur de la conférence) | CIRM H

Post-edited

Everything is under control: mathematics optimize everyday life.
In an empirical way we are able to do many things with more or less efficiency or success. When one wants to achieve a parallel parking, consequences may sometimes be ridiculous... But when one wants to launch a rocket or plan interplanetary missions, better is to be sure of what we do.
Control theory is a branch of mathematics that allows to control, optimize and guide systems on which one can act by means of a control, like for example a car, a robot, a space shuttle, a chemical reaction or in more general a process that one aims at steering to some desired target state.
Emmanuel Trélat will overview the range of applications of that theory through several examples, sometimes funny, but also historical. He will show you that the study of simple cases of our everyday life, far from insignificant, allow to approach problems like the orbit transfer or interplanetary mission design.[-]
Everything is under control: mathematics optimize everyday life.
In an empirical way we are able to do many things with more or less efficiency or success. When one wants to achieve a parallel parking, consequences may sometimes be ridiculous... But when one wants to launch a rocket or plan interplanetary missions, better is to be sure of what we do.
Control theory is a branch of mathematics that allows to control, optimize and guide systems on ...[+]

49J15 ; 93B40 ; 93B27 ; 93B50 ; 65H20 ; 90C31 ; 37N05 ; 37N35

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Extended Lagrange spaces and optimal control - Mehrmann, Volker (Auteur de la conférence) | CIRM H

Post-edited

Mathematical modeling and numerical mathematics of today is very much Lagrangian and modern automated modeling techniques lead to differential-algebraic systems. The optimal control for such systems in general cannot be obtained using the classical Euler-Lagrange approach or the maximum principle, but it is shown how this approach can be extended.

93C05 ; 93C15 ; 49K15 ; 34H05

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
2y

The moment-LP and moment-SOS hierarchies - Lasserre, Jean Bernard (Auteur de la conférence) | CIRM H

Post-edited

We review basic properties of the moment-LP and moment-SOS hierarchies for polynomial optimization and compare them. We also illustrate how to use such a methodology in two applications outside optimization. Namely :
- for approximating (as claosely as desired in a strong sens) set defined with quantifiers of the form
$R_1 =\{ x\in B : f(x,y)\leq 0 $ for all $y$ such that $(x,y) \in K \}$.
$D_1 =\{ x\in B : f(x,y)\leq 0 $ for some $y$ such that $(x,y) \in K \}$.
by a hierarchy of inner sublevel set approximations
$\Theta_k = \left \{ x\in B : J_k(x)\leq 0 \right \}\subset R_f$.
or outer sublevel set approximations
$\Theta_k = \left \{ x\in B : J_k(x)\leq 0 \right \}\supset D_f$.
for some polynomiales $(J_k)$ of increasing degree :
- for computing convex polynomial underestimators of a given polynomial $f$ on a box $B \subset R^n$.[-]
We review basic properties of the moment-LP and moment-SOS hierarchies for polynomial optimization and compare them. We also illustrate how to use such a methodology in two applications outside optimization. Namely :
- for approximating (as claosely as desired in a strong sens) set defined with quantifiers of the form
$R_1 =\{ x\in B : f(x,y)\leq 0 $ for all $y$ such that $(x,y) \in K \}$.
$D_1 =\{ x\in B : f(x,y)\leq 0 $ for ...[+]

44A60 ; 90C22

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
We combine discrete empirical interpolation techniques, global mode decomposition methods, and local multiscale methods, such as the Generalized Multiscale Finite Element Method (GMsFEM), to reduce the computational complexity associated with nonlinear flows in highly-heterogeneous porous media. To solve the nonlinear governing equations, we employ the GMsFEM to represent the solution on a coarse grid with multiscale basis functions and apply proper orthogonal decomposition on a coarse grid. Computing the GMsFEM solution involves calculating the residual and the Jacobian on the fine grid. As such, we use local and global empirical interpolation concepts to circumvent performing these computations on the fine grid. The resulting reduced-order approach enables a significant reduction in the flow problem size while accurately capturing the behavior of fully-resolved solutions. We consider several numerical examples of nonlinear multiscale partial differential equations that are numerically integrated using fully-implicit time marching schemes to demonstrate the capability of the proposed model reduction approach to speed up simulations of nonlinear flows in high-contrast porous media.

Keywords: generalized multiscale finite element method - nonlinear PDEs - heterogeneous porous media - discrete empirical interpolation - proper orthogonal decomposition[-]
We combine discrete empirical interpolation techniques, global mode decomposition methods, and local multiscale methods, such as the Generalized Multiscale Finite Element Method (GMsFEM), to reduce the computational complexity associated with nonlinear flows in highly-heterogeneous porous media. To solve the nonlinear governing equations, we employ the GMsFEM to represent the solution on a coarse grid with multiscale basis functions and apply ...[+]

35-XX ; 65-XX ; 86-XX

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Dirichlet-Neumann shape optimization problems - Buttazzo, Giuseppe (Auteur de la conférence) | CIRM H

Multi angle

We consider spectral optimization problems of the form

$\min\lbrace\lambda_1(\Omega;D):\Omega\subset D,|\Omega|=1\rbrace$

where $D$ is a given subset of the Euclidean space $\textbf{R}^d$. Here $\lambda_1(\Omega;D)$ is the first eigenvalue of the Laplace operator $-\Delta$ with Dirichlet conditions on $\partial\Omega\cap D$ and Neumann or Robin conditions on $\partial\Omega\cap\partial D$. The equivalent variational formulation

$\lambda_1(\Omega;D)=\min\lbrace\int_\Omega|\nabla u|^2dx+k\int_{\partial D}u^2d\mathcal{H}^{d-1}:$

$u\in H^1(D),u=0$ on $\partial\Omega\cap D,||u||_{L^2(\Omega)}=1\rbrace$

reminds the classical drop problems, where the first eigenvalue replaces the total variation functional. We prove an existence result for general shape cost functionals and we show some qualitative properties of the optimal domains. The case of Dirichlet condition on a $\textit{fixed}$ part and of Neumann condition on the $\textit{free}$ part of the boundary is also considered[-]
We consider spectral optimization problems of the form

$\min\lbrace\lambda_1(\Omega;D):\Omega\subset D,|\Omega|=1\rbrace$

where $D$ is a given subset of the Euclidean space $\textbf{R}^d$. Here $\lambda_1(\Omega;D)$ is the first eigenvalue of the Laplace operator $-\Delta$ with Dirichlet conditions on $\partial\Omega\cap D$ and Neumann or Robin conditions on $\partial\Omega\cap\partial D$. The equivalent variational formulation

$\lam...[+]

49Q10 ; 49J20 ; 49N45

Sélection Signaler une erreur