Speaker
Nataliia Monina
Description
In recent years, convex regularization has gained a lot of attention in the context of optimal transport (OT). In this talk, we shall see how these ideas have transcended from the classical theory into the world of quantum optimal transport (QOT). Furthermore, we will look beyond QOT and consider a broader concept of optimization problems known as semidefinite programming (SDP). We begin by discussing convex regularization and duality of QOT and SDP in a finite-dimensional setting. As the next step, we also look at what happens if we extend this theory to an infinite dimension.