On optimal matching measures for matching problems related to the Euclidean distance

Title:

On optimal matching measures for matching problems related to the Euclidean distance

Creator:

Mazón, José Manuel, Rossi, Julio Daniel, and Toledo, Julián

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:2d03d7d2-f5bb-4b50-9de0-b8969bee2bc3
uuid:2d03d7d2-f5bb-4b50-9de0-b8969bee2bc3
doi:10.21136/MB.2014.144132

Subject:

mass transport, Monge-Kantorovich problem, and p-Laplacian equation

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

We deal with an optimal matching problem, that is, we want to transport two measures to a given place (the target set) where they will match, minimizing the total transport cost that in our case is given by the sum of two different multiples of the Euclidean distance that each measure is transported. We show that such a problem has a solution with an optimal matching measure supported in the target set. This result can be proved by an approximation procedure using a p-Laplacian system. We prove that any optimal matching measure for this problem is supported on the boundary of the target set when the two multiples that affect the Euclidean distances involved in the cost are different. Moreover, we present simple examples showing uniqueness or non-uniqueness of the optimal measure.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

553-566

Source:

Mathematica bohemica | 2014 Volume:139 | Number:4

Harvested from:

CDK

Metadata only:

false