Abstract
dc:description.abstractIn my work, I present numerical methods for solving the optimal transport (OT) problems in three settings. Firstly, I discuss discrete OT problems from the perspective of linear programming and assignment problems. Additionally, I provide a solution for a discrete problem with an obstacle in the domain. Next, I consider and compare several different numerical methods to solve the classic continuous OT problem with the squared Euclidean cost function. I compare two numerical methods used for the fluid dynamics formulation with a direct discretization of the Monge-Ampère PDE. Furthermore, I introduce a new class of problems called separable, for which very accurate methods can be devised. Lastly, I propose a novel implementation of Newton's method for solving semi-discrete OT problems for cost functions that are a positive combination of $p$-norms, $1<p<\infty$. By exploiting the geometry of the Laguerre cells, one can obtain an efficient and reliable implementation of Newton's method to find the sought network structure. Moreover, I discuss the generalization of the semi-discrete problem in higher dimensions and the application of the proposed algorithm in drawing electoral districts.
Degree
thesis:*- Level thesis:degree_level
- Doctoral
- Department dc:contributor.department
- Mathematics
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2024
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Omarov, Daniyar
- Advisor dc:contributor.advisor
-
- Dieci, Luca
- Committee members dc:contributor.committeemember
-
- Kang, Sung Ha
- Liao, Wenjing
- Chow, Edmond
- Zhou, Haomin
Subjects
dc:subject × 4Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/1853/75247