An Optimal Matching Problem for the Euclidean Distance

DOI10.1137/120901465zbMath1297.49006OpenAlexW2089685221MaRDI QIDQ5415058

Julio D. Rossi, Julián Toledo, José M. Mazón Ruiz

Publication date: 9 May 2014

Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120901465

zbMATH Keywords

\(p\)-Laplacian systemsoptimal matching problemMonge-Kantorovich mass transport theory

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Existence theories for optimal control problems involving partial differential equations (49J20) Quasilinear elliptic equations with (p)-Laplacian (35J92)

Related Items (9)

An optimal matching problem with constraints ⋮ Mini-workshop: The \(p\)-Laplacian operator and applications. Abstracts from the workshop held February 10--16, 2013. ⋮ Optimal Mass Transport on Metric Graphs ⋮ Optimal mass transportation for costs given by Finsler distances via \(p\)-Laplacian approximations ⋮ Existence and upper semi-continuity of pullback attractors of a p-Laplacian equation with delay ⋮ Continuity properties of pullback and pullback exponential attractors for non-autonomous plate with \(p\)-Laplacian ⋮ On the Uniqueness and Numerical Approximations for a Matching Problem ⋮ Mass transport problems for the Euclidean distance obtained as limits of \(p\)-Laplacian type problems with obstacles ⋮ Optimal matching problems with costs given by Finsler distances

This page was built for publication: An Optimal Matching Problem for the Euclidean Distance