In this talk we discuss two methods for optimal mass transport. One is based on sequential quadratic programming and the other is based on the method of Angenent Haker and Tannenbaum.
We discuss the numerical properties of each of these methods and show that it is possible to combine them in order to obtain a better numerical method.