A new class of costs for optimal transport planning

We study a class of optimal transport planning problems where the reference cost involves a non-linear function G ( x, p ) representing the transport cost between the Dirac measure δ x and a target probability p . This allows to consider interesting models which favour multi-valued transport maps in...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of applied mathematics Vol. 30; no. 6; pp. 1229 - 1263
Main Authors ALIBERT, J.-J., BOUCHITTÉ, G., CHAMPION, T.
Format Journal Article
LanguageEnglish
Published Cambridge Cambridge University Press 01.12.2019
Subjects
Online AccessGet full text
ISSN0956-7925
1469-4425
DOI10.1017/S0956792518000669

Cover

Loading…
Abstract We study a class of optimal transport planning problems where the reference cost involves a non-linear function G ( x, p ) representing the transport cost between the Dirac measure δ x and a target probability p . This allows to consider interesting models which favour multi-valued transport maps in contrast with the classical linear case ( $G(x,p)=\int c(x,y)dp$ ) where finding single-valued optimal transport is a key issue. We present an existence result and a general duality principle which apply to many examples. Moreover, under a suitable subadditivity condition, we derive a Kantorovich–Rubinstein version of the dual problem allowing to show existence in some regular cases. We also consider the well studied case of Martingale transport and present some new perspectives for the existence of dual solutions in connection with Γ-convergence theory.
AbstractList We study a class of optimal transport planning problems where the reference cost involves a non-linear function G ( x, p ) representing the transport cost between the Dirac measure δ x and a target probability p . This allows to consider interesting models which favour multi-valued transport maps in contrast with the classical linear case ( $G(x,p)=\int c(x,y)dp$ ) where finding single-valued optimal transport is a key issue. We present an existence result and a general duality principle which apply to many examples. Moreover, under a suitable subadditivity condition, we derive a Kantorovich–Rubinstein version of the dual problem allowing to show existence in some regular cases. We also consider the well studied case of Martingale transport and present some new perspectives for the existence of dual solutions in connection with Γ-convergence theory.
We study a class of optimal transport planning problems where the reference cost involves a non-linear function G(x, p) representing the transport cost between the Dirac measure δx and a target probability p. This allows to consider interesting models which favour multi-valued transport maps in contrast with the classical linear case (\(G(x,p)=\int c(x,y)dp\)) where finding single-valued optimal transport is a key issue. We present an existence result and a general duality principle which apply to many examples. Moreover, under a suitable subadditivity condition, we derive a Kantorovich–Rubinstein version of the dual problem allowing to show existence in some regular cases. We also consider the well studied case of Martingale transport and present some new perspectives for the existence of dual solutions in connection with Γ-convergence theory.
Author CHAMPION, T.
ALIBERT, J.-J.
BOUCHITTÉ, G.
Author_xml – sequence: 1
  givenname: J.-J.
  surname: ALIBERT
  fullname: ALIBERT, J.-J.
– sequence: 2
  givenname: G.
  orcidid: 0000-0002-8551-2640
  surname: BOUCHITTÉ
  fullname: BOUCHITTÉ, G.
– sequence: 3
  givenname: T.
  surname: CHAMPION
  fullname: CHAMPION, T.
BookMark eNp9UE1LAzEUDFLBtvoDvAU8r76Xr90cS_ELCh7U85LdJrJlTdYkRfz3ptSTgofHO8zMezOzIDMfvCXkEuEaAeubZ9BS1ZpJbABAKX1C5iiUroRgckbmB7g64GdkkdIOADnUek74inr7SfvRpESDo31IOVEXIg1THt7NSHM0Pk0hZjqNxvvBv52TU2fGZC9-9pK83t2-rB-qzdP943q1qXqOKledZawz3IJDhx2vjQS-7XjxI3plO2a50bCVVpqmjDBau0ZsheO1FKrpkC_J1fHuFMPH3qbc7sI--vKyZZwhai60Kqz6yOpjSCla1_ZDNnkIvjgfxhahPTTU_mmoKPGXcoolcvz6R_MND8pobg
CitedBy_id crossref_primary_10_1017_prm_2021_27
crossref_primary_10_1051_ps_2020013
crossref_primary_10_1214_19_AIHP1014
crossref_primary_10_1134_S0016266323040019
crossref_primary_10_1134_S0001434622090048
crossref_primary_10_1112_plms_12302
crossref_primary_10_1137_22M1501301
crossref_primary_10_4213_sm9920
crossref_primary_10_1007_s00526_019_1624_y
crossref_primary_10_1134_S1064562422700107
crossref_primary_10_1007_s00780_020_00426_3
crossref_primary_10_1080_14697688_2024_2403540
crossref_primary_10_1214_20_ECP292
crossref_primary_10_4213_mzm13545
crossref_primary_10_4213_rm10074
crossref_primary_10_4213_rm10074e
crossref_primary_10_1111_mafi_12328
crossref_primary_10_1214_22_EJP846
crossref_primary_10_1214_23_ECP525
crossref_primary_10_4213_faa4124
crossref_primary_10_4213_sm9920e
Cites_doi 10.1007/s00780-013-0205-8
10.1007/BFb0087685
10.1016/j.jfa.2017.08.015
10.1214/15-AIHP700
10.1111/j.1467-9965.2010.00473.x
10.1007/978-3-540-71050-9
10.1007/BF00387715
10.4213/mzm10896
10.1214/16-AOP1131
10.1007/BF02249263
10.1214/14-AOP966
10.1214/aoms/1177700153
10.1016/j.anihpb.2006.05.003
10.1007/978-3-319-20828-2
ContentType Journal Article
Copyright Cambridge University Press 2018
Copyright_xml – notice: Cambridge University Press 2018
DBID AAYXX
CITATION
3V.
7SC
7XB
88I
8AL
8FD
8FE
8FG
8FK
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L6V
L7M
L~C
L~D
M0N
M2P
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
S0W
DOI 10.1017/S0956792518000669
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Materials Science & Engineering
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Central
Technology collection
ProQuest One Community College
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Science Database
Engineering Database
ProQuest advanced technologies & aerospace journals
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering collection
ProQuest Central Basic
DELNET Engineering & Technology Collection
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Engineering Collection
Advanced Technologies & Aerospace Collection
ProQuest Computing
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest DELNET Engineering and Technology Collection
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
DatabaseTitleList CrossRef
Computer Science Database
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1469-4425
EndPage 1263
ExternalDocumentID 10_1017_S0956792518000669
GroupedDBID -1D
-1F
-2P
-2V
-E.
-~6
-~N
.DC
.FH
09C
09E
0E1
0R~
29G
4.4
5GY
5VS
6~7
74X
74Y
7~V
88I
8FE
8FG
8R4
8R5
9M5
AAAZR
AABES
AABWE
AACJH
AAGFV
AAKNA
AAKTX
AAMNQ
AANRG
AARAB
AASVR
AATMM
AAUIS
AAUKB
AAYXX
ABBXD
ABBZL
ABEFU
ABGDZ
ABHFL
ABITZ
ABJCF
ABJNI
ABKKG
ABMWE
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABVFV
ABVKB
ABVZP
ABXAU
ABXHF
ABZCX
ABZUI
ACAJB
ACBMC
ACDLN
ACEJA
ACETC
ACGFO
ACGFS
ACGOD
ACIMK
ACIWK
ACOZI
ACRPL
ACUIJ
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADFRT
ADKIL
ADNMO
ADOVH
ADOVT
ADVJH
AEBAK
AEBPU
AEHGV
AEMFK
AEMTW
AENCP
AENEX
AENGE
AFFUJ
AFKQG
AFKRA
AFLOS
AFLVW
AFUTZ
AFZFC
AGABE
AGBYD
AGJUD
AGLWM
AGQPQ
AHQXX
AHRGI
AI.
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
AKMAY
AKZCZ
ALMA_UNASSIGNED_HOLDINGS
ALWZO
AMVHM
ANOYL
AQJOH
ARABE
ARAPS
ARZZG
ATUCA
AUXHV
AYIQA
AZQEC
BBLKV
BCGOX
BENPR
BESQT
BGHMG
BGLVJ
BJBOZ
BLZWO
BMAJL
BPHCQ
BQFHP
C0O
CAG
CBIIA
CCPQU
CCQAD
CCUQV
CDIZJ
CFAFE
CFBFF
CGQII
CHEAL
CITATION
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EGQIC
EJD
F5P
GNUQQ
GROUPED_DOAJ
HCIFZ
HG-
HST
HZ~
I.6
I.7
I.9
IH6
IOEEP
IOO
IPYYG
IS6
I~P
J36
J38
J3A
JHPGK
JQKCU
K6V
K7-
KAFGG
KCGVB
KFECR
L6V
L98
LHUNA
LW7
M-V
M2P
M7S
M7~
M8.
NIKVX
NMFBF
NZEOI
O9-
OYBOY
P2P
P62
PHGZM
PHGZT
PQQKQ
PROAC
PTHSS
PYCCK
Q2X
RAMDC
RCA
RIG
ROL
RR0
S0W
S6-
S6U
SAAAG
T9M
UT1
VH1
VOH
WFFJZ
WQ3
WXU
WYP
ZDLDU
ZJOSE
ZMEZD
ZYDXJ
~V1
3V.
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
M0N
PKEHL
PQEST
PQGLB
PQUKI
PRINS
PUEGO
Q9U
ID FETCH-LOGICAL-c316t-be22ba3e0f1f1b37a503db34254c6eb2e3a90d5e5a8e5a4a99f84d4f375468b13
IEDL.DBID 8FG
ISSN 0956-7925
IngestDate Sun Sep 07 11:28:29 EDT 2025
Thu Apr 24 22:58:43 EDT 2025
Tue Jul 01 01:07:13 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
License https://www.cambridge.org/core/terms
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c316t-be22ba3e0f1f1b37a503db34254c6eb2e3a90d5e5a8e5a4a99f84d4f375468b13
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-8551-2640
OpenAccessLink https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E9DF63870C6B0524E6DB57B9FA3E4C03/S0956792518000669a.pdf/div-class-title-a-new-class-of-costs-for-optimal-transport-planning-div.pdf
PQID 2321193496
PQPubID 37129
PageCount 35
ParticipantIDs proquest_journals_2321193496
crossref_citationtrail_10_1017_S0956792518000669
crossref_primary_10_1017_S0956792518000669
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2019-12-00
20191201
PublicationDateYYYYMMDD 2019-12-01
PublicationDate_xml – month: 12
  year: 2019
  text: 2019-12-00
PublicationDecade 2010
PublicationPlace Cambridge
PublicationPlace_xml – name: Cambridge
PublicationTitle European journal of applied mathematics
PublicationYear 2019
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References S0956792518000669_ref3
Zaev (S0956792518000669_ref20) 2015; 98
S0956792518000669_ref5
S0956792518000669_ref4
Villani (S0956792518000669_ref18) 2003; 58
Auslender (S0956792518000669_ref2) 2003
S0956792518000669_ref12
S0956792518000669_ref11
S0956792518000669_ref10
S0956792518000669_ref16
S0956792518000669_ref15
S0956792518000669_ref14
S0956792518000669_ref13
S0956792518000669_ref7
Attouch (S0956792518000669_ref1) 1984
S0956792518000669_ref19
S0956792518000669_ref6
S0956792518000669_ref9
S0956792518000669_ref8
S0956792518000669_ref17
References_xml – ident: S0956792518000669_ref4
  doi: 10.1007/s00780-013-0205-8
– ident: S0956792518000669_ref8
  doi: 10.1007/BFb0087685
– ident: S0956792518000669_ref11
  doi: 10.1016/j.jfa.2017.08.015
– ident: S0956792518000669_ref3
– ident: S0956792518000669_ref13
  doi: 10.1214/15-AIHP700
– ident: S0956792518000669_ref12
  doi: 10.1111/j.1467-9965.2010.00473.x
– ident: S0956792518000669_ref19
  doi: 10.1007/978-3-540-71050-9
– ident: S0956792518000669_ref9
  doi: 10.1007/BF00387715
– volume: 98
  start-page: 664
  year: 2015
  ident: S0956792518000669_ref20
  article-title: On the Monge-Kantorovich problem with additional linear constraints
  publication-title: Mat. Zametki
  doi: 10.4213/mzm10896
– volume-title: Asymptotic Cones and Functions in Optimization and Variational Inequalities
  year: 2003
  ident: S0956792518000669_ref2
– ident: S0956792518000669_ref7
  doi: 10.1214/16-AOP1131
– ident: S0956792518000669_ref14
  doi: 10.1007/BF02249263
– volume-title: Variational Convergence for Functions and Operators
  year: 1984
  ident: S0956792518000669_ref1
– volume: 58
  volume-title: Topics in Optimal Transportation
  year: 2003
  ident: S0956792518000669_ref18
– ident: S0956792518000669_ref5
  doi: 10.1214/14-AOP966
– ident: S0956792518000669_ref10
– ident: S0956792518000669_ref6
– ident: S0956792518000669_ref17
  doi: 10.1214/aoms/1177700153
– ident: S0956792518000669_ref15
  doi: 10.1016/j.anihpb.2006.05.003
– ident: S0956792518000669_ref16
  doi: 10.1007/978-3-319-20828-2
SSID ssj0013079
Score 2.3095176
Snippet We study a class of optimal transport planning problems where the reference cost involves a non-linear function G ( x, p ) representing the transport cost...
We study a class of optimal transport planning problems where the reference cost involves a non-linear function G(x, p) representing the transport cost between...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 1229
SubjectTerms Applied mathematics
Duality principle
Linear functions
Martingales
Transportation planning
Title A new class of costs for optimal transport planning
URI https://www.proquest.com/docview/2321193496
Volume 30
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV09T8MwED1Bu8CA-BSFUnlgQrKIYyexJ1RQS4XUCiEqdYvsxJmgKST8f86p0wohdcjixEN88d073-U9gFuWW62kFjTkEafCGkONDHOqEiMTbRJrtTsamM7iyVy8LKKFP3CrfFtl6xMbR52XmTsjv8fIzxBsCBU_rL6oU41y1VUvobEPXYaRxn3ncvy8rSIEW669RIVRW9VsKKNx0I0x2YRd9Tcu_XXLTawZH8ORB4lkuLbqCezZ5SkcTjcMq9UZ8CFBQEwyB35JWZCsrOqKIAIlJTqBT5xdt7TlZOWFic5hPh69P02oF0CgGWdxTY0NQ6O5DQpWMMMTHQU8Nxy3mchiTIkt1yrIIxtpiZfQShVS5KJwsraxNIxfQGdZLu0lEEQRkmN6wIIMEZBIlEQ75JHBdMH9Ph30IGhfP808O7gTqfhI121gSfpvxXpwt5myWlNj7Hq4365p6ndJlW5terX79jUcIFBR6zaSPnTq7x97g2CgNoPG4gPoPo5mr2-_m7GvPQ
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT4NAEJ5oe1APxmesVt2DXkyIwC6wezCmaptW28aYmnjDXVhOWqpgjH_K3-hsAZvGpDcPXBaWhJlh5pudF8CJE2spuGSWSz1qMa2UpbgbWyJQPJAq0Fqao4HB0O8-stsn72kJvqtaGJNWWenEqaKO08ickZ-j5XcQbDDhX07eLDM1ykRXqxEahVjc6a9PdNmyi94N8vfUdTvt0XXXKqcKWBF1_NxS2nWVpNpOnMRRNJCeTWNFUXZZ5KOfqakUduxpT3K8mBQi4SxmiZkV63PlUHzvMtSZqWitQf2qPbx_mMUt7Fl3v0C4XhVHnTapxkWz5vCpoRfzlnDeEEytW2cD1ktYSlqFHG3Ckh5vwdrgt6drtg20RRCCk8jAbZImJEqzPCOIeUmKaucVd-dVo3QyKUch7cDjvxBnF2rjdKz3gCBu4RQdEseOEHOxQHDkfOwpdFBMwbbdALv6_DAq-5GbsRgvYZF4FoR_KNaAs98tk6IZx6KHmxVNw_K_zMKZFO0vvn0MK93RoB_2e8O7A1hFmCSKJJYm1PL3D32IUCRXRyX_CTz_t8j9ALLP7Fw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+new+class+of+costs+for+optimal+transport+planning&rft.jtitle=European+journal+of+applied+mathematics&rft.au=ALIBERT%2C+J.-J.&rft.au=BOUCHITT%C3%89%2C+G.&rft.au=CHAMPION%2C+T.&rft.date=2019-12-01&rft.issn=0956-7925&rft.eissn=1469-4425&rft.volume=30&rft.issue=6&rft.spage=1229&rft.epage=1263&rft_id=info:doi/10.1017%2FS0956792518000669&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S0956792518000669
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0956-7925&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0956-7925&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0956-7925&client=summon