Optimal matching problems with costs given by Finsler distances

In this paper we deal with an optimal matching problem, that is, we want to transport two commodities (modeled by two measures that encode the spacial distribution of each commodity) to a given location, where they will match, minimizing the total transport cost that in our case is given by the sum...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Rossi, Julio Daniel
Publicado: 2015
Materias:
MongeKantorovichs mass transport theory
Optimal matching problem
pLaplacian systems
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15340392_v14_n1_p229_Mazon
http://hdl.handle.net/20.500.12110/paper_15340392_v14_n1_p229_Mazon
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paper:paper_15340392_v14_n1_p229_Mazon
record_format dspace
spelling paper:paper_15340392_v14_n1_p229_Mazon2023-06-08T16:20:00Z Optimal matching problems with costs given by Finsler distances Rossi, Julio Daniel MongeKantorovichs mass transport theory Optimal matching problem pLaplacian systems In this paper we deal with an optimal matching problem, that is, we want to transport two commodities (modeled by two measures that encode the spacial distribution of each commodity) to a given location, where they will match, minimizing the total transport cost that in our case is given by the sum of the two different Finsler distances that the two measures are transported. We perform a method to approximate the matching measure and the pair of Kantorovich potentials associated with this problem taking limit as p → ∞ in a variational system of p-Laplacian type. Fil:Rossi, J.D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2015 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15340392_v14_n1_p229_Mazon http://hdl.handle.net/20.500.12110/paper_15340392_v14_n1_p229_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 MongeKantorovichs mass transport theory
Optimal matching problem
pLaplacian systems
spellingShingle MongeKantorovichs mass transport theory
Optimal matching problem
pLaplacian systems
Rossi, Julio Daniel
Optimal matching problems with costs given by Finsler distances
topic_facet MongeKantorovichs mass transport theory
Optimal matching problem
pLaplacian systems
description In this paper we deal with an optimal matching problem, that is, we want to transport two commodities (modeled by two measures that encode the spacial distribution of each commodity) to a given location, where they will match, minimizing the total transport cost that in our case is given by the sum of the two different Finsler distances that the two measures are transported. We perform a method to approximate the matching measure and the pair of Kantorovich potentials associated with this problem taking limit as p → ∞ in a variational system of p-Laplacian type.
author Rossi, Julio Daniel
author_facet Rossi, Julio Daniel
author_sort Rossi, Julio Daniel
title Optimal matching problems with costs given by Finsler distances
title_short Optimal matching problems with costs given by Finsler distances
title_full Optimal matching problems with costs given by Finsler distances
title_fullStr Optimal matching problems with costs given by Finsler distances
title_full_unstemmed Optimal matching problems with costs given by Finsler distances
title_sort optimal matching problems with costs given by finsler distances
publishDate 2015
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15340392_v14_n1_p229_Mazon
http://hdl.handle.net/20.500.12110/paper_15340392_v14_n1_p229_Mazon
work_keys_str_mv AT rossijuliodaniel optimalmatchingproblemswithcostsgivenbyfinslerdistances
_version_ 1768542238546067456

Ejemplares similares