Full metadata record
DC FieldValueLanguage
dc.contributor.authorHillbrecht, Sebastian-
dc.contributor.authorManns, Paul-
dc.contributor.authorMeyer, Christian-
dc.date.accessioned2022-11-22T15:53:58Z-
dc.date.available2022-11-22T15:53:58Z-
dc.date.issued2022-11-
dc.identifier.issn2190-1767-
dc.identifier.urihttp://hdl.handle.net/2003/41139-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-22986-
dc.description.abstractThis paper is concerned with an optimization problem that is constrained by the Kantorovich optimal transportation problem. This bilevel optimization problem can be reformulated as a mathematical problem with complementarity constraints in the space of regular Borel measures. Because of the non-smoothness induced by the complementarity relations, problems of this type are frequently regularized. Here we apply a quadratic regularization of the Kantorovich problem. As the title indicates, this is the second part in a series of three papers. While the existence of optimal solutions to both the bilevel Kantorovich problem and its regularized counterpart were shown in the first part, this paper deals with the (weak-∗) convergence of solutions to the regularized bilevel problem to solutions of the original bilevel Kantorovich problem.en
dc.language.isoen-
dc.relation.ispartofseriesErgebnisberichte des Instituts für Angewandte Mathematik;657-
dc.subjectoptimal transporten
dc.subjectKantorovich problemen
dc.subjectbilevel optimizationen
dc.subjectquadratic regularizationen
dc.subject.ddc610-
dc.titleBilevel Optimization of the Kantorovich problem and its quadratic regularization Part:II Convergence Analysisen
dc.typeText-
dc.type.publicationtypepreprint-
dcterms.accessRightsopen access-
eldorado.secondarypublicationfalse-
Appears in Collections:Ergebnisberichte des Instituts für Angewandte Mathematik

Files in This Item:
File Description SizeFormat 
Ergebnisbericht Nr. 657.pdfDNB459.78 kBAdobe PDFView/Open


This item is protected by original copyright



Items in Eldorado are protected by copyright, with all rights reserved, unless otherwise indicated.