An optimal matching problem for the Euclidean distance

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 the Euclidean distance that each measure is transported. We show that such a prob...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Rossi, Julio Daniel
Publicado: 2014
Materias:
Monge-Kantorovich's mass transport theory
Optimal matching problem
P-Laplacian systems
Euclidean distance
Monge-kantorovich's mass transport theories
Optimal matching
P-Laplacian
p-Laplacian systems
Transport costs
Statistical mechanics
Optimization
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00361410_v46_n1_p233_Mazon
http://hdl.handle.net/20.500.12110/paper_00361410_v46_n1_p233_Mazon
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paper:paper_00361410_v46_n1_p233_Mazon
record_format dspace
spelling paper:paper_00361410_v46_n1_p233_Mazon2023-06-08T15:01:56Z An optimal matching problem for the Euclidean distance Rossi, Julio Daniel Monge-Kantorovich's mass transport theory Optimal matching problem P-Laplacian systems Euclidean distance Monge-kantorovich's mass transport theories Optimal matching P-Laplacian p-Laplacian systems Transport costs Statistical mechanics Optimization 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 the Euclidean distance that each measure is transported. We show that such a problem has a solution with matching measure concentrated on the boundary of the target set. Furthermore we perform a method to approximate the solution of the problem taking the limit as p→∞ in a system of PDEs of p-Laplacian type. © 2014 Society for Industrial and Applied Mathematics. Fil:Rossi, J.D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2014 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00361410_v46_n1_p233_Mazon http://hdl.handle.net/20.500.12110/paper_00361410_v46_n1_p233_Mazon
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Monge-Kantorovich's mass transport theory
Optimal matching problem
P-Laplacian systems
Euclidean distance
Monge-kantorovich's mass transport theories
Optimal matching
P-Laplacian
p-Laplacian systems
Transport costs
Statistical mechanics
Optimization
spellingShingle Monge-Kantorovich's mass transport theory
Optimal matching problem
P-Laplacian systems
Euclidean distance
Monge-kantorovich's mass transport theories
Optimal matching
P-Laplacian
p-Laplacian systems
Transport costs
Statistical mechanics
Optimization
Rossi, Julio Daniel
An optimal matching problem for the Euclidean distance
topic_facet Monge-Kantorovich's mass transport theory
Optimal matching problem
P-Laplacian systems
Euclidean distance
Monge-kantorovich's mass transport theories
Optimal matching
P-Laplacian
p-Laplacian systems
Transport costs
Statistical mechanics
Optimization
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 the Euclidean distance that each measure is transported. We show that such a problem has a solution with matching measure concentrated on the boundary of the target set. Furthermore we perform a method to approximate the solution of the problem taking the limit as p→∞ in a system of PDEs of p-Laplacian type. © 2014 Society for Industrial and Applied Mathematics.
author Rossi, Julio Daniel
author_facet Rossi, Julio Daniel
author_sort Rossi, Julio Daniel
title An optimal matching problem for the Euclidean distance
title_short An optimal matching problem for the Euclidean distance
title_full An optimal matching problem for the Euclidean distance
title_fullStr An optimal matching problem for the Euclidean distance
title_full_unstemmed An optimal matching problem for the Euclidean distance
title_sort optimal matching problem for the euclidean distance
publishDate 2014
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00361410_v46_n1_p233_Mazon
http://hdl.handle.net/20.500.12110/paper_00361410_v46_n1_p233_Mazon
work_keys_str_mv AT rossijuliodaniel anoptimalmatchingproblemfortheeuclideandistance
AT rossijuliodaniel optimalmatchingproblemfortheeuclideandistance
_version_ 1768545039797977088

Ejemplares similares