An optimal matching problem
Ivar Ekeland
Abstract
Given two measured spaces (X,dx), (Y,dy) and a third space Z, given two functions u(x,z) and v(x,z), we study the problem of finding two maps s from X to Z and t from Y to Z such that the images s(dx) and t(dy) coincide, and the integral of u(x,s(x))dx+v(y,t(y))dy is maximal. We give condition on u and v for which there is a unique solution.
Create a lesson
Related papers
Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates
David Martínez-Rubio, Cristóbal Guzmán
The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings
David Martínez-Rubio, Brian Bullins, Cristóbal Guzmán et al.
Complexity Of Output Feedback Stabilization
Amir Ali Ahmadi, Abraar Chaudhry, Ijay Narang et al.
Convergence rate of the moment-SOS hierarchy for univariate polynomial optimization
Didier Henrion, Mohab Safey El Din
Geometry and Convergence of Quadratically Regularized Optimal Transport I
Alberto González-Sanz, Marcel Nutz
Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems
Julian Niederer, Christoph Hansknecht, Andreas Potschka et al.