One functional-analytical idea by Alexandrov in convex geometry.
The aim of the present paper is to study problems of optimal design in mechanics, whose variational form is given by inequalities expressing the principle of virtual power in its inequality form. The elliptic, linear symmetric operators as well as convex sets of possible states depend on the control parameter. The existence theorem for the optimal control is applied to design problems for an elastic laminated plate whose variable thickness appears as a control variable.
We study the Monge transportation problem when the cost is the action associated to a Lagrangian function on a compact manifold. We show that the transportation can be interpolated by a Lipschitz lamination. We describe several direct variational problems the minimizers of which are these Lipschitz laminations. We prove the existence of an optimal transport map when the transported measure is absolutely continuous. We explain the relations with Mather’s minimal measures.
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.
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.
In the framework of transport theory, we are interested in the following optimization problem: given the distributions of working people and of their working places in an urban area, build a transportation network (such as a railway or an underground system) which minimizes a functional depending on the geometry of the network through a particular cost function. The functional is defined as the Wasserstein distance of from with respect to a metric which depends on the transportation network....
In the framework of transport theory, we are interested in the following optimization problem: given the distributions µ+ of working people and µ- of their working places in an urban area, build a transportation network (such as a railway or an underground system) which minimizes a functional depending on the geometry of the network through a particular cost function. The functional is defined as the Wasserstein distance of µ+ from µ- with respect to a metric which depends on the transportation...
Among -valued triples of random vectors (X,Y,Z) having fixed marginal probability laws, what is the best way to jointly draw (X,Y,Z) in such a way that the simplex generated by (X,Y,Z) has maximal average volume? Motivated by this simple question, we study optimal transportation problems with several marginals when the objective function is the determinant or its absolute value.
The scalar nonconvex variational problems of the minimum-energy type on Sobolev spaces are studied. As the Euler–Lagrange equation dramatically looses selectivity when extended in terms of the Young measures, the correct optimality conditions are sought by means of the convex compactification theory. It turns out that these conditions basically combine one part from the Euler–Lagrange equation with one part from the Weierstrass condition.
Given a metric space we consider a general class of functionals which measure the cost of a path in joining two given points and , providing abstract existence results for optimal paths. The results are then applied to the case when is aWasserstein space of probabilities on a given set and the cost of a path depends on the value of classical functionals over measures. Conditions for linking arbitrary extremal measures and by means of finite cost paths are given.