Displaying similar documents to “A saddle-point approach to the Monge-Kantorovich optimal transport problem”

A saddle-point approach to the Monge-Kantorovich optimal transport problem

Christian Léonard (2011)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

The Monge-Kantorovich problem is revisited by means of a variant of the saddle-point method without appealing to -conjugates. A new abstract characterization of the optimal plans is obtained in the case where the cost function takes infinite values. It leads us to new explicit sufficient and necessary optimality conditions. As by-products, we obtain a new proof of the well-known Kantorovich dual equality and an improvement of the convergence of the minimizing sequences.

Optimal Multiphase Transportation with prescribed momentum

Yann Brenier, Marjolaine Puel (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

A multiphase generalization of the Monge–Kantorovich optimal transportation problem is addressed. Existence of optimal solutions is established. The optimality equations are related to classical Electrodynamics.

Two dimensional optimal transportation problem for a distance cost with a convex constraint

Ping Chen, Feida Jiang, Xiaoping Yang (2013)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We first prove existence and uniqueness of optimal transportation maps for the Monge’s problem associated to a cost function with a strictly convex constraint in the Euclidean plane ℝ. The cost function coincides with the Euclidean distance if the displacement  −  belongs to a given strictly convex set, and it is infinite otherwise. Secondly, we give a sufficient condition for existence and uniqueness of optimal transportation maps for the original Monge’s problem in ℝ. Finally, we get...

Characterization of optimal shapes and masses through Monge-Kantorovich equation

Guy Bouchitté, Giuseppe Buttazzo (2001)

Journal of the European Mathematical Society

Similarity:

We study some problems of optimal distribution of masses, and we show that they can be characterized by a suitable Monge-Kantorovich equation. In the case of scalar state functions, we show the equivalence with a mass transport problem, emphasizing its geometrical approach through geodesics. The case of elasticity, where the state function is vector valued, is also considered. In both cases some examples are presented.

Mean-Field Optimal Control

Massimo Fornasier, Francesco Solombrino (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We introduce the concept of which is the rigorous limit process connecting finite dimensional optimal control problems with ODE constraints modeling multi-agent interactions to an infinite dimensional optimal control problem with a constraint given by a PDE of Vlasov-type, governing the dynamics of the probability distribution of interacting agents. While in the classical mean-field theory one studies the behavior of a large number of small individuals with each other, by simplifying...

Optimal control of the bidomain system (III): Existence of minimizers and first-order optimality conditions

Karl Kunisch, Marcus Wagner (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

We consider optimal control problems for the bidomain equations of cardiac electrophysiology together with two-variable ionic models, the Rogers–McCulloch model. After ensuring the existence of global minimizers, we provide a rigorous proof for the system of first-order necessary optimality conditions. The proof is based on a stability estimate for the primal equations and an existence theorem for weak solutions of the adjoint system.

On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems

Diptesh Ghosh, Gerard Sierksma (2003)

Applicationes Mathematicae

Similarity:

This paper studies the complexity of sensitivity analysis for optimal and ε-optimal solutions to general 0-1 combinatorial optimization problems with min-max objectives. Van Hoesel and Wagelmans [9] have studied the complexity of sensitivity analysis of optimal and ε-optimal solutions to min-sum problems, and Ramaswamy et al. [17] the complexity of sensitivity analysis of optimal solutions to min-max problems. We show that under some mild assumptions the sensitivity analysis of ε-optimal...

Transport problems and disintegration maps

Luca Granieri, Francesco Maddalena (2013)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

By disintegration of transport plans it is introduced the notion of transport class. This allows to consider the Monge problem as a particular case of the Kantorovich transport problem, once a transport class is fixed. The transport problem constrained to a fixed transport class is equivalent to an abstract Monge problem over a Wasserstein space of probability measures. Concerning solvability of this kind of constrained problems, it turns out that in some sense the Monge problem corresponds...

Convergence of optimal strategies under proportional transaction costs

Rafał Kucharski (2008)

Banach Center Publications

Similarity:

A discrete-time financial market model with finite time horizon and transaction costs is considered, with a sequence of investors whose preferences are described by a convergent sequence of strictly increasing and strictly concave utility functions. Proportional costs are approximated by strictly convex costs. Existence of the optimal consumption-investment strategies is obtained, as well as convergence of the value functions and convergence of subsequences of optimal strategies. ...