Optimal transportation for the determinant
Guillaume Carlier, Bruno Nazaret
Abstract
Among 3-valued triples of random vectors (X,Y,Z) having fixed marginal probability laws, what is the best way to jointly draw (X,Y,Z) in such a way that the simplex generated by (X,Y,Z) has maximal average volume? Motivated by this simple question, we study optimal transportation problems with several marginals when the objective function is the determinant or its absolute value.
Create a lesson
Related papers
UGM: A Unified Framework and New Perspectives for Accelerated Gradient Methods in Smooth and Strongly Convex Optimization
Danqing Zhou, Shiqian Ma, Junfeng Yang
When MILP Beats QP: Piecewise-Linear Reformulations of Sequentially Coupled Bilinear Programs
Quentin Ploussard, Maris Usis, Oluwabunmi Iwakin et al.
Marine Autonomous Vehicle Fleet Scheduling to Maximise Scientific Impact
Mehdi El Krari, Jonathan Smith, Maria Fox
Asymptotic consensus and flocking under decaying persistent excitation on rooted digraphs
Chiara Cicolani, Elisa Continelli, Cristina Pignotti
Co-Optimized Generation, Transmission, and Storage Expansion: System Value and Optimal Duration of Pumped-Storage Hydropower
Rafael Benchimol Klausner, Rafael Kelman
Randomized Quasi-Gauss--Newton Methods for Solving General Nonlinear Equations
Chengchang Liu, Luo Luo